Row-wise tiling for the Myers' bit-parallel approximate string matching algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2857, Issue , 2003, Pages 66-79

  Fredriksson, Kimmo ^a  

^a UNIVERSITY OF EASTERN FINLAND   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; COMPUTER PROGRAMMING; DYNAMIC PROGRAMMING; TEXT PROCESSING;

ACHIEVING TIME; APPROXIMATE STRING MATCHING; BIT-PARALLEL; DYNAMIC PROGRAMMING ALGORITHM; EDIT DISTANCE; EXPECTED RUNNING TIME; LARGE ALPHABETS; MULTIPLE PATTERNS;

ALGORITHMS;

EID: 0142187772     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39984-1_6     Document Type: Article

References (13)

1. R. A. Baeza-Yates and G. Navarro. Faster approximate string matching. Algorithmica, 23(2):127-158, 1999.
2. W. I. Chang and J. Lampe. Theoretical and empirical comparisons of approximate string matching algorithms. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching, number 664 in Lecture Notes in Computer Science, pages 175-184, Tucson, AZ, 1992. Springer-Verlag, Berlin.
3. K. Fredriksson and G. Navarro. Average-optimal multiple approximate string matching. In Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching (CPM 2003), LNCS 2676, pages 109-128, 2003.
4. H. Hyyrö. Extending and explaining the bit-parallel approximate string matching algorithm of Myers. Technical report A2001-10, Department of Computer and Information Sciences, University of Tampere, 2001.
5. H. Hyyrö and G. Navarro. Faster bit-parallel approximate string matching. In Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching (CPM 2002), LNCS 2373, pages 203-224, 2002.
6. G. Myers. A fast bit-vector algorithm for approximate string matching based on dynamic programming. J. Assoc. Comput. Mach., 46(3):395-415, 1999.
7. G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88, 2001.
8. G. Navarro. Indexing text using the ziv-lempel trie. In Proceedings of the 9th International Symposium on String Processing and Information Retrieval (SPIRE 2002), LNCS 2476, pages 325-336. Springer, 2002.
9. G. Navarro and R. Baeza-Yates. Very fast and simple approximate string matching. Information Processing Letters, 72:65-70, 1999.
10. G. Navarro and M. Raffinot. Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithmics (JEA), 5(4), 2000. http://www.jea.acn.org/2000/NavarroString.
11. P. H. Sellers. The theory and computation of evolutionary distances: Pattern recognition. J. Algorithms, 1(4):359-373, 1980.
12. E. Ukkonen. Algorithms for approximate string matching. Inf. Control, 64(1-3):100-118, 1985.
13. A. H. Wright. Approximate string matching using within-word parallelism. Softw. Pract. Exp., 24(4):337-362, 1994.