Hybrid indexes for repetitive datasets

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences

Volumn 372, Issue 2016, 2014, Pages

  Ferrada, H ^a   Gagie, T ^b   Hirvola, T ^c   Puglisi, S J ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSITY OF HELSINKI   (Finland)

^c AALTO UNIVERSITY   (Finland)

Author keywords

Approximate pattern matching; Indexing; LZ77

Indexed keywords

DNA SEQUENCES; INDEXING (OF INFORMATION); PATTERN MATCHING;

APPROXIMATE PATTERN MATCHING; DNA SEQUENCING; EDIT DISTANCE; HUMAN GENOMES; LOSSLESS DATA COMPRESSION ALGORITHM; LZ77; PATTERN LENGTH; UPPER BOUND;

DATA COMPRESSION;

APPROXIMATE PATTERN MATCHING; ARTICLE; DATA MINING; GENETIC DATABASE; GENETICS; GENOMICS; INDEXING; LZ77; METHODOLOGY; SACCHAROMYCES CEREVISIAE;

APPROXIMATE PATTERN MATCHING; INDEXING; LZ77;

DATA MINING; DATABASES, GENETIC; GENOMICS; SACCHAROMYCES CEREVISIAE;

EID: 84899088435     PISSN: 1364503X     EISSN: None     Source Type: Journal    
DOI: 10.1098/rsta.2013.0137     Document Type: Article

References (18)

1. HM Government. 2012 Strategy for UK life sciences: one year on. See http://www.bis.gov.uk/ assets/biscore/innovation/docs/s/12-1346-strategy-for-uk- life-sciences-one-year-on.
2. Ziv J, Lempel A. 1977 A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23, 337-343. (doi:10.1109/TIT.1977.1055714
3. Langmead B, Trapnell C, Pop M, Salzberg SL. 2009 Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol. 10, R25. (doi:10.1186/gb-2009-10-3-r25
4. Li H, Durbin R. 2009 Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics 25, 1754-1760. (doi:10.1093/ bioinformatics/btp324
5. Liu C-M et al. 2012 SOAP3: ultra-fast GPU-based parallel alignment tool for short reads. Bioinformatics 28, 878-879. (doi:10.1093/bioinformatics/bts061
6. Ferragina P, Manzini G. 2005 Indexing compressed text. J. ACM 52, 552-581. (doi:10.1145/ 1082036.1082039
7. Arroyuelo D, Navarro G, Sadakane K. 2012 Stronger Lempel-Ziv based compressed text indexing. Algorithmica 62, 54-101. (doi:10.1007/s00453-010-9443- 8
8. Claude F, Navarro G. 2012 Improved grammar-based compressed indexes. In String Processing and Information Retrieval, Proc. 19th Int. Symp., SPIRE 2012, Cartagena de Indias, Colombia, 21-25 October (eds L Calderón-Benavides, C González-Caro, E Chávez, N Ziviani). Lecture Notes in Computer Science, vol. 7608, pp. 180-192. Berlin, Germany: Springer.
9. Do HH, Jansson J, Sadakane K, SungW-K. 2012 Fast relative Lempel-Ziv self-index for similar sequences. In Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, Proc. 2nd Joint Int. Conf., FAW-AAIM 2012, Beijing, China, 14-16 May (eds J Snoeyink, P Lu, K Su, L Wang). Lecture Notes in Computer Science, vol. 7285, pp. 291-302. Berlin, Germany: Springer.
10. Gagie T, Gawrychowski P, Kärkkäinen J, Nekrich Y, Puglisi SJ. 2012 A faster grammar-based self-index. In Language and Automata Theory and Applications, Proc. 6th Int. Conf., LATA 2012, A Coruña, Spain, 5-9 March (eds A-H Dediu, C Martín-Vide). Lecture Notes in Computer Science, vol. 7183, pp. 240-251. Berlin, Germany: Springer.
11. Kreft S, Navarro G. 2013 On compressing and indexing repetitive sequences. Theor. Comput. Sci. 483, 115-133. (doi:10.1016/j.tcs.2012.02.006
12. Mäkinen V, Navarro G, Sirén J, Välimäki N. 2010 Storage and retrieval of highly repetitive sequence collections. J. Comput. Biol. 17, 281-308. (doi:10.1089/cmb.2009.0169
13. Maruyama S, Nakahara M, Kishiue N, Sakamoto H. 2013 ESP-index: a compressed index based on edit-sensitive parsing. J. Discr. Algorithms 18, 100-112. (doi:10.1016/j.jda.2012.07.009
14. Russo LMS, Navarro G, Oliveira AL, Morales P. 2009 Approximate string matching with compressed indexes. Algorithms 2, 1105-1136. (doi:10.3390/a2031105
15. Kärkkäinen J, Ukkonen E. 1996 Lempel-Ziv parsing and sublinear-size index structures for string matching. In Proc. 3rd South American Workshop on String Processing, Recife, Brazil, 8-9 August (eds N Ziviani, R Baeza-Yates, K Guimarães). International Informatics Series, vol. 4, pp. 141-155. Ottawa, Canada: Carleton University Press.
16. Fischer J, Heun V. 2011 Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput. 40, 465-492. (doi:10.1137/090779759
17. Gagie T, Gawrychowski P, Puglisi SJ. 2012 Faster approximate pattern matching in compressed repetitive texts. (http://arxiv.org/abs/1109.2930
18. Wandelt S, Starlinger J, Bux M, Leser U. 2013 RCSI: scalable similarity search in thousand(s) of genomes. Proc. VLDB Endowment 6, 1534-1545.