Approximate string matching using compressed suffix arrays

Theoretical Computer Science

Volumn 352, Issue 1-3, 2006, Pages 240-249

  Huynh, Trinh N D ^a   Hon, Wing Kai ^b   Lam, Tak Wah ^b   Sung, Wing Kin ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; DATA STRUCTURES; PROBLEM SOLVING; QUERY LANGUAGES;

COMPRESSED SUFFIX ARRAYS; FINITE ALPHABET; PATTERN QUERY; STRING MATCHING;

DATA COMPRESSION;

EID: 32644436921     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.11.022     Document Type: Article

References (30)

1. A. Amir, D. Keselman, G.M. Landau, M. Lewenstein, N. Lewenstein, M. Rodeh, Indexing and dictionary matching with one error, in: Proc. Sixth WADS, Lecture Notes in Computer Science, vol. 1663, Springer, Berlin, 1999, pp. 181-192.
2. A. Amir, M. Lewenstein, Ely. Porat, Faster algorithms for string matching with k mismatches, in: Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms, 2000, pp. 794-803.
3. R.A. Baeza-Yates, G. Navarro, A faster algorithm for approximate string matching, in: Proc. Seventh Ann. Symp. on Combinatorial Pattern Matching (CPM'96), pp. 1-23.
4. R.A. Baeza-Yates, G. Navarro, A practical index for text retrieval allowing errors, in: CLEI, vol. 1, November 1997, pp. 273-282.
5. R. Boyer, and S. Moore A fast string matching algorithm CACM 20 1977 762 772
6. A.L. Buchsbaum, M.T. Goodrich, J. Westbrook, Range searching over tree cross products. in: ESA 2000, pp. 120-131.
7. A. Cobbs, Fast approximate matching using suffix trees. in: Proc. Sixth Ann. Symp. on Combinatorial Pattern Matching (CPM'95), Lecture Notes in Computer Science, vol. 807, Springer, Berlin, 1995, pp. 41-54.
8. R. Cole, L.A. Gottlieb, M. Lewenstein, Dictionary matching and indexing with errors and don't cares, in: Proc. 36th Ann. ACM Symp. on Theory of Computing, 2004, pp. 91-100.
9. P. Ferragina, G. Manzini, Opportunistic data structures with applications, in: Proc. 41st IEEE Symp. on Foundations of Computer Science (FOCS'00), 2000, pp. 390-398.
10. G. Gonnet, A tutorial introduction to computational biochemistry using Darwin, Technical Report, Informatik E.T.H., Zurich, Switzerland, 1992.
11. R. Grossi, J.S. Vitter, Compressed suffix arrays and suffix trees with applications to text indexing and string matching, in: Proc. 32nd ACM Symp. on Theory of Computing, 2000, pp. 397-406.
12. D. Gusfield Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology 1997 Cambridge University Press Cambridge
13. W.K. Hon, K. Sadakane, W.K. Sung. Breaking a time-and-space barrier in constructing full-text indices, in: Proc. IEEE Symp. on Foundations of Computer Science, 2003.
14. P. Jokinen, E. Ukkonen, Two algorithms for approximate string matching in static texts. in: Proc. MFCS'91, Lecture Notes in Computer Science, vol. 520, Springer, Berlin, 1991, pp. 240-248.
15. D.K. Kim, J.S. Sim, H. Park, K. Park, Linear-time construction of suffix arrays, in: CPM 2003, pp. 186-199.
16. D.E. Knuth, J. Morris, and V. Pratt Fast pattern matching in strings SIAM J. Comput. 6 1977 323 350
17. P. Ko, S. Aluru, Space efficient linear time construction of suffix arrays. in: CPM 2003, pp. 200-210.
18. G.M. Landau, and U. Vishkin Fast parallel and serial approximate string matching J. Algorithms 10 1989 157 169
19. U. Manber, and G. Myers Suffix arrays: a new method for on-line string searches SIAM J. Comput. 22 5 1993 935 948
20. E.M. MCreight A space economical suffix tree construction algorithm J. ACM 23 2 1976 262 272
21. G. Navarro A guided tour to approximate string matching ACM Comput. Surveys 33 1 2001 31 88
22. G. Navarro, R.A. Baeza-Yates, A new indexing method for approximate string matching, in: Proc. 10th Ann. Symp. on Combinatorial Pattern Matching (CPM'99), pp. 163-185.
23. G. Navarro, and R.A. Baeza-Yates A hybrid indexing method for approximate string matching J. Discrete Algorithms 1 1 2000 205 239 18
24. G. Navarro, R. Baeza-Yates, E. Sutinen, and J. Tarhio Indexing methods for approximate string matching IEEE Data Eng. Bull. 24 4 2001 19 27
25. G. Navarro, E. Sutinen, J. Tanninen, J. Tarhio, Indexing text with approximate q-grams, in: Proc. 11th Ann. Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science, vol. 1848, Springer, Berlin, 2000.
26. K. Sadakane, and T. Shibuya Indexing huge genome sequences for solving various problems Genome Informatics 12 2001 175 183
27. F. Shi, Fast approximate string matching with q-blocks sequences, in: Proc. Third South American Workshop on String Processing (WSP'96), Carleton University Press, 1996.
28. E. Sutinen, J. Tarhio, Filtration with q-samples in approximate string matching. in: Proc. Seventh Ann. Symp. on Combinatorial Pattern Matching (CPM'96), pp. 50-63.
29. E. Ukkonen, Approximate matching over suffix trees, in: Proc. Combinatorial Pattern Matching 1993, vol. 4, Springer, Berlin, June 1993, pp. 228-242.
30. R.A. Wagner, and M.J. Fischer The string-to-string correction problem J. ACM 21 1974 168 173