A linear size index for approximate pattern matching

Journal of Discrete Algorithms

Volumn 9, Issue 4, 2011, Pages 358-364

  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

Approximate pattern matching; Full text indexing; Indexing with errors; Space complexity

Indexed keywords

APPROXIMATE PATTERN MATCHING; FULL TEXT INDEXING; K ERRORS; PATTERN LENGTH; SPACE COMPLEXITY; TIME COMPLEXITY;

DNA SEQUENCES; ERRORS; INDEXING (OF INFORMATION);

PATTERN MATCHING;

EID: 80755140493     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2011.04.004     Document Type: Conference Paper

References (15)

1. A. Amir, D. Keselman, G.M. Landau, M. Lewenstein, N. Lewenstein, and M. Rodeh Text indexing and dictionary matching with one error J. Algorithms 37 2 2000 309 325
2. A.L. Buchsbaum, M.T. Goodrich, J.R. Westbrook, Range searching over tree cross products, in: Proceedings of European Symposium on Algorithms, 2000, pp. 120-131.
3. E. Chavez, G. Navarro, A metric index for approximate string matching, in: Proceedings of Latin American Theoretical Informatics, 2002, pp. 181-195.
4. A. Cobbs, Fast approximate matching using suffix trees, in: Proceedings of Symposium on Combinatorial Pattern Matching, 1995, pp. 41-54.
5. R. Cole, L.A. Gottlieb, M. Lewenstein, Dictionary matching and indexing with errors and don't cares, in: Proceedings of Symposium on Theory of Computing, 2004, pp. 91-100.
6. P. Ferragina, G. Manzini, Opportunistic data structures with applications, in: Proceedings of Symposium on Foundations of Computer Science, 2000, pp. 390-398. (Pubitemid 32075908)
7. R. Grossi, and J.S. Vitter Compressed suffix arrays and suffix trees with applications to text indexing and string matching SIAM J. Comput. 35 2 2005 378 407
8. T.N.D. Huynh, W.K. Hon, T.W. Lam, W.K. Sung, Approximate string matching using compressed suffix arrays, in: Proceedings of Symposium on Combinatorial Pattern Matching, 2004, pp. 434-444.
9. T.W. Lam, W.K. Sung, and S.S. Wong Improved approximate string matching using compressed suffix data structures Algorithmica 51 3 2008 298 341
10. M.G. Maaß, and J. Nowak Text indexing with errors J. Discrete Algorithms 5 4 2007 662 681 (Pubitemid 47576793)
11. U. Manber, and G. Myers Suffix arrays: A new method for on-line string searches SIAM J. Comput. 22 5 1993 935 948
12. E.M. McCreight A space-economical suffix tree construction algorithm J. ACM 23 2 1976 262 272
13. G. Navarro, and R. Baeza-Yates A hybrid indexing method for approximate string matching J. Discrete Algorithms 1 1 2000 205 209
14. K. Sadakane Compressed suffix trees with full functionality Theory Comput. Syst. 41 4 2007 589 607
15. P. Weiner, Linear pattern matching algorithms, in: Proceedings of Symposium on Switching and Automata Theory, 1973, pp. 1-11.