SURVEY AND SUMMARY: Prospects and limitations of full-text index structures in genome analysis

Nucleic Acids Research

Volumn 40, Issue 15, 2012, Pages 6993-7015

  Vyverman, Michaël ^a   De Baets, Bernard ^a   Fack, Veerle ^a   Dawyndt, Peter ^a  

^a GHENT UNIVERSITY   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

DNA; RNA;

ANALYTICAL PARAMETERS; BIOINFORMATICS; BIOMEDICINE; COMPUTER ANALYSIS; COMPUTER LANGUAGE; COMPUTER MEMORY; COMPUTER NETWORK; COMPUTER PROGRAM; COMPUTER SIMULATION; CONCEPTUAL FRAMEWORK; DNA SEQUENCE; GENE SEQUENCE; GENE STRUCTURE; GENETIC ALGORITHM; GENETIC VARIABILITY; GENOME; INFORMATION PROCESSING; INFORMATION RETRIEVAL; MEDICAL INFORMATION SYSTEM; NOMENCLATURE; PRIORITY JOURNAL; REVIEW; RNA SEQUENCE; RNA STRUCTURE; SEQUENCE ANALYSIS; STRUCTURE ANALYSIS; ALGORITHM; GENOMICS; METHODOLOGY;

ALGORITHMS; GENOMICS; SEQUENCE ANALYSIS;

EID: 84867320545     PISSN: 03051048     EISSN: 13624962     Source Type: Journal    
DOI: 10.1093/nar/gks408     Document Type: Review

References (147)

1. Felsenstein, J. (2004) Inferring Phylogenies. Sinauer Associates, Sunderland, Mass.
2. Ferragina, P. (2010) Data structures: time, I/Os, entropy, joules! In Proceedings of the 18th Annual European Symposium on Algorithms. Liverpool, UK, pp. 1-16.
3. Altschul, S., Gish, W., Miller, W., Myers, E. and Lipman, D. (1990) Basic local alignment search tool. J. Mol. Biol., 215, 403-410.
4. Flicek, P. and Birney, E. (2009) Sense from sequence reads: methods for alignment and assembly. Nat. Meth., 6, S6-S12.
5. Hoffmann, S., Otto, C., Kurtz, S., Sharma, C., Khaitovich, P., Vogel, J., Stadler, P. and Hackermuller, J. (2009) Fast mapping of short sequences with mismatches, insertions and deletions using index structures. PLoS Comput. Biol., 5, e1000502.
6. Lam, T., Li, R., Tam, A., Wong, S., Wu, E. and Yiu, S. (2009) High thoughput short read alignment via bi-directional BWT. 2009 IEEE International Conference on Bioinformatics and Biomedicine. Washington, DC, USA, pp. 31-36.
7. Langmead, B., Trapnell, C., Pop, M. and Salzberg, S. (2009) Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biology, 10, R25.
8. Li, H. and Durbin, R. (2009) Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics, 25, 1754-1760.
9. Li, R., Yu, C., Li, Y., Lam, T., Yiu, S., Kristiansen, K. and Wang, J. (2009) SOAP2: an improved ultrafast tool for short read alignment. Bioinformatics, 25, 1966-1967.
10. Kurtz, S., Phillippy, A., Delcher, A., Smoot, M., Shumway, M., Antonescu, C. and Salzberg, S. (2004) Versatile and open software for comparing large genomes. Genome Biol., 5, R12.
11. Schatz, M., Trapnell, C., Delcher, A. and Varshney, A. (2007) High-throughput sequence alignment using graphics processing units. BMC Bioinformatics, 8, 474.
12. Askitis, N. and Sinha, R. (2010) RepMaestro: scalable repeat detection on disk-based genome sequences. Bioinformatics, 26, 2368-2374.
13. Schröder, J., Schröder, H., Puglisi, S., Sinha, R. and Schmidt, B. (2009) SHREC: a short-read error correction method. Bioinformatics, 25, 2157-2163.
14. Zhao, Z., Yin, J., Zhan, Y., Xiong, W., Li, Y. and Liu, F. (2011) PSAEC: an improved algorithm for short read error correction using partial suffix arrays. In Proceedings of the Joint International Conference Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Jinhua, China, pp. 220-232.
15. Conway, T. and Bromage, A. (2011) Succinct data structures for assembling large genomes. Bioinformatics, 27, 479-486.
16. Hernandez, D., Francois, P., Farinelli, L., Osteras, M. and Schrenzel, J. (2008) De novo bacterial genome sequencing: millions of very short reads assembled on a desktop computer. Genome Res., 18, 802-809.
17. Simpson, J. and Durbin, R. (2010) Efficient construction of an assembly string graph using the FM-index. Bioinformatics, 26, i367-i373.
18. Dean, J. and Ghemawat, S. (2004) MapReduce: simplified data processing on large clusters. In Proceedings of the 6th Symposium on Operating System Design and Implementation. San Francisco, California, USA, pp. 137-150.
19. Abouelhoda, M., Kurtz, S. and Ohlebusch, E. (2004) Replacing suffix trees with enhanced suffix arrays. Discrete Algor., 2, 53-86.
20. Meyer, F., Kurtz, S., Backofen, R., Will, S. and Beckstette, M. (2011) Structator: fast index-based search for RNA sequence-structure patterns. BMC Bioinformatics, 12, 214.
21. Iliopoulos, C., Makris, C., Panagis, Y., Perdikuri, K., Theodoridis, E. and Tsakalidis, A. (2006) The weighted suffix tree: an efficient data structure for handling molecular weighted sequences and its applications. Fund. Infor., 71, 259-277.
22. Shibuya, T. (2010) Geometric suffix tree: Indexing protein 3-D structures. J. ACM, 57, 15.
23. Hon, W., Patil, M., Shah, R. and Thankachan, S. (2011) Compressed property suffix trees. In Proceedings of the 2011 Data Compression Conference. Snowbird, Utah, USA, pp. 123-132.
24. Jacobs, A. (2009) The pathologies of big data. Commun. ACM, 52, 36-44.
25. Vitter, J. (2001) External memory algorithms and data structures: dealing with massive data. ACM Comput. Surv., 33, 209-271.
26. Blumer, A., Blumer, J., Haussler, D., McConnell, R. and Ehrenfeucht, A. (1987) Complete inverted files for efficient text retrieval and analysis. J. ACM, 34, 578-595.
27. Bayer, R. and McCreight, E. (1972) Organization and Maintenance of large ordered indexes. Acta Infor., 1, 173-189.
28. Weiner, P. (1973) Linear pattern matching algorithm. In Proceedings of the 14th IEEE Symposium on Switching and Automata Theory. Iowa City, Iowa, USA, pp. 1-11.
29. Gusfield, D. (1997) Algorithms on Strings, Trees, and Sequences, 11th edn. Cambridge University Press, Cambridge, UK and New York, USA.
30. Morrison, D. (1968) PATRICIA practical algorithm to retrieve information coded in alphanumeric. J. ACM, 15, 514-534.
31. Boyer, R. and Moore, J. (1977) A fast string searching algorithm. Commun. ACM, 20, 762-772.
32. Knuth, D., Morris, J. and Pratt, V. (1977) Fast pattern matching in strings. SIAM J. Comput., 6, 323-350.
33. Giegerich, R., Kurtz, S. and Stoye, J. (2003) Efficient implementation of lazy suffix trees. Softw. Pract. Exp., 33, 1035-1049.
34. McCreight, E. (1976) A space-economical suffix tree construction algorithm. J. ACM, 23, 262-272.
35. Manber, U. and Myers, E. (1993) Suffix arrays: a new method for on-line string searches. SIAM J. Comput., 22, 935-948.
36. Grossi, R. (2011) A quick tour on suffix arrays and compressed suffix arrays. Theor. Comput. Sci., 412, 2964-2973.
37. Ohlebusch, E. and Gog, S. (2010) Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem. Inf. Process. Lett., 110, 123-128.
38. Kasai, T., Lee, G., Arimura, H., Arikawa, S. and Park, K. (2001) Linear-time longest-common-prefix computation in suffix arrays and its applications. In Proceedings of the 12th Symposium on Combinatorial Pattern Matching. Jerusalem, Israel, pp. 181-192.
39. Grimsmo, N. (2007) On performance and cache effects in substring indexes, Report IDI-TR-2007-04, Norwegian University of Science and Technology, Norway.
40. Fischer, J. and Heun, V. (2007) A new succinct representation of RMQ-information and improvements in the enhanced suffix array. In Proceedings of the 1st Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies. Hangzhou, China, pp. 459-470.
41. Kim, D., Kim, M. and Park, H. (2008) Linearized suffix tree: an efficient index data structure with the capabilities of suffix trees and suffix arrays. Algorithmica, 52, 350-377.
42. Navarro, G. and Mäkinen, V. (2007) Compressed full-text indexes. ACM Comput. Surv., 39, 2:1-2:61.
43. Grossi, R. and Vitter, J. (2005) Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM J. Comput., 35, 378-407.
44. Sadakane, K. (2007) Compressed suffix trees with full functionality. Theor. Comput. Syst., 41, 589-607.
45. Ferragina, P. and Manzini, G. (2000) Opportunistic data structures with application. In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science. Redondo Beach, California, USA, pp. 390-398.
46. Burrows, M. and Wheeler, D. (1994) A block-sorting lossless data compression algorithm. Technical Report 124. DEC SRC.
47. Mäkinen, V. and Navarro, G. (2005) Succinct suffix arrays based on run-length encoding. Nordic J. Comput., 12, 40-66.
48. Ferragina, P., Manzini, G., Makinen, V. and Navarro, G. (2007) Compressed representations of sequences and full-text indexes. ACM Trans. Algor., 3, 20.
49. Ferragina, P. and Manzini, G. (2000) An experimental study of an opportunistic index. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms. Washington, DC, USA, pp. 269-278.
50. Grabowski, S., Navarro, G., Przywarski, R., Salinger, A. and Mäkinen, V. (2006) A simple alphabet-independent FM-index. Int. J. Founda. of Comput. Sci., 17, 1365-1384.
51. Adjeroh, D., Bell, T. and Mukherjee, A. (2008) The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching. Springer, New York.
52. Hon, W., Sadakane, K. and Sung, W. (2009) Breaking a timeand-space barrier in constructing full-text indices. SIAM J. Comput., 38, 2162-2178.
53. Arlazarov, V., Dinic, E., Kronrod, M. and Faradzev, I. (1970) On economic construction of the transitive closure of a directed graph. Dokl. Akad. Nauk SSSR, 194, 487-488.
54. Ferragina, P., González, R., Navarro, G. and Venturini, R. (2009) Compressed text indexes: From theory to practice. ACM J. Exp. Algor., 13, 1.12-1.31.
55. Ferragina, P. and Manzini, G. (2005) Indexing compressed text. J. ACM, 52, 552-581.
56. Russo, L., Navarro, G., Oliveira, A. and Morales, P. (2009) Approximate string matching with compressed indexes. Algorithms, 2, 1105-1136.
57. Arroyuelo, D. and Navarro, G. (2010) Practical approaches to reduce the space requirement of Lempel-Ziv based compressed text indices. ACM J. Exp. Algor., 15, 1.5:1.1-1.5:1.54.
58. Välimäki, N., Mäkinen, V., Gerlach, W. and Dixit, K. (2009) Engineering a compressed suffix tree implementation. ACM J. Exp. Algor., 14, 4.2-4.23.
59. Grossi, R., Gupta, A. and Vitter, J. (2003) High-order entropy-compressed text indexes. In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms. Baltimore, Maryland, USA, pp. 841-850.
60. Foschini, L., Grossi, R., Gupta, A. and Vitter, J. (2006) When indexing equals compression: experiments with compressing suffix arrays and applications. ACM Trans. Algor., 2, 611-639.
61. Russo, L., Navarro, G. and Oliveira, A. (2011) Fully-compressed suffix trees. ACM Trans. Algor., 7, 53.
62. Cánovas, R. and Navarro, G. (2010) Practical compressed suffix trees. In Proceedings of the 9th Symposium on Experimental Algorithms. Ischia Island, Naples, Italy, pp. 94-105.
63. Sadakane, K. (2003) New text indexing functionalities of the compressed suffix arrays. J. Algor., 48, 294-313.
64. Sadakane, K. and Shibuya, T. (2001) Indexing huge genome sequences for solving various problems. Genome Inform., 12, 175-183.
65. Navarro, G. (2004) Indexing text using the Ziv-Lempel trie. J. Discrete Algor., 2, 87-114.
66. Kurtz, S. (1999) Reducing the space requirement of suffix trees. Softw. Pract. Exp., 29, 1149-1171.
67. Kärkkäinen, J. and Ukkonen, E. (1996) Sparse suffix trees. In Proceedings of the 2nd Conference on Computing and Combinatorics. Hong Kong, China, pp. 219-230.
68. Ferragina, P. and Fischer, J. (2007) Suffix arrays on words. In Proceedings of the 18th conference on Combinatorial Pattern Matching. London, Ontario, Canada, pp. 328-339.
69. Khan, Z., Bloom, J., Kruglyak, L. and Singh, M. (2009) A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays. Bioinformatics, 25, 1609-1616.
70. Kulekci, M., Hon, W., Shah, R., Vitter, J. and Xu, B. (2010) PSI-RA: a parallel sparse index for read alignment on genomes. In Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine. Hong Kong, China, pp. 663-668.
71. Barsky, M., Stege, U. and Thomo, A. (2010) A survey of practical algorithms for suffix tree construction in external memory. Softw. Pract. Exp., 40, 965-988.
72. Marín, M. and Navarro, G. (2003) Distributed query processing using suffix arrays. In Proceedings of the 10th conference on String Processing and Information Retrieval. Manaus, Brazil, pp. 311-325.
73. Andersson, A., Larsson, N. and Swanson, K. (1999) Suffix trees on words. Algorithmica, 23, 246-260.
74. Inenaga, S. and Takeda, M. (2006) On-line linear-time construction of word suffix trees. In Proceedings of the 17th conference on Combinatorial Pattern Matching. Barcelona, Spain, pp. 60-71.
75. Transier, F. and Sanders, P. (2008) Compressed inverted indexes for in-memory search engines. In Proceedings of the 10th Workshop on Algorithm Engineering and Experimentation. San Francisco, California, USA, pp. 3-12.
76. Puglisi, S., Smyth, W. and Turpin, A. (2006) Inverted files versus suffix arrays for locating patterns in primary memory. In Proceedings of the 13th conference on String Processing and Information Retrieval. Glasgow, UK, pp. 122-133.
77. Manzini, M. (2001) An analysis of the Burrows-Wheeler transform. J. ACM, 48, 407-430.
78. Raman, R., Raman, V. and Rao, S. (2002) Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms. San Francisco, California, USA, pp. 233-242.
79. Claude, F. and Navarro, G. (2008) Practical Rank/Select queries over arbitrary sequences. In Proceedings of the 15th annual Symposium on String Processing and Information Retrieval. Melbourne, Australia, pp. 176-187.
80. Okanohara, D. and Sadakane, K. (2007) Practical entropycompressed rank/select dictionary. In Proceedings of the 9th Workshop on Algorithm Engineering and Experiments. New Orleans, Louisiana, USA, pp. 60-70.
81. Külekci, M., Vitter, J. and Xir, B. (2010) Time-and space-efficient maximal repeat finding using the Burrows-Wheeler transform and wavelet trees. In Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine. Hong Kong, China, pp. 622-625.
82. Jacobson, G. (1989) Space-efficient static trees and graphs. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science. Research Triangle Park, North Carolina, USA, pp. 549-554.
83. Arroyuelo, D., Cánovas, R., Navarro, G. and Sadakane, K. (2010) Succient trees in practice. In Proceedings of the 11th Workshop on Algorithm Engineering and Experiments. Austin, Texas, USA, pp. 84-97.
84. Archie, J., Day, W., Felsenstein, J., Maddison, W., Meacham, C., Rohlf, F. and Swofford, D. (1986) The Newick Tree Format, http://evolution. genetics.washington. edu/phylip/newicktree.html (May 2012, date last accessed).
85. Gog, S. and Fischer, J. (2010) Advantages of shared data structures for sequences of balanced parentheses. In Proceedings of the 2010 Data Compression Conference. Snowbird, Utah, USA, pp. 406-415.
86. Berkman, O. and Vishkin, U. (1993) Recursive star-tree parallel data structure. SIAM J. Comput., 22, 221-242.
87. Grossi, R. and Vitter, J. (2000) Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 32. Portland, Oregon, USA, pp. 397-406.
88. Sadakane, K. (2000) Compressed text databases with efficient query algorithms based on the compressed suffix array. In Proceedings of the 11th International Symposium on Algorithms and Computation. Taipei, Taiwan, pp. 410-421.
89. Sadakane, K. (2002) Succinct representations of LCP information and improvements in the compressed suffix array. In Proceedings of the 13th ACM-SIAM symposium on Discrete algorithms. San Francisco, California, USA, pp. 225-232.
90. Mäkinen, V. (2003) Compact suffix array - a space-efficient fulltext index. Fund. Inform., 56, 191-210.
91. Mäkinen, V. and Navarro, G. (2004) Compressed compact suffix arrays. In Proceedings of the 15th Symposium on Combinatorial Pattern Matching. Istanbul, Turkey, pp. 420-433.
92. González, R. and Navarro, G. (2007) Compressed text indexes with fast locate. In Proceedings of the 18th Symposium on Combinatorial Pattern Matching. London, Ontario, Canada, pp. 216-227.
93. Elias, P. (1975) Universal codeword sets and representations of integers. IEEE Trans. Inf. Theory, 21, 194-203.
94. Kärkkäinen, J. and Ukkonen, E. (1996) Lempel-Ziv parsing and sublinear-size index structures for string matching. In Proceedings of the 3rd South American Workshop on String Processing. Recife, Brazil, pp. 141-155.
95. Lempel, A. and Ziv, J. (1976) On the complexity of finite sequences. IEEE Trans. Inf. Theory, 22, 75-81.
96. Ziv, J. and Lempel, A. (1978) Compression of individual sequences via variable length coding. IEEE Trans. Inf. Theory, 24, 530-536.
97. Navarro, G. (2009) Implementing the LZ-index: theory versus practice. ACM J. Exp. Algor., 13, 1.2.
98. Arroyuelo, D., Navarro, G. and Sadakane, K. (2012) Stronger Lempel-Ziv Based compressed text indexing. Algorithmica, 62, 54-101.
99. Russo, L. and Oliveira, A. (2008) A compressed self-index using a Ziv-Lempel dictionnary. Inform. Retrieval, 11, 359-388.
100. Ohlebusch, E., Gog, S. and Kügel, A. (2010) Computing matching statistics and maximal exact matches on compressed full-text indexes. In Proceedings of the 17th Annual Symposium on String Processing and Information Retrieval. Los Cabos, Mexico, pp. 347-358.
101. Ohlebusch, E. and Gog, S. (2009) A compressed enhanced suffix array supporting fast string matching. In Proceedings of the 16th Symposium on String Processing and Information Retrieval. Saariselkä, Finland, pp. 51-62.
102. Ohlebusch, E., Fischer, J. and Gog, S. (2010) CST++. In Proceedings of the 17th Symposium on String Processing and Information Retrieval. Los Cabos, Mexico, pp. 322-333.
103. Fischer, J., Mäkinen, V. and Navarro, G. (2009) Faster entropy-bounded compressed suffix trees. Theor. Comput. Sci., 410, 5354-5364.
104. Hon, W., Shah, R. and Vitter, J. (2010) Compression, indexing, and retrieval for massive string data. In Proceedings of the 21st Symposium on Combinatorial Pattern Matching. New York, USA, pp. 260-274.
105. Baeza-Yates, R., Barbosa, E. and Ziviani, N. (1996) Hierarchies of indices for text retrieval. J. Inf. Syst., 21, 497-514.
106. Sinha, R., Puglisi, S., Moffat, A. and Turpin, A. (2008) Improving suffix array locality for fast pattern matching on disk. In Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data. Vancouver, British Columbia, Canada, pp. 661-672.
107. Ferragina, P. and Grossi, R. (1999) The string B-tree: a new data structure for string search in external memory and its applications. J. ACM, 46, 236-280.
108. Ferragina, P., Grossi, R., Gupta, A., Shah, R. and Vitter, J. S. (2008) On searching compressed string collections cache-obliviously. In Proceedings of the 27th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. Vancouver, British Columbia, Canada, pp. 181-190.
109. Hunt, E., Atkinson, M. and Irving, R. (2002) Database indexing for large DNA and protein sequence collections. The VLDB J., 11, 256-271.
110. Bedathur, S. and Haritsa, J. (2004) Engineering a fast online persistent suffix tree construction. In Proceedings of the 20th International Conference on Data Engineering. Boston, Massachusetts, USA, pp. 720-731.
111. Clark, D. and Munro, J. (1996) Efficient suffix trees on secondary storage (extended Abstract). In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Atlanta, Georgia, USA, pp. 383-391.
112. Tian, Y., Tata, S., Hankins, R. and Patel, J. (2005) Practical methods for constructing suffix trees. VLDB J., 14, 281-299.
113. Phoophakdee, B. and Zaki, M. (2007) Genome-scale disk-based suffix tree indexing. In Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data. Beijing, China, pp. 833-844.
114. Ghoting, A. and Makarychev, K. (2010) I/O efficient algorithms for serial and parallel suffix tree construction. ACM Trans. Database Sys., 35, 25.
115. Clifford, R. (2005) Distributed suffix trees. J. Discrete Algor., 3, 176-197.
116. Bedathur, S. and Haritsa, J. (2005) Search-Optimized suffix-tree storage for biological applications. In Proceedings of the 12th International Conference on High Performance Computing. Goa, India, pp. 29-39.
117. Brodal, G. and Fagerberg, R. (2006) Cache-oblivious string dictionaries. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms. Miami, Florida, USA, pp. 581-590.
118. Barsky, M., Stege, U., Thomo, A. and Upton, C. (2008) A new method for indexing genomes using on-disk suffix trees. Proceeding of the 17th ACM Conference on Information and Knowledge Management. Napa Valley, California, USA, pp. 649-658.
119. Barsky, M., Stege, U., Thomo, A. and Upton, C. (2011) Suffix trees for inputs larger than main memory. Inf. Syst., 36, 644-654.
120. Halachev, M., Shiri, N. and Thamildurai, A. (2007) Efficient and scalable indexing techniques for biological sequence data. In Proceedings of the 1st International Conference on Bioinformatics Research and Development. Berlin, Germany, pp. 464-479.
121. Mäkinen, V., Navarro, G. and Sadakane, K. (2004) Advantages of backward searching - efficient secondary memory and distributed implementation of compressed suffix arrays. In Proceedings of the 15th International Symposium on Algorithms and Computation. Hong Kong, China, pp. 681-692.
122. González, R. and Navarro, G. (2009) A compressed text index on secondary memory. J. Comb. Math. Comb. Comput., 71, 127-154.
123. Arroyuelo, D. and Navarro, G. (2007) A Lempel-Ziv text index on secondary storage. In Proceedings of the 18th Symposium on Combinatorial Pattern Matching. London, Ontario, Canada, pp. 83-94.
124. Russo, L., Navarro, G. and Oliveira, A. (2010) Parallel and distributed compressed indexes. In Proceedings of the 21st Conference on Combinatorial Pattern Matching. New York, USA, pp. 348-360.
125. Chien, Y., Hon, W., Shah, R. and Vitter, J. (2008) Geometric Burrows-Wheeler transform: linking range searching and text indexing. In Proceedings of the 2008 Data Compression Conference. Snowbird, Utah, USA, pp. 252-261.
126. Ukkonen, E. (1995) On-line construction of suffix trees. Algorithmica, 14, 249-260.
127. Maaß, M. (2007) Computing suffix links for suffix trees and arrays. Inf. Proces. Lett., 101, 250-254.
128. Puglisi, S., Smyth, W. and Turpin, A. (2007) A taxonomy of suffix array construction algorithms. ACM Comput. Surv., 39, 1-31.
129. Kärkkäinen, J. and Sanders, P. (2003) Simple linear work suffix array construction. In Proceedings of the 30th International Conference on Automata Languages and Programming. Eindhoven, The Netherlands, pp. 943-955.
130. Kärkkäinen, J., Sanders, P. and Burkhardt, S. (2006) Linear work suffix array construction. J. ACM, 53, 918-936.
131. Kulla, F. and Sanders, P. (2007) Scalable parallel suffix array construction. Parallel Comput., 33, 605-612.
132. Ferragina, P., Gagie, T. and Manzini, G. (2010) Lightweight data indexing and compression in external memory. In Proceedings of the 9th Latin American Symposium on Theoretical Informatics. Oaxaca, Mexico, pp. 697-710.
133. Manzini, G. and Ferragina, P. (2004) Engineering a lightweight suffix array construction algorithm. Algorithmica, 40, 33-50.
134. Nong, G., Zhang, S. and Chan, W. (2011) Two efficient algorithms for linear time suffix array construction. IEEE Trans. Comput., 60, 1471-1484.
135. Kärkkäinen, J. (2007) Fast BWT in small space by blockwise suffix sorting. Theor. Comput. Sci., 387, 249-257.
136. Siren, J. (2009) Compressed suffix arrays for massive data. In Proceedings of the 16th International Symposium on String Processing and Information Retrieval. Saariselka, Finland, pp. 63-74.
137. Menon, R., Bhat, G. and Schatz, M. (2011) Rapid parallel genome indexing with MapReduce. In Proceedings of the Second International Workshop on MapReduce and its Applications. San Jose, California, USA, pp. 51-58.
138. Arroyuelo, D. and Navarro, G. (2011) Space-Efficient Construction of Lempel-Ziv compressed text indexes. Inf. Comput., 209, 1070-1102.
139. Döring, A., Weese, D., Rausch, T. and Reinert, K. (2008) SeqAn an efficient, generic C++ library for sequence analysis. BMC Bioinformatics, 9, 11.
140. Loh, W., Moon, Y. and Lee, W. (2011) A fast divide-and-conquer algorithm for indexing human genome sequences. IEICE Trans. Inf. Systems, 94, 1369-1377.
141. Tsirogiannis, D. and Koudas, N. (2010) Suffix tree construction algorithms on modern hardware. In Proceedings of the 13th International Conference on Extending Database Technology. Lausanne, Switzerland, pp. 263-274.
142. Fernandez, E., Najjar, W. and Lonardi, S. (2011) String matching in hardware using the FM-Index. In Proceedings of the 19th Annual IEEE International Symposium on Field-Programmable Custom Computing Machines. Salt Lake City, Utah, USA, pp. 218-225.
143. Langmead, B., Schatz, M., Lin, J., Pop, M. and Salzberg, S. (2009) Searching for SNPs with cloud computing. Genome Biol., 10, R134.
144. Salson, M., Lecroq, T., Léonard, M. and Mouchard, L. (2009) A four-stage algorithm for updating a Burrows-Wheeler transform. Theor. Comput. Sci., 410, 4350-4359.
145. Salson, M., Lecroq, T., Léonard, M. and Mouchard, L. (2010) Dynamic extended suffix arrays. J. Discrete Algor., 8, 241-257.
146. Mäkinen, V., Navarro, G., Sirén, J. and Välimäki, N. (2010) Storage and retrieval of highly repetitive sequence collections. J. Comput. Biol., 17, 281-308.
147. Kuruppu, S., Puglisi, S. and Zobel, J. (2011) Optimized relative Lempel-Ziv compression of genomes. In Proceedings of Australasian Computer Science Conference. Perth, Australia, pp. 91-98.