The gapped suffix array: A new index structure for fast approximate matching

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

Volumn 6393 LNCS, Issue , 2010, Pages 359-364

  Crochemore, Maxime ^a,b   Tischler, German ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b UNIVERSITÉ PARIS EST   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE MATCHING; APPROXIMATE SEARCHING; NEW INDICES; SEARCH SPEED; SUFFIX ARRAYS; HAMMING DISTANCE MODELS; INDEX STRUCTURE;

DATA STRUCTURES; INFORMATION RETRIEVAL; TOWERS;

HAMMING DISTANCE;

EID: 78449308589     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16321-0_37     Document Type: Conference Paper

References (10)

1. Böckenhauer, H.-J., Bongartz, D.: Algorithmic Aspects of Bioinformatics. Springer, Heidelberg (2007)
2. Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings, 392 p. Cambridge University Press, Cambridge (2007)
3. Fischer, J., Heun, V.: A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 459-470. Springer, Heidelberg (2007)
4. Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: SODA 2003: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 841-850. Society for Industrial and Applied Mathematics, Philadelphia (2003)
5. Grossi, R., Vitter, J.S.: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. SIAM J. Comput. 35(2), 378-407 (2005)
6. Gusfield, D.: Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press, Cambridge (1997)
7. Landau, G.M., Vishkin, U.: Efficient string matching with k mismatches. Theor. Comput. Sci. 43, 239-249 (1986)
8. Landau, G.M., Vishkin, U.: Fast string matching with k differences. J. Comput. Syst. Sci. 37(1), 63-78 (1988)
9. Navarro, G.: A guided tour to approximate string matching. ACM Comput. Surv. 33(1), 31-88 (2001)
10. Navarro, G., Baeza-Yates, R.A., Sutinen, E., Tarhio, J.: Indexing methods for approximate string matching. IEEE Data Eng. Bull. 24(4), 19-27 (2001)