Fast approximate matching using suffix trees

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

Volumn 937, Issue , 1995, Pages 41-54

  Cobbs, Archie L ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957875314     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60044-2_33     Document Type: Conference Paper

References (11)

1. D. Benson, D. J. Lipman, and J. Ostell. Genbank. Nucl. Acids Res., 21(13):2963-2965, 1993.
2. A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, and R. McConnell. Building a complete inverted file for a set of text files in linear time. In FOCS, pages 349-358. ACM, January 1984.
3. M. T. Chen and Joel Seiferas. Efficeient and Elegant Subword Tree Construction, pages 97-107. Springer-Verlag, Berlin, 1985.
4. P. Jokinen and E. Ukkonen. Two algorithms for approximate string matching in static texts. In Proc. MFCS 1991, volume 16, pages 240-248. Springer-Verlag, September 1991.
5. G. M. Landau and U. Vishkin. Fast string matching with k differences. J. Comp. Sys. Sci., 37:63-78, 1988.
6. G. M. Landau and U. Vishkin. Fast parallel and serial approximate string matching. J. Algorithms, 10:157-169, 1989.
7. Edward M. McCreight. A space-economical suffix tree construction algorithm. JACM, 23(2):262-272, April 1976.
8. E. W. Myers. A sublinear algorithm for approximate keyword searching. Algorithmica, 12:345-374, 1994.
9. D. Sankoff and J. B. Kruskal, editors. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, 1983.
10. E. Ukkonen. Approximate matching over suffix trees. In Proc. Combinatorial Pattern Matching 1993, volume 4, pages 228-242. Springer-Verlag, June 1993.
11. P. Weiner. Linear pattern matching algorithms. In 14th Annual Symposium on Switching and Automata Theory, pages 1-11. IEEE, 1973.