Inverted files versus suffix arrays for locating patterns in primary memory

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

Volumn 4209 LNCS, Issue , 2006, Pages 122-133

  Puglisi, Simon J ^a   Smyth, W F ^a,b   Turpin, Andrew ^c  

^a CURTIN UNIVERSITY   (Australia)

^b MCMASTER UNIVERSITY   (Canada)

^c RMIT UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA COMPRESSION; DATA REDUCTION; DATA STRUCTURES; INDEXING (OF INFORMATION); PATTERN MATCHING;

ENGLISH; SUFFIX ARRAY ALGORITHMS; WORD BASED SEARCH;

DATA STORAGE EQUIPMENT;

EID: 33750306791     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11880561_11     Document Type: Conference Paper

References (35)

1. M. I. Abouelhoda, S. Kurtz, and E. Ohlebusch. Optimal exact string matching based on suffix arrays. In SPIRE 2002, number 2476 in LNCS, pages 31-43. Springer-Verlag, Berlin, 2002.
2. S. F. Altschul, W. Gish, W. Miller, E. W. Myers, and D. J. Lipman. Basic local alignment search tool. Journal of Molecular Biology, 215:403-410, 1990.
3. V. N. Anh and A. Moffat. Inverted index compression using word-aligned binary codes. Information Retrieval, 8:151-166, 2005.
4. D. Benson, D.J. Lipman, and J. Ostell. GenBank. Nucleic Acids Research, 21(13):2963-2965, 1993.
5. D.A. Benson, I. Karsch-Mizrachi, D.J. Lipman, J. Ostell, and D.L. Wheeler. Genbank. Nucleic Acids Research, 33:D34-D38, 2005.
6. M. Burrows and D. J. Wheeler. A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, Palo Alto, California, 1994.
7. M. Cameron, H.E. Williams, and A. Cannane. Improved gapped alignment in blast. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 1(3):116-129, 2004.
8. Y. Choi and K. Park. Time and space efficient search with suffix arrays. In S. Hong, editor, Proceedings of AWOCA '04, pages 230-238, Ballina, Australia, 2004.
9. E. S. De Moura, G. Navarro, N. Ziviani, and R. Baeza-Yates. Fast and flexible word searching on compressed text. ACM Transactions on Information Systems, 18(2):113-139, 2000.
10. Ensembl. Ensembl Genome Browser, 2006. http://www.ensembl.org.
11. P. Ferragina and G. Manzini. Opportunistic data structures with applications. In Proceedings of the 41st IEEE Symposium on Found of Comp. Sci., pages 390-398, Redondo Beach, CA, 2000. IEEE Computer Society.
12. P. Ferragina and G. Navarro. Pizza& Chili Corpus - Compressed Indexes and their Testbeds, 2005. http://pizzachili.dcc.uchile.cl.
13. R. Grossi, J. S. Vitter, and A. Gupta. When indexing equals compression: Experiments with compressing suffix arrays and applications. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, pages 636-645, 2004.
14. D. K. Harman. Overview of the second text retrieval conference (TREC-2). Information Processing and Management, 31(3):271-289, 1995.
15. J. Kärkkäinen. Ziv-Lempel index for q-grams. Algorithmica, 21(1):137-154, 1998.
16. S. Kurtz. Reducing the space requirement of suffix trees. Software, Practice and Experience, 29(13):1149-1171, 1999.
17. V. Mäkinen and G. Navarro. Succinct suffix arrays based on run-length encoding. Nordic Journal of Computing, 12(2):40-66, 2005.
18. V. Mäkinen and G. Navarro. Compressed full text indexes. Technical Report TR/DCC-2005-7, Department of Computer Science, University of Chile, June 2006.
19. V. Mäkinen, G. Navarro, and K. Sadakane. Advantages of backward searching -efficient secondary memory and distributed implementation of compressed suffix arrays. In Algorithms and Computation: 15th International Symposium, ISAAC 2004, number 3341 in LNCS, pages 681-692. Springer-Verlag, Berlin, 2004.
20. U. Manber and G. W. Myers. Suffix arrays: a new model for on-line string searches. SI AM Journal of Computing, 22(5):935-948, 1993.
21. U. Manber and S. Wu. Glimpse: A tool to search through entire file systems. In Proceedings of the USENIX Technical Conference, pages 23-32, Berkeley, CA, 1994. USENIX Association.
22. G. Manzini. An analysis of the Burrows-Wheeler transform. Journal of the ACM, 48(3):407-430, 2001.
23. E. M. McCreight. A space-economical suffix tree construction algroithm. Journal of the ACM, 23(2):262-272, 1976.
24. G. Navarro, E. S. De Moura, M. Neubert, N. Ziviani, and R. Baeza-Yates. Adding compression to block addressing inverted indexes. Information Retrieval, 3:49-77, 2000.
25. NCBI. NCBI Blast, 2006. http://www.ncbi.nlm.nih.gov/BLAST/.
26. Simon J. Puglisi, W. F. Smyth, and Andrew H. Turpin. A taxonomy of suffix array construction algorithms. In Proceedings of the Prague Stringology Conference, pages 1-30, Prague, August 2005. Czech Technical University.
27. K. Sadakane. Compressed text databases with efficient query algorithms based on the compressed suffix array. In Algorithms and Computation: 11th International Conference, ISAAC 2000, number 1969 in LNCS, pages 410-421. Springer-Verlag, Berlin, 2000.
28. K. Sadakane. Succinct representations of Icp information and improvements in the compressed suffix arrays. In Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, pages 225-232, San Francisco, CA, 2002.
29. J. S. Sim, D. K. Kim, H. Park, and K. Park. Linear-time search in suffix arrays. In M. Miller and K. Park, editors, Proceedings of AWOCA'03, pages 139-146, Seoul, Korea, 2003.
30. W. F. Smyth. Computing Patterns in Strings. Addison-Wesley-Pearson Education Limited, Essex, England, 2003.
31. P. Weiner. Linear pattern matching algorithms. In Proceedings of the 14th annual Symposium on Foundations of Computer Science, pages 1-11, 1973.
32. H. E. Williams and J. Zobel. Indexing and retrieval for genomic databases. IEEE Transactions on Knowledge and Data Engineering, 14(1):63-78, 2002.
33. Hugh Williams and Justin Zobel. Compression of nucleotide databases for fast searching. CABIOS Computer Applications in the Biological Sciences, 13(5):549-554, October 1997.
34. I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images - 2nd Edition. Morgan Kaufmann Publishing, San Francisco, 1999.
35. J. Zobel, A. Moffat, and R. Sacks-Davis. Searching large lexicons for partially specified terms using compressed inverted files. In R. Agrawal, S. Baker, and D. Bell, editors, Proceedings of the International Conference on Very Large Data Bases, pages 290-301, Dublin, Ireland, August 1993.