Compressed indexes for approximate string matching

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

Volumn 4168 LNCS, Issue , 2006, Pages 208-219

  Chan, Ho Leung ^a   Lam, Tak Wah ^a   Sung, Wing Kin ^b   Tam, Siu Lung ^a   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

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DNA SEQUENCES; ERROR DETECTION; INDEXING (OF INFORMATION); PATTERN MATCHING;

STRING MATCHING; SUBSTRINGS;

PROBLEM SOLVING;

EID: 33750719108     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841036_21     Document Type: Conference Paper

References (21)

1. A. Amir, D. Keselman, G. M. Landau, M. Lewenstein, N. Lewenstein, and M. Rodeh. Indexing and dictionary matching with one error. In Proceedings of Workshop on Algorithms and Data Structures, 1999, pages 181-192.
2. A. L. Buchsbaum, M. T. Goodrich, and J. R. Westbrook. Range searching over tree cross products. In European Symposium on Algorithms, 2000, pages 120-131.
3. E. Chavez and G. Navarro. A metric index for approximate string matching. In Proceedings of Latin American Theoretical Informatics, 2002, pages 181-195.
4. A. Cobbs. Fast approximate matching using suffix trees. In Proceedings of Symposium on Combinatorial Pattern Matching, 1995, pages 41-54.
5. R. Cole, L. A. Gottlieb, and M. Lewenstein. Dictionary matching and indexing with errors and don't cares. In Proceedings of Symposium on Theory of Computing, 2004, pages 91-100.
6. H. L. Chan, T. W. Lam, W. K. Sung, S. L. Tarn, and S. S. Wong. A Linear-Size Index for Approximate Pattern Matching. To appear in CPM, 2006.
7. P. Ferragina and G. Manzini. Opportunistic Data Structures with Applications. In Symposium on Foundations of Computer Science, 2000, pages 390-398.
8. R. Grossi and J. S. Vitter. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. In Proceedings of Symposium on Theory of Computing, 2000, pages 397-406.
9. D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338-355, 1984.
10. T. N. D. Huynh, W. K. Hon, T. W. Lam, and W. K. Sung. Approximate string matching using compressed suffix arrays. In Proceedings of Symposium on Combinatorial Pattern Matching, 2004, pages 434-444.
11. T. W. Lam, W. K. Sung, S. S. Wong. Improved approximate string matching using compressed suffix data structures. In Proceedings of International Symposium on Algorithms and Computation, 2005.
12. M. G. Maaß and J. Nowak. Text indexing with errors. Technical Report TUM10503, Fakultät für Informatik, TU München, Mar. 2005.
13. U. Manber and G. Myers. Suffix Arrays: A New Method for On-Line String Searches. SIAM Journal on Computing, 22(5):935-948, 1993.
14. E. M. McCreight. A Space-economical Suffix Tree Construction Algorithm. Journal of the ACM, 23(2):262-272, 1976.
15. J. I. Munro. Tables. In Proceedings of Conference on Foundations of Software Technology and Computer Science, 1996, pages 37-42.
16. S. Muthukrishnan. Efficient algorithms for document retrieval problems. In Proceedings of 13th Symposium on Discrete Algorithms, 2002, pages 657-666.
17. G. Navarro and R. Baeza-Yates. A Hybrid Indexing Method for Approximate String Matching. J. Discrete Algorithms, 1(1):205-209, 2000.
18. R. Raman, V. Raman, and S. S. Rao Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms, 2002, pages 233-242.
19. K. Sadakane. Succinct representations of Icp information and improvements in the compressed suffix arrays. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms, 2002, pages 225-232.
20. P. Weiner. Linear Pattern Matching Algorithms. In Proceedings of Symposium on Switching and Automata Theory, 1973, pages 1-11.
21. D. E. Willard. Log-Logarithmic worst-case range queries are possible in space ⊖(n). Information Processing Letters, 17(2):81-84, 1983.