Efficient indexing algorithms for approximate pattern matching in text

Proceedings of the 17th Australasian Document Computing Symposium, ADCS 2012

Volumn , Issue , 2012, Pages 9-16

  Petri, Matthias ^a   Culpepper, J Shane ^a  

^a RMIT UNIVERSITY   (Australia)

Author keywords

Approximate pattern matching; Burrows wheeler transform

Indexed keywords

APPROXIMATE PATTERN MATCHING; BURROWS WHEELER TRANSFORM; COMPUTATIONAL PROBLEM; DNA DATABASE; INDEXING ALGORITHMS; KEYWORD QUERIES; LANGUAGE MODEL; NATURAL LANGUAGES; RANKING ALGORITHM; SCANNED TEXT; SEARCH EFFICIENCY; SEARCH QUERIES; SEQUENCING ERRORS; TEXT COLLECTION; TEXT-INDEXING; VARIABLE DEPTH;

ALGORITHMS; BACKWARD WAVE TUBES; COMPUTATIONAL LINGUISTICS; GENE ENCODING; QUERY PROCESSING;

PATTERN MATCHING;

EID: 84871632660     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2407085.2407087     Document Type: Conference Paper

References (27)

1. N. R. Brisaboa, R. Cánovas, F. Claude, M. A. Martínez- Prieto, and G. Navarro. Compressed string dictionaries. In SEA, pages 136-147, 2011.
2. M. Burrows and D. J. Wheeler. A block-sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, Palo Alto, California, May 1994.
3. H. L. Chan, T. W. Lam, W. K. Sung, S. L. Tam, and S. S. Wong. Compressed indexes for approximate string matching. Algorithmica, 58(2):263-281, 2010.
4. J. S. Culpepper, M. Petri, and S. J. Puglisi. Revisiting bounded context block-sorting transformations. Software Practice and Experience, 42 (8):1037-1054, August 2012.
5. P. Ferragina and G. Manzini. Opportunistic data structures with applications. In FOCS, pages 390-398, 2000.
6. P. Ferragina, R. González, G. Navarro, and R. Venturini. Compressed text indexes: from theory to practice. Journal of Experimental Algorithmics, 13:1.12-1.31, 2009.
7. R. Grossi, A. Gupta, and J. S. Vitter. High-order entropy-compressed text indexes. In SODA, pages 841-850, 2003.
8. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York, New York, USA, 1997.
9. J. Kärkkäinen and T. Rantala. Engineering radix sort for strings. In SPIRE, pages 3-14, 2008.
10. K. Kukich. Techniques for automatically correcting words in text. ACM Computing Surveys, 24(4):377-439, 1992.
11. H. Li and R. Durbin. Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics, 25(14):1754-1760, 2009.
12. D. Metzler and W. B. Croft. A markov random field model for term dependencies. In SIGIR, pages 472-479, 2005.
13. G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88, 2001.
14. G. Navarro. Wavelet trees for all. In CPM, pages 2-26, 2012.
15. G. Navarro and R. A. Baeza-Yates. A practical q-gram index for text retrieval allowing errors. CLEI Electron. J., 1(2), 1998.
16. G. Navarro and V. Mäkinen. Compressed full-text indexes. ACM Comput. Surv., 39(1), 2007.
17. G. Navarro and M. Raffinot. Flexible Pattern Matching in Strings - Practical on-line search algorithms for texts and biological sequences. Cambridge University Press, 2002. ISBN 0-521-81307-7. 280 pages.
18. G. Navarro and L. Salmela. Indexing variable length substrings for exact and approximate matching. In SPIRE, pages 214-221, 2009.
19. G. Navarro, R. A. Baeza-Yates, E. Sutinen, and J. Tarhio. Indexing methods for approximate string matching. IEEE Data Eng. Bull., 24 (4):19-27, 2001.
20. G. Nong, S. Zhang, and W. H. Chan. Computing inverse ST in linear complexity. In CPM, pages 178-190, 2008.
21. M. Petri, G. Navarro, J. S. Culpepper, and S. J. Puglisi. Backwards search in context bound text transformations. In CCP, pages 82-91, 2011.
22. R. Raman, V. Raman, and S. S. Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In SODA, pages 233-242, 2002.
23. L. Russo, G. Navarro, A. Oliveira, and P. Morales. Approximate string matching with compressed indexes. Algorithms, 2(3):1105- 1136, 2009.
24. M. Schindler. A fast block-sorting algorithm for lossless data compression. In J. A. Storer and M. Cohn, editors, DCC, page 469, Los Alamitos, California, March 1997. IEEE Computer Society Press.
25. F. Scholer, H. E. Williams, J. Yiannis, and J. Zobel. Compression of inverted indexes for fast query evaluation. In SIGIR, pages 222-229, 2002.
26. S. Wu and U. Manber. Fast text searching allowing errors. Communications of the ACM, 35(10):83-91, 1992.
27. H. Yokoo. Notes on block-sorting data compression. Electronics and Communications in Japan, Part 3, 82(6):18-25, 1999.