Indexes of large genome collections on a PC

PLoS ONE

Volumn 9, Issue 10, 2014, Pages

  Danek, Agnieszka ^a   Deorowicz, Sebastian ^a   Grabowski, Szymon ^b  

^a SILESIAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b LODZ UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; DNA SEQUENCE; GENE DELETION; GENE INSERTION; GENETIC ALGORITHM; GENETIC DATABASE; GENETIC VARIABILITY; GENOTYPE; MICROCOMPUTER; MULTIPLE GENOME INDEX; PHENOTYPE; SINGLE NUCLEOTIDE POLYMORPHISM; ALGORITHM; BIOLOGY; COMPUTER; DOCUMENTATION; GENOME; GENOMICS; INFORMATION PROCESSING; PROCEDURES;

ABSTRACTING AND INDEXING AS TOPIC; ALGORITHMS; COMPUTATIONAL BIOLOGY; COMPUTERS; DATASETS AS TOPIC; GENOME; GENOMICS;

EID: 84907855606     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0109384     Document Type: Article

References (38)

1. Sadakane K, Shibuya T (2001) Indexing huge genome sequences for solving various problems. Genome Informatics Series 12: 175-183.
2. Hon WK, Sadakane K, Sung WK (2009) Breaking a time-and-space barrier in constructing full-text indices. SIAM Journal of Computing 38: 2162-2178.
3. Schneeberger K, Hagmann J, Ossowski S, Warthmann N, Gesing S, et al. (2009) Simultaneous alignment of short reads against multiple genomes. Genome Biology 10: Article no.R98.
4. Navarro G, Mäkinen V (2007) Compressed full-text indexes. ACM Computing Surveys 39: Article no.2.
5. Christley S, Lu Y, Li C, Xie X (2009) Human genomes as email attachments. Bin formatics 25: 274-275.
6. Brandon M, Wallace D, Baldi P (2009) Data structures and compression algorithms for genomic sequence data. Bioinformatics 25: 1731-1738.
7. Claude F, Fariña A, Martínez-Pietro M, Navarro G (2010) Compressed q-gram indexing for highly repetitive biological sequences. In: Proceedings of the 10th IEEE Conference on Bioinformatics and Bioengineering. pp. 86-91.
8. Kuruppu S, Puglisi S, Zobel J (2010) Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval. LNCS 6393: 201-206.
9. Kuruppu S, Puglisi S, Zobel J (2011) Optimized relative Lempel-Ziv compression of genomes. In: Proceedings of the ACSC Australasian Computer Science Conference. pp. 91-98.
10. Deorowicz S, Grabowski S (2011) Robust relative compression of genomes with random access. Bio informatics 27: 2979-2986.
11. Kreft S, Navarro G (2013) On compressing and indexing repetitive sequences. Theoretical Computer Science 483: 115-133.
12. Yang X, Wang B, Li C, Wang J, Xie X (2013) Efficient direct search on compressed genomic data. In: Proceedings of the IEEE 29th International Conference on Data Engineering. pp. 961-972.
13. Pavlichin D, Weissman T, Yona G (2013) The human genome contracts again. Bioinformatics 29: 2199-2202.
14. Deorowicz S, Danek A, Grabowski S (2013) Genome compression: A novel approach for large collections. Bioinformatics 29: 2572-2578.
15. Wandelt S, Leser U (2014) FRESCO: Referential compression of highly-similar sequences. IEEE/ACM Transactions on Computational Biology and Bioinformatics 10: 1275-1288.
16. Vyverman M, De Baets B, Fack V, Dawyndt P (2012) Prospects and limitations of full-text index structures in genome analysis. Nucleic Acids Research 40: 6993-7015.
17. Deorowicz S, Grabowski S (2013) Data compression for sequencing data. Algorithms for Molecular Biology 8: Article no.25.
18. Giancarlo R, Rombo S, Utro F (2014) Compressive biological sequence analysis and archival in the era of high-throughput sequencing technologies. Briefings in Bioinformatics 15: 390-406.
19. Mäkinen V, Navarro G, Sirén J, Välimäki N (2010) Storage and retrieval of highly repetitive sequence collections. Journal of Computational Biology 17: 281-308.
20. Huang S, Lam T, Sung W, Tam S, Yiu S (2010) Indexing similar DNA sequences. LNCS 6124: 180-190.
21. Gagie T, Gawrychowski P, Puglisi S (2011) Faster approximate pattern matching in compressed repetitive texts. LNCS 7074: 653-662.
22. Do H, Jansson J, Sadakane K, Sung WK (2014) Fast relative Lempel-Ziv selfindex for similar sequences. Theoretical Computer Science 532: 14-30.
23. Ferrada H, Gagie T, Hirvola T, Puglisi S (2014) Hybrid indexes for repetitive datasets. Philosophical Transactions of The Royal Society A 372: Article no.2016.
24. Wandelt S, Starlinger J, Bux M, Leser U (2013) RCSI: Scalable similarity search in thousand(s) of genomes. Proceedings of the VLDB Endowment 6: 1534-1545.
25. Sirén J, Välimäki N, Mäkinen V (2014) Indexing graphs for path queries with applications in genome research. IEEE/ACM Transactions on Computational Biology and Bioinformatics 11: 375-388.
26. Huang L, Popic V, Batzoglou S (2013) Short read alignment with populations of genomes. Bioinformatics 29: i361-i370.
27. Rahn R, Weese D, Reinert K (2014) Journaled string tree-a scalable data structure for analyzing thousands of similar genomes on your laptop. Bio informatics : doi: 10.1093/bioinformatics/btu438.
28. Durbin R (2014) Efficient haplotype matching and storage using the Positional Burrows-Wheeler transform (PBWT). Bio informatics 30: 1266-1272.
29. Thachuk C (2013) Compressed indexes for text with wildcards. Theoretical Computer Science 483: 22-35.
30. Hon WK, Ku TH, Shah R, Thankachan S, Vitter J (2013) Compressed text indexing with wildcards. Journal of Discrete Algorithms 19: 23-29.
31. Danecek P, Auton A, Abecasis G, Albers C, Banks E, et al. (2011) The variant call format and VCF tools. Bio informatics 27: 2156-2158.
32. Consortium TGP (2012) An integrated map of genetic variation from 1, 092 human genomes. Nature 491: 56-65.
33. Kärkkä inen J, Ukkonen E (1996) Sparse suffix trees. LNCS 1090: 219-230.
34. Marco-Sola S, Sammeth M, Guigó R, Ribeca P (2012) The GEM mapper: fast, accurate and versatile alignment by filtration. Nature Methods 9: 1185-1188.
35. Hampikian G, Andersen T (2007) Absent sequences: nullomers and primes. In: Pacific Symposium on Biocomputing. volume 12, pp. 355-366.
36. Garcia S, Pinho A, Rodrigues J, Bastos C, Ferreira P (2011) Minimal absent words in prokaryotic and eukaryotic genomes. PloS ONE 6: e16065.
37. Kärkkä inen J (2007) Fast BWT in small space by block wise suffix sorting. Theoretical Computer Science 387: 249-257.
38. Grabowski S, Raniszewski M (2014) Sampling the suffix array with minimizers. arXiv preprint http://arxivorg/abs/14062348.