### Table 1: Time for approximate matching in seconds. m is the pattern length and k is the edit distance.

2001

"... In PAGE 5: ...We used a Sun Ultra 450 workstation (400MHz CPU, 4G bytes memory). Table1 shows the time for approximate matching with error level 5%.... ..."

Cited by 14

### Table 1: Time for approximate matching in seconds. m is the pattern length and k is the edit distance.

"... In PAGE 5: ...We used a Sun Ultra 450 workstation (400MHz CPU, 4G bytes memory). Table1 shows the time for approximate matching with error level 5%.... ..."

### Table 1: Time for approximate matching in seconds. m is the pattern length and k is the edit distance.

"... In PAGE 5: ...We used a Sun Ultra 450 workstation (400MHz CPU, 4G bytes memory). Table1 shows the time for approximate matching with error level 5%.... ..."

### Table 1: Edit distance calculation (arranged by CUPS/chip).

1993

"... In PAGE 4: ... However, the e ort in programming these systems is signi cantly lower than designing a VLSI chip, and they are general-purpose, able to perform a large number of functions. Table1 summarizes the performance of several of these machines. The number of PEs, maximum native sequence length, and the approximate number of chips are listed for each machine.... In PAGE 5: ... Jones reports 75 MCUPS on a 64K CM-2 (corresponding to two times faster than the results in the table) by microcoding the inner loop of the dynamic programming algorithm [19]; Jones has also presented methods for database pattern searching with limited gap length on the CM-2 [18]. By making full use of modulo sequence comparison to reduce data communication, this author estimates that a factor of 2{4 performance increase is attainable over the CM-2 and MP-1 results of Table1 for long sequences [16]. Core has compared dynamic programming and the BLAST algorithm on the CM-1 and Intel iPSC hypercube computer [8].... ..."

Cited by 6

### Table 1: Edit distance calculation (arranged by CUPS/chip).

1993

"... In PAGE 4: ... However, the e ort in programming these systems is signi cantly lower than designing a VLSI chip, and they are general-purpose, able to perform a large number of functions. Table1 summarizes the performance of several of these machines. The number of PEs, maximum native sequence length, and the approximate number of chips are listed for each machine.... In PAGE 5: ... Jones reports 75 MCUPS on a 64K CM-2 (corresponding to two times faster than the results in the table) by microcoding the inner loop of the dynamic programming algorithm [19]; Jones has also presented methods for database pattern searching with limited gap length on the CM-2 [18]. By making full use of modulo sequence comparison to reduce data communication, this author estimates that a factor of 2{4 performance increase is attainable over the CM-2 and MP-1 results of Table1 for long sequences [16]. Core has compared dynamic programming and the BLAST algorithm on the CM-1 and Intel iPSC hypercube computer [8].... ..."

Cited by 6

### Table 1: Accuracy of the tree edit distance and its approximations.

2005

"... In PAGE 10: ... It is computed in the same way as the pq-gram distance, the only di erence being that the pro le of a tree consists of the bag of all its node labels. The results for the address tables RO and LR are shown in Table1 . There are two streets in RO that do not exist in LR, thus jMcj = 300 for the calculation of the accuracy.... ..."

Cited by 2

### Table 1: Performance comparison of cell stream conformance checking schemes.

1994

"... In PAGE 13: ... We use a negative-binomial distribution for the cell inter-arrival time distribution whichallows to vary the mean and the coe cientofvariation almost independently of eachother(E A c 2 A gt; 1must be ful lled). Table1 shows the cell rejection probability for the four conformance monitoring schemes if the coe cientofvariation c A of the arrival process is varied. To denote the rejection probabilities of the schemes i) to iv), cf.... ..."

Cited by 15

### Table 6: Edit and block distances for signal waveforms with amp; without transaction recognition Signals Edit/block Distance

2001

"... In PAGE 10: ... Table 5: Regular expressions for encryption for two models Model 1 a b reset gcd Model 2 Reset load a b gcd done (x y 0 /) (/ / / z) (0 0 - - - 1) (0 1 x y - 1) [ (1 0 - - - 0) ]+ (1 0 - - z 1) 26 test vectors are used to simulate both cores. Table6 reports the distances with and without transaction recognition. Table 6: Edit and block distances for signal waveforms with amp; without transaction recognition Signals Edit/block Distance... ..."

### Table 4: Edit and block distances for signal waveforms with amp; without transaction recognition Signals Edit/block Distance

2001

"... In PAGE 9: ...ransaction. Table 3 provides a pair of regular expressions for two models. Table 3: Regular expressions for encryption for two models Model 1 Decrypt d_in key d_out Model 2 Reset decrypt d_in key d_out ( 0 x y - ) { 15 }3 ( 0 x y z ) (0 1 x / / ) (0 1 / y /) (0 1 / / /) { 15 } (0 1 / / z) 90 test vectors were used to simulate both cores. Table4 presents the distances with and without transaction recognition. Table 4: Edit and block distances for signal waveforms with amp; without transaction recognition Signals Edit/block Distance... ..."

### Table 8: Edit and block distances for signal waveforms with amp; without transaction recognition Edit/block Distance

2001

"... In PAGE 10: ... Table 7: Regular expressions for arithmetic models Model 1 Theta sine cosine Model 2 Theta sine cosine (x - -)+ (x y z) (x y z) 45 test vectors were used to simulate both cores. Table8 summarizes the distances with and without transaction recognition. Note that in this case, the binary values are converted into real values before comparison.... ..."