Clustering of reads with alignment-free measures and quality values

Algorithms for Molecular Biology

Volumn 10, Issue 1, 2015, Pages

  Comin, Matteo ^a   Leoni, Andrea ^a   Schimd, Michele ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

Alignment free measures; Reads clustering; Reads quality values

Indexed keywords

EID: 84924253918     PISSN: None     EISSN: 17487188     Source Type: Journal    
DOI: 10.1186/s13015-014-0029-x     Document Type: Article

References (36)

1. Medini D, Serruto D, Parkhill J, Relman DA, Donati C, Moxon R, et al. Microbiology in the post-genomic era. Nat Rev Microbiol. 2008; 6:419-30.
2. Jothi R, Cuddapah S, Barski A, Cui K, Zhao K. Genome-wide identification of in vivo protein-dna binding sites from chip-seq data. Nucleic Acids Res. 2008; 36:5221-31.
3. Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ. Basic local alignment search tool. J Mol Biol. 1990; 215:403-10.
4. Sims GE, Jun S-R, Wu GA, Kim S-H. Alignment-free genome comparison with feature frequency profiles (ffp) and optimal resolutions. Proc Nat Acad Sci. 2009; 106:2677-82.
5. Comin M, Verzotto D. Whole-genome phylogeny by virtue of unic subwords. In: 23rd international workshop on Database and EXpert systems Applications (DEXA 2012): 2012. p. 190-194.
6. Comin M, Verzotto D. Alignment-free phylogeny of whole genomes using underlying subwords. Algorithms Mol Biol. 2012; 7(1):34.
7. Song K, Ren J, Zhai Z, Liu X, Deng M, Sun F. Alignment-free sequence comparison based on next-generation sequencing reads. J Comput Biol. 2013; 20(2):64-79.
8. Comin M, Schimd M. Assembly-free genome comparison based on next-generation sequencing reads and variable length patterns. BMC Bioinformatics. 2014; 15(Suppl 9):1.
9. Vinga S, Almeida J. Alignment-free sequence comparison-a review. Bioinformatics. 2003; 19(4):513-23.
10. Dai Q, Wang T. Comparison study on k-word statistical measures for protein: From sequence to'sequence space'. BMC Bioinformatics. 2008; 9(1):394.
11. Gao L, Qi J. Whole genome molecular phylogeny of large dsdna viruses using composition vector method. BMC Evol Biol. 2007; 7(1):41.
12. Qi J, Luo H, Hao B. Cvtree: a phylogenetic tree reconstruction tool based on whole genomes. Nucleic Acids Res. 2004; 32(suppl 2):45-7.
13. Göke J, Schulz MH, Lasserre J, Vingron M. Estimation of pairwise sequence similarity of mammalian enhancers with word neighbourhood counts. Bioinformatics. 2012; 28(5):656-63.
14. Kantorovitz MR, Robinson GE, Sinha S. A statistical method for alignment-free comparison of regulatory sequences. Bioinformatics. 2007; 23(13):249-55.
15. Comin M, Verzotto D. Beyond fixed-resolution alignment-free measures for mammalian enhancers sequence comparison. IEEE/ACM Trans Comput Biol Bioinformatics. 2014; 11(4):628-37.
16. Comin M, Antonello M. Fast computation of entropic profiles for the detection of conservation in genomes In: Ngom A, Formenti E, Hao J-K, Zhao X-M, van Laarhoven T, editors. Pattern recognition in Bioinformatics. vol. 7986,Berlin Heidelberg: Springer: 2013. p. 277-88.
17. Comin M, Antonello M. Fast entropic profiler: An information theoretic approach for the discovery of patterns in genomes. Comput Biol Bioinform IEEE/ACM Trans. 2014; 11(3):500-9.
18. Comin M, Verzotto D. Classification of protein sequences by means of irredundant patterns. BMC bioinformatics. 2010; 11(Suppl 1):16.
19. Comin M, Verzotto D. The irredundant class method for remote homology detection of protein sequences. J Comput Biol. 2011; 18(12):1819-29.
20. Qu W, Hashimoto S-i, Morishita S. Efficient frequency-based de novo short-read clustering for error trimming in next-generation sequencing. Genome Res. 2009; 19(7):1309-15.
21. Bao E, Jiang T, Kaloshian I, Girke T. Seed: efficient clustering of next-generation sequences. Bioinformatics. 2011; 27(18):2502-9.
22. Solovyov A, Lipkin W. Centroid based clustering of high throughput sequencing reads based on n-mer counts. BMC Bioinformatics. 2013; 14(1):268.
23. Li H, Ruan J, Durbin R. Mapping short dna sequencing reads and calling variants using mapping quality scores. Genome Res. 2008; 18(11):1851-8.
24. Albers CA, Lunter G, MacArthur DG, McVean G, Ouwehand WH, Durbin R. Dindel: accurate indel calls from short-read data. Genome Res. 2011; 21(6):961-73.
25. Carneiro MO, Russ C, Ross MG, Gabriel SB, Nusbaum C, DePristo MA. Pacific biosciences sequencing technology for genotyping and variation discovery in human data. BMC Genomics. 2012; 13(1):375.
26. Blaisdell BE. A measure of the similarity of sets of sequences not requiring sequence alignment. Proc Natl Acad Sci. 1986; 83(14):5155-9.
27. Lippert RA, Huang H, Waterman MS. Distributional regimes for the number of k-word matches between two random sequences. Proc Natl Acad Sci. 2002; 99(22):13980-9.
28. Reinert G, Chew D, Sun F, Waterman MS. Alignment-free sequence comparison (i): statistics and power. J Comput Biol. 2009; 16(12):1615-34.
29. Wan L, Reinert G, Sun F, Waterman MS. Alignment-free sequence comparison (ii): theoretical power of comparison statistics. J Comput Biol. 2010; 17(11):1467-90.
30. Ewing B, Green P. Base-calling of automated sequencer traces using phred. ii. error probabilities. Genome Res. 1998; 8(3):186-94.
31. NCBI dataset of human mRNA genes. ftp://ftp.ncbi.nlm.nih.gov/refseq/H_sapiens/mRNA_Prot/.
32. Mason. http://seqan.de/projects/mason.html
33. Holtgrewe M. Mason-a read simulator for second generation sequencing data. Technical Report FU Berlin. 2010. TR-B-10-06.
34. Birney E. Assemblies: the good, the bad, the ugly. Nat Methods. 2011; 8(1):59-60.
35. Zerbino DR, Birney E. Velvet: algorithms for de novo short read assembly using de bruijn graphs. Genome Res. 2008; 18(5):821-9.
36. Comin M, Leoni A, Schimd M. Qcluster: Extending alignment-free measures with quality values for reads clustering. Algorithms Bioinform Lect Notes Comput Sci. 2014; 8701:1-13.