Practical compressed suffix trees

Algorithms

Volumn 6, Issue 2, 2013, Pages 319-351

  Abeliuk, Andrés ^a   Ćanovas, Rodrigo ^b   Navarro, Gonzalo ^a  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Bioinformatics; Compressed data structures; Repetitive sequence collections; Suffix trees

Indexed keywords

COMPRESSED DATA STRUCTURES; COMPRESSED SUFFIX TREES; LARGE SEQUENCES; MIN-MAX; RECENT RESEARCHES; REPETITIVE SEQUENCE COLLECTIONS; SPACE-TIME TRADEOFFS; SUFFIX-TREES;

BIOINFORMATICS; COMMERCE; DATA STRUCTURES;

FORESTRY;

BIOTECHNOLOGY; COMMERCE; DATA BASES; FORESTRY; INFORMATION RETRIEVAL;

EID: 84880439157     PISSN: None     EISSN: 19994893     Source Type: Journal    
DOI: 10.3390/a6020319     Document Type: Article

References (51)

1. MIT Technology Review. Available online: http://www.technologyreview.com/featuredstory/511051/ inside-chinas-genome-factory (accessed on 20 May 2013).
2. McCreight, E. A space-economical suffix tree construction algorithm. J. ACM 1976, 32, 262-272.
3. Weiner, P. Linear Pattern Matching Algorithms. In Proceedings of the IEEE Symposium on Switching and Automata Theory, Iowa City, IA, USA, 15-17 October 1973; pp. 1-11.
4. Apostolico, A. The Myriad Virtues of Subword Trees. In Combinatorial Algorithms on Words; Springer-Verlag: Berlin, Germany, 1985; pp. 85-96.
5. Gusfield, D. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology; Cambridge University Press: Cambridge, UK, 1997.
6. Kurtz, S. Reducing the space requirements of suffix trees. Softw. Prac. Exp. 1999, 29, 1149-1171.
7. Manber, U.; Myers, E. Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 1993, 22, 935-948.
8. Abouelhoda, M.; Kurtz, S.; Ohlebusch, E. Replacing suffix trees with enhanced suffix arrays. J. Discret. Algorithms 2004, 2, 53-86.
9. Munro, I.; Raman, V.; Rao, S. Space efficient suffix trees. J. Algorithms 2001, 39, 205-222.
10. Sadakane, K. Succinct Representations of Lcp Information and Improvements in the Compressed Suffix Arrays. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, USA, 6-8 January 2002; pp. 225-232.
11. Sadakane, K. Compressed suffix trees with full functionality. Theory Comput. Syst. 2007, 41, 589-607.
12. Sadakane, K. New text indexing functionalities of the compressed suffix arrays. J. Algorithms 2003, 48, 294-313.
13. Russo, L.; Navarro, G.; Oliveira, A. Fully-Compressed Suffix Trees. In Proceedings of the 8th Latin American Symposium on Theoretical Informatics (LATIN), Rio de Janeiro, Brazil, 7-11 April 2008; pp. 362-373.
14. Russo, L.; Navarro, G.; Oliveira, A. Fully-compressed suffix trees. ACM Trans. Algorithms 2011, 7, doi:10.1145/2000807.2000821.
15. Ferragina, P.; Manzini, G.; Mäkinen, V.; Navarro, G. Compressed representations of sequences and full-text indexes. ACM Trans. Algorithms 2007, 3, doi:10.1145/1240233.1240243.
16. Manzini, G. An analysis of the Burrows-Wheeler transform. J. ACM 2001, 48, 407-430.
17. Fischer, J.; Mäkinen, V.; Navarro, G. An(other) Entropy-Bounded Compressed Suffix Tree. In Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching (CPM), Pisa, Italy, 18-20 June 2008; pp. 152-165.
18. Fischer, J.; Mäkinen, V.; Navarro, G. Faster entropy-bounded compressed suffix trees. Theory Comput. Sci. 2009, 410, 5354-5364.
19. Fischer, J. Wee LCP. Inf. Process. Lett. 2010, 110, 317-320.
20. Välimäki, N.; Gerlach, W.; Dixit, K.; Mäkinen, V. Engineering a Compressed Suffix Tree Implementation. In Proceedings of the 6th Workshop on Experimental Algorithms (WEA), Rome, Italy, 6-8 June 2007; pp. 217-228.
21. Gog, S. Compressed Suffix Trees: Design, Construction, and Applications. Ph.D. Thesis, University of Ulm, Ulm, Germany, 2011.
22. Sadakane, K.; Navarro, G. Fully-Functional Succinct Trees. In Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Austin, TX, USA, 17-19 January 2010; pp. 134-149.
23. Arroyuelo, D.; Ćanovas, R.; Navarro, G.; Sadakane, K. Succinct Trees in Practice. In Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX), New York, NY, USA, 3 January 2009; pp. 84-97.
24. Kreft, S.; Navarro, G. Self-Indexing Based on LZ77. In Proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching (CPM), Palermo, Italy, 27-29 June 2011; pp. 41-54.
25. Mäkinen, V.; Navarro, G.; Sirén, J.; Välimäki, N. Storage and retrieval of highly repetitive sequence collections. J. Comput. Biol. 2010, 17, 281-308.
26. Claude, F.; Navarro, G. Self-Indexed Text Compression Using Straight-Line Programs. In Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS), Novy Smokovec, Slovakia, 24-28 August 2009; pp. 235-246.
27. Claude, F.; Fariña, A.; Martínez-Prieto, M.; Navarro, G. Compressed q-Gram Indexing for Highly Repetitive Biological Sequences. In Proceedings of the 10th IEEE Conference on Bioinformatics and Bioengineering (BIBE), Philadelphia, PA, USA, 31 May-3 June 2010; pp. 86-91.
28. Ohlebusch, E.; Fischer, J.; Gog, S. CST++. In Proceedings of the 17th International Symposium on String Processing and Information Retrieval (SPIRE), Los Cabos, Mexico, 11-13 October 2010; pp. 322-333.
29. Ćanovas, R.; Navarro, G. Practical Compressed Suffix Trees. In Proceedings of the 9th International Symposium on Experimental Algorithms (SEA), Ischia Island, Italy, 20-22 May 2010; pp. 94-105.
30. Abeliuk, A.; Navarro, G. Compressed Suffix Trees for Repetitive Texts. In Proceedings of the 19th International Symposium on String Processing and Information Retrieval (SPIRE), Cartagena, Colombia, 21-25 October 2012; pp. 30-41.
31. Navarro, G.; Mäkinen, V. Compressed full-text indexes. ACM Comput. Surv. 2007, 39, doi:10.1145/1216370.1216372.
32. Ferragina, P.; González, R.; Navarro, G.; Venturini, R. Compressed text indexes: From theory to practice. ACM J. Exp. Algorithmics 2009, 13, doi:10.1145/1412228.1455268.
33. Munro, I. Tables. In Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Hyderabad, India, 18-20 December 1996; pp. 37-42.
34. Larsson, J.; Moffat, A. Off-Line dictionary-based compression. Proc. IEEE 2000, 88, 1722-1732.
35. González, R.; Navarro, G. Compressed Text Indexes with Fast Locate. In Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching (CPM), London, Canada, 9-11 July 2007; pp. 216-227.
36. Mäkinen, V.; Navarro, G. Succinct suffix arrays based on run-length encoding. Nord. J. Comput. 2005, 12, 40-66.
37. Raman, R.; Raman, V.; Rao, S. Succinct Indexable Dictionaries with Applications to Encoding k-Ary Trees and Multisets. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, USA, 6-8 January 2002; pp. 233-242.
38. Okanohara, D.; Sadakane, K. Practical Entropy-Compressed Rank/Select Dictionary. In Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, LA, USA, 6 January 2007.
39. González, R.; Grabowski, S.; Mäkinen, V.; Navarro, G. Practical Implementation of Rank and Select Queries. In Proceedings of the posters 4th Workshop on Experimental Algorithms (WEA), Santorini Island, Greece, 10-13 May 2005; pp. 27-38.
40. Claude, F.; Navarro, G. Practical Rank/Select Queries over Arbitrary Sequences. In Proceedings of the 15th International Symposium on String Processing and Information Retrieval (SPIRE), Melbourne Australia, 10-12 November 2008; pp. 176-187.
41. Puglisi, S.; Turpin, A. Space-Time Tradeoffs for Longest-Common-Prefix Array Computation. In Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC), Gold Coast, Australia, 15-17 December 2008; pp. 124-135.
42. Kärkkäinen, J.; Manzini, G.; Puglisi, S. Permuted Longest-Common-Prefix Array. In Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching (CPM), Lille, France, 22-24 June 2009; pp. 181-192.
43. Brisaboa, N.; Ladra, S.; Navarro, G. Directly Addressable Variable-length Codes. In Proceedings of the 16th International Symposium on String Processing and Information Retrieval (SPIRE), Saariselk, Finland, 25-27 August 2009; pp. 122-130.
44. Pizza & Chili Corpus. Available online: http://pizzachili.dcc.uchile.cl (accessed on 20 May 2013).
45. Geary, R.; Rahman, N.; Raman, R.; Raman, V. A simple optimal representation for balanced parentheses. Theory Comput. Sci. 2006, 368, 231-246.
46. Fischer, J.; Heun, V. Space-Efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput. 2011, 40, 465-492.
47. Konow, R.; Navarro, G. Faster Compact Top-k Document Retrieval. In Proceedings of the 23rd Data Compression Conference (DCC), Snowbird, UT, USA, 20 March 2013; pp. 351-360.
48. Sakamoto, H. A fully linear-time approximation algorithm for grammar-based compression. J. Discret. Algorithms 2005, 3, 416-430.
49. Pizza&Chili Repetitive Corpus. Available online: http://pizzachili.dcc.uchile.cl/repcorpus (accessed on 20 May 2013).
50. Software Page of Gonzalo Navarro. Available online: http://www.dcc.uchile.cl/gnavarro/software (accessed on 20 May 2013).
51. Pizza & Chili Corpus. Available online: http://pizzachili.dcc.uchile.cl/cst (accessed on 20 May 2013).