PSI-RA: A parallel sparse index for read alignment on genomes

Proceedings - 2010 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2010

Volumn , Issue , 2010, Pages 663-668

  Külekci, M Oǧuzhan ^a   Hon, Wing Kai ^b   Shah, Rahul ^c   Vitter, Jeffrey Scott ^d   Xu, Bojian ^d  

^a National Research Institute of Electronics and Cryptology   (Turkey)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^c Louisiana State University   (United States)

^d UNIVERSITY OF KANSAS   (United States)

Author keywords

Genome indexing; Short read alignment; Sparse suffix array

Indexed keywords

ALIGNERS; APPROXIMATE MATCHING; BURROWS WHEELER TRANSFORM; EXACT MATCHING; GENOME INDEXING; PATTERN QUERY; SHORT READ ALIGNMENT; SPACE CONSUMPTION; SPARSE SUFFIX ARRAY; SUFFIX ARRAYS;

ALIGNMENT; BIOINFORMATICS; DNA SEQUENCES; ERRORS; GENES;

INDEXING (OF INFORMATION);

EID: 79952397775     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BIBM.2010.5706648     Document Type: Conference Paper

References (20)

1. J. Shendure and H. Ji, "Next-generation dna sequencing," Nature Biotechnology, vol. 26, no. 10, pp. 1135-1145, 2008.
2. M. Metzker, "Sequencing technologies - the next generation," Nature Reviews Genetics, vol. 11, pp. 31-46, 2010.
3. P. Flicek and E. Birney, "Sense from sequence reads: methods for alignment and assembly," Nature Methods, vol. 6, no. 11, pp. S6-S12, October 2009.
4. J. R. Miller, S. Koren, and G. Sutton, "Assembly algorithms for next-generation sequencing data," Genomics, vol. 95, pp. 315-327, 2010.
5. B. Langmead, C. Trapnell, M. Pop, and S. Salzberg, "Ultrafast and memory-efficient alignment of short dna sequences to the human genome," Genome Biology, vol. 10, no. 3, 2009.
6. Y. Chen, T. Souaiaia, and T. Chen, "Perm: efficient mapping of short sequencing reads with periodic full sensitive spaced seeds," Bioinformatics, vol. 25, no. 19, pp. 2514-2521, 2009.
7. R. Li, Y. Li, K. Kristiansen, and J. Wang, "Soap: short oligonucleotide alignment program," Bioinformatics, vol. 24, no. 5, pp. 713-714, 2008.
8. C. Alkan, J. M. Kidd, T. Marques-Bonet, G. Aksay, F. Antonacci, F. Hormozdiari, J. O. Kitzman, C. Baker, M. Malig, O. Mutlu, S. C. Sahinalp, R. A. Gibbs, and E. E. Eichler, "Personalized copy number and segmental duplication maps using next-generation sequencing." Nature Genetics, vol. 41, no. 10, pp. 1061-1067, October 2009.
9. H. Li and N. Homer, "A survey of sequence alignment algorithms for next-generation sequencing," Briefings in Bioinformatics, 2010.
10. M. Burrows and D. Wheeler, "A block sorting lossless data compression algorithm," Digital Equipment Corporation, Tech. Rep. 124, 1994.
11. H. Li and R. Durbin, "Fast and accurate short read alignment with burrows-wheeler transform." Bioinformatics, vol. 25, no. 14, pp. 1754-1760, July 2009.
12. P. Ferragina and G. Manzini, "Opportunistic data structures with applications," in Proceedings of 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2000, pp. 390-398.
13. U. Manber and G. Myers, "Suffix arrays: A new method for on-line string searches," in Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1990, pp. 319-327.
14. R. Grossi and J. S. Vitter, "Compressed suffix arrays and suffix trees with applications to text indexing and string matching," SIAM Journal on Computing, vol. 35, pp. 378-407, 2005.
15. W.-K. Hon, R. Shah, and J. S. Vitter, "Compression, indexing, and retrieval for massive string data," in Proceedings of the 21stAnnual Symposium on Combinatorial Pattern Matching (CPM), 2010, pp. 260-274.
16. G. Navarro and V. Mäkinen, "Compressed full-text indexes," ACM Computing Surveys, vol. 39, no. 1, 2007.
17. Y.-F. Chien, W.-K. Hon, R. Shah, and J. S. Vitter, "Geometric burrows-wheeler transform: Linking range searching and text indexing," in Proceedings of the Data Compression Conference (DCC), 2008, pp. 252-261.
18. Z. Khan, J. Bloom, L. Kruglyak, and M. Singh, "A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays," Bioinformatics, vol. 25, no. 13, July 2009.
19. E. Rivals, L. Salmela, P. Kiiskinen, P. Kalsi, and J. Tarhio, "Mpscan: Fast localisation of multiple reads in genomes," in Proceedings of the 9th Workshop on Algorithms in Bioinformatics (WABI), 2009, pp. 246-260.
20. G. Nong, S. Zhang, and W. H. Chan, "Linear suffix array construction by almost pure induced-sorting," in Proceedings of Data Compression Conference (DCC), 2009, pp. 193-202.