A linear size index for approximate pattern matching

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

Volumn 4009 LNCS, Issue , 2006, Pages 49-59

  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

COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; LINEAR SYSTEMS; PERFORMANCE; PROBLEM SOLVING;

APPROXIMATE PATTERN MATCHING; ERROR MATCHING; LINEAR SIZE INDEX; SEARCHING SUBSTRINGS;

PATTERN MATCHING;

EID: 33746032583     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780441_6     Document Type: Conference Paper

References (15)

1. A. Amir, D. Keselman, G. M. Landau, M. Lewenstein, N. Leweristein, 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 Proceedings of 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 sufiix 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. P. Ferragina and G. Manzini. Opportunistic Data Structures with Applications. In Proceedings of Symposium on Foundations of Computer Science, pages 390-398, 2000.
7. 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, pages 397-406, 2000.
8. 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.
9. 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, pages 339-348.
10. M. G. Maaß and J. Nowak. Text indexing with errors. Technical Report TUM-10503, Fakultät für Informatik, TU München, Mar. 2005.
11. U. Manber and G. Myers. Suffix Arrays: A New Method for On-Line String Searches. SIAM Journal on Computing, 22(5):935-948, 1993.
12. E. M. McCreight. A Space-economical Suffix Tree Construction Algorithm. Journal of the ACM, 23(2);262-272, 1976.
13. G. Navarro and R. Baeza-Yates. A Hybrid Indexing Method for Approximate String Matching. J. Discrete Algorithms, 1(1):205-209, 2000. Special issue on Matching Patterns
14. K. Sadakane. Compressed suffix trees with full functionality. Theory of Computing Systems, accepted.
15. P. Weiner, Linear Pattern Matching Algorithms. In Proceedings of Symposium on Switching and Automata Theory, 1973, pages 1-11.