Indel-tolerant read mapping with trinucleotide frequencies using cache-oblivious kd-trees

Bioinformatics

Volumn 28, Issue 18, 2012, Pages

  Mahmud, Md Pavel ^a   Wiedenhoeft, John ^a   Schliep, Alexander ^a,b  

^a RUTGERS UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NUCLEOTIDE;

ARTICLE; CHEMISTRY; CHROMOSOME MAP; DNA SEQUENCE; GENETIC VARIABILITY; GENOMICS; HIGH THROUGHPUT SEQUENCING; HUMAN; HUMAN GENOME; INDEL MUTATION; METHODOLOGY;

CHROMOSOME MAPPING; GENETIC VARIATION; GENOME, HUMAN; GENOMICS; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; HUMANS; INDEL MUTATION; NUCLEOTIDES; SEQUENCE ANALYSIS, DNA;

EID: 84866463002     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/bts380     Document Type: Article

References (57)

1. Agarwal,P.K. et al. (2003) Cache-oblivious data structures for orthogonal range searching. In: Proceedings of the nineteenth annual symposium on Computational geometry, SCG '03. ACM, New York, pp. 237-245.
2. Alkan,C. et al. (2009) Personalized copy number and segmental duplication maps using next-generation sequencing. Nat. Genet., 41, 1061-1067.
3. Alkan,C. et al. (2011) Genome structural variation discovery and genotyping. Nat. Rev. Genet., 12, 363-376.
4. Arge,L. et al. (2005) Cache-oblivious data structures. In Mehta,D. et al. (eds.) Handbook of Data Structures and Applications, CRC Press, Boca Raton, chapter 34.
5. Berchtold,S. et al. (1996) The x-tree: An index structure for high-dimensional data. In Vijayaraman,T.M. et al. (eds). VLDB'96, Proceedings of 22th International Conference on Very Large Data Bases, September 3-6, 1996, Mumbai, India. Morgan Kaufmann, San Francisco, pp. 28-39.
6. Bern,M. (1993) Approximate closest-point queries in high dimensions. Inf. Process Lett., 45, 95-99.
7. Böhm,C. et al. (2001) Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv., 33, 322-373.
8. Boytsov,L. (2011a) Indexing methods for approximate dictionary searching. J. Exp. Algorithmics, 16, 1.
9. Boytsov,L. (2011b) Indexing methods for approximate dictionary searching: Comparative analysis. J. Exp. Algorithmics, 16, 1.1:1.1-1.1:1.91.
10. Bugnion,E. et al. (1995) A spatial index for approximate multiple string matching. J. Brazilian Chem. Soc., 1, 28-35.
11. Burkhardt,S. and Kärkkäinen,J. (2002) Better filtering with gapped q-grams. Fundam. Inf., 56, 51-70.
12. Bustos,B. and Navarro,G. (2009) Improving the space cost of k -nn search in metric spaces by using distance estimators. Multimedia Tools Appl., 41, 215-233.
13. Chen,K. et al. (2009) Breakdancer: an algorithm for high-resolution mapping of genomic structural variation. Nat. Methods, 6, 677-681.
14. Ewing,B. and Green,P. (1998) Base-calling of automated sequencer traces using phred. II. error probabilities. Genome Res., 8, 186-194.
15. Frigo,M. et al. (1999) Cache-oblivious algorithms. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, FOCS '99. IEEE Computer Society, Washington, pp. 285.
16. Frith,M.C. et al. (2010) Incorporating sequence quality data into alignment improves DNA read mapping. Nucleic Acids Res., 38, e100.
17. Goke,J. et al. (2012) Estimation of pairwise sequence similarity of mammalian enhancers with word neighbourhood counts. Bioinformatics, 28, 656-663.
18. Gusfield,D. (1997) Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge.
19. Hach,F. et al. (2010) mrsfast: a cache-oblivious algorithm for short-read mapping. Nat. Method., 7, 576-577.
20. Hamada,M. et al. (2011) Probabilistic alignments with quality scores: an application to short-read mapping toward accurate snp/indel detection. Bioinformatics, 27, 3085-3092.
21. Hormozdiari,F. et al. (2009) Combinatorial algorithms for structural variation detection in high-throughput sequenced genomes. Genome Res., 19, 1270-1278.
22. Hormozdiari,F. et al. (2010) Next-generation variationhunter: combinatorial algorithms for transposon insertion discovery. Bioinformatics, 26, i350-i357.
23. Houle,M.E. and Sakuma,J. (2005) Fast approximate similarity search in extremely highdimensional data sets. In Aberer,K. et al. (eds). ICDE. IEEE Computer Society, Washington, DC, pp. 619-630.
24. Katayama,N. and Satoh,S. (1998) Sr-tree: An index structure for nearest-neighbor searching of high-dimensional point data. Sys. Comput. Japan, 29, 59-73.
25. Kibriya,A. and Frank,E. (2007) An empirical comparison of exact nearest neighbour algorithms. In Kok, J. et al. (eds). Knowledge Discovery in Databases: PKDD 2007, volume 4702 of Lecture Notes in Computer Science, Springer, Berlin, pp. 140-151.
26. Korbel,J.O. et al. (2009) Pemer: a computational framework with simulation-based error models for inferring genomic structural variants from massive paired-end sequencing data. Genome Biol., 10, R23.
27. Langmead,B. et al. (2009) Ultrafast and memory-efficient alignment of short dna sequences to the human genome. Genome Biol., 10, R25.
28. Lee,S. et al. (2009) Modil: detecting small indels from clone-end sequencing with mixtures of distributions. Nat. Methods, 6, 473-474.
29. Leslie,C. et al. (2002) The spectrum kernel: a string kernel for svm protein classification. In Proceedings of Pacific Symposium on Biocomputing, pp. 564-575.
30. Li,H. and Durbin,R. (2009) Fast and accurate short read alignment with burrows-wheeler transform. Bioinformatics, 25, 1754-1760.
31. Li,H. and Homer,N. (2010) A survey of sequence alignment algorithms for nextgeneration sequencing. Brief. Bioinformatics, 11, 473-483.
32. Li,R. et al. (2009) Soap2: an improved ultrafast tool for short read alignment. Bioinformatics, 25, 1966-1967.
33. Liu,X. et al. (2011) New powerful statistics for alignment-free sequence comparison under a pattern transfer model. J. Theo. Biol., 284, 106-116.
34. Lunter,G. and Goodson,M. (2011) Stampy: A statistical algorithm for sensitive and fast mapping of illumina sequence reads. Genome Res., 21, 936-939.
35. Malhis,N. and Jones, S.J.M. (2010) High quality SNP calling using Illumina data at shallow coverage. Bioinformatics (Oxford, England), 26, 1029-35.
36. Mount,D.M. and Arya,S. (2010) Ann: A library for approximate nearest neighbor searching.Available at http://www.cs.umd.edu/ mount/ANN/.Accessed on July 18, 2012.
37. Muja,M. and Lowe,D.G. (2009) Fast approximate nearest neighbors with automatic algorithm configuration. In Ranchordas, A. et al. (eds). International Conference on Computer Vision Theory and Application (VISSAPP'09), INSTICC Press, Setubal, Portugal, pp. 331-340.
38. Myers,G. (1999) A fast bit-vector algorithm for approximate string matching based on dynamic programming. J. ACM, 46, 395-415.
39. Navarro,G. (2001) A guided tour to approximate string matching. ACM Comput. Surv., 33, 31-88.
40. Navarro,G. and Chávez,E. (2006)Ametric index for approximate string matching. Theo. Comput. Sci., 352, 266-279.
41. Navarro,G. et al. (2005). Indexing text with approximate q-grams. J. Discrete Algorithms, 3, 157-175.
42. Ning,Z. et al. (2001) Ssaha:Afast search method for large dna databases. Genome Res., 11, 1725-1729.
43. Ozturk,O. and Ferhatosmanoglu,H. (2003) Effective indexing and filtering for similarity search in large biosequence databases. In BIBE, IEEE Computer Society, Washington, DC, pp. 359-366.
44. Ozturk,O. and Ferhatosmanoglu,H. (2005) Vector space indexing for biosequence similarity searches. Int. J. Artificial Intel. Tool, 14, 811-826.
45. Paulevé,L. et al. (2010). Locality sensitive hashing: a comparison of hash function types and querying mechanisms. Pattern Reco. Lett., 31, 1348-1358.
46. Reinert,G. et al. (2009) Alignment-free sequence comparison (i): statistics and power. J. Comput. Biol., 16, 1615-1634.
47. Sellis,T.K. et al. (1987) The r+-tree: A dynamic index for multi-dimensional objects. In: Proceedings of the 13th International Conference on Very Large Data Bases, VLDB '87, Morgan Kaufmann Publishers Inc, San Francisco, pp. 507-518.
48. Sutinen,E. and Szpankowski,W. (1998) On the collapse of q-Gram filtration. In FUN with Algorithms, Carleton University, Ottawa, ON, Canada, pp. 178-193.
49. Takahashi,M. et al. (2009) Estimation of bacterial species phylogeny through oligonucleotide frequency distances. Genomics, 93, 525-533.
50. The 1000 Genomes Project Consortium (2010) Amap of human genome variation from population-scale sequencing. Nature, 467, 1061-1073.
51. The International HapMap Consortium (2005) A haplotype map of the human genome. Nature, 437, 1299-1320.
52. Ukkonen,E. (1992) Approximate string matching with q-grams and maximal matches. Theor. Comput. Sci., 92, 191-211.
53. van Emde Boas,P. (1975) Preserving order in a forest in less than logarithmic time. In: Proceedings of the 16th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC, pp. 75-84.
54. van Emde Boas,P. et al. (1976) Design and implementation of an efficient priority queue. Theo. Comput. Syst., 10, 99-127.
55. Wan,L. et al. (2010) Alignment-free sequence comparison (ii): theoretical power of comparison statistics. J. Comput. Biol., 17, 1467-1490.
56. Weese,D. et al. (2009) Razers fast read mapping with sensitivity control. Genome Res., 19, 1646-1654.
57. Yao,B. et al. (2010) Approximate string search in spatial databases. In Li, F. et al. (eds). ICDE, IEEE Computer Society, Washington, DC, pp. 545-556.