Improved approximate string matching using compressed suffix data structures

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

Volumn 3827 LNCS, Issue , 2005, Pages 339-348

  Lam, Tak Wah ^a   Sung, Wing Kin ^b   Wong, Swee Seong ^b  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA COMPRESSION; ERROR ANALYSIS; INDEXING (OF INFORMATION); NUMBER THEORY; PROBLEM SOLVING; SET THEORY;

K-MISMATCH; LOG; SLOW DOWN FACTOR; STRING PATTERNS;

DATA STRUCTURES;

EID: 33744960824     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_35     Document Type: Conference Paper

References (14)

1. A. Amir, D. Keselman, G. M. Landau, M. Lewenstein, N. Lewenstein, and M. Roden. Text indexing and dictionary matching with one error. Journal of Algorithms, 37(2):309-325, 2000.
2. A. L. Buchsbaum, M. T. Goodrich, and J. R. Westbrook. Range searching over tree cross products. In Proceedings of the 8th Annual European Symposium on Algorithms, pages 120-131, 2000.
3. A. L. Cobbs. Fast approximate matching using suffix trees. In Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching, pages 41-54, July 1995.
4. R. Cole, L-A. Gottlieb, and M. Lewenstein. Dictionary matcing and indexing with errors and don't cares. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 91-100, 2004.
5. R. Grossi and J. S. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In Proceedings of the 32nd ACM Symposium on Theory of Computing, pages 397-406, 2000.
6. P. Jokinen and E. Ukkonen. Two algorithms for approximate string matching in static texts. In Proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science, pages 240-248, September 1991.
7. J. I. Munro, V. Raman, and S. S. Rao. Space efficient suffix trees. Journal of Algorithms, 39:205-222, 2001.
8. G. Navarro and R.Baeza-Yates. A hybrid indexing method for approximate string matching. Journal of Discrete Algorithms, 1(1):205-239, 2000.
9. G. Navarro, E. Sutinen, J. Tanninen, and J. Tarhio. Indexing text with approximate q-grams. In Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, pages 350-365, 2000.
10. S. S. Rao. Time-space trade-offs for compressed suffix arrays. Information Processing Letters, 82:307-311, 2002.
11. K. Sadakane. Compressed suffix trees with full functionality. Theory of Computing Systems, Accepted.
12. H. N. D. Trinh, W. K. Hon, T. W. Lam, and W. K. Sung. Approximate string matching using compressed suffix arrays. In Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, pages 434-444, 2004.
13. E. Ukkonen. Approximate string-matching over suffix trees. In Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching, pages 228-242, 1993.
14. D. E. Willard. Log-logarithmic worst-case range queries are possible in space θ(n). Information Processing Letters, 17:81-84, August 1983.