A fast, lock-free approach for efficient parallel counting of occurrences of k-mers

Bioinformatics

Volumn 27, Issue 6, 2011, Pages 764-770

  Marçais, Guillaume ^a   Kingsford, Carl ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SCYPHOZOA;

ALGORITHM; ANIMAL; ARTICLE; BIOLOGY; COMPUTER PROGRAM; DNA SEQUENCE; GENOME; HUMAN; METHODOLOGY; NUCLEOTIDE SEQUENCE; SEQUENCE ALIGNMENT;

ALGORITHMS; ANIMALS; BASE SEQUENCE; COMPUTATIONAL BIOLOGY; GENOME; HUMANS; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 79952592810     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btr011     Document Type: Article

References (23)

1. Campagna,D. et al. (2005) RAP: a new computer program for de novo identification of repeated sequences in whole genomes. Bioinformatics, 21, 582-588.
2. Cormen,T. et al. (1990) Introduction to Algorithms. Chapter 12. MIT Press, Cambridge, MA.
3. Dalloul,R.A. et al. (2010) Multi-platform next-generation sequencing of the domestic turkey (Meleagris gallopavo): genome assembly and analysis. PLoS Biol., 8, e1000475.
4. Dean,J. and Ghemawat,S. (2008) MapReduce: simplified data processing on large clusters. Commun. ACM, 51, 107-113.
5. Edgar,R.C. (2004) MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res., 32, 1792-1797.
6. Gao,H. et al. (2004) Almost wait-free resizable hashtables. In Proceeding of the 18th International Parallel and Distributed Processing Symposium, IEEE Computer Society, Los Alamitos, CA, USA, p. 50a.
7. Healy,J. et al. (2003) Annotating large genomes with exact word matches. Genome Res., 13, 2306-2315.
8. Jaffe,D.B. et a.l (2003) Whole-genome sequence assembly for mammalian genomes: Arachne 2. Genome Res., 13, 91-96.
9. Kelley,D. et al. (2010) Quake: quality-aware detection and correction of sequencing errors. Genome Biol., 11, R116.
10. Kurtz,S. et al. (2008) A new method to compute k-mer frequencies and its application to annotate large repetitive plant genomes. BMC Genomics, 9, 517.
11. Ladan-mozes,E. and Shavit,N. (2004) An optimistic approach to lock-free fifo queues. In Proceedings of the 18th International Symposium on Distributed Computing, LNCS 3274, Springer, Berlin, Germany, pp. 117-131.
12. Lefebvre,A. et al. (2003) FORRepeats: detects repeats on entire chromosomes and between genomes. Bioinformatics, 19, 319-326.
13. Li,R. et al. (2010) The sequence and de novo assembly of the giant panda genome. Nature, 463, 311-317.
14. Michael,M.M. (2002) High performance dynamic lock-free hash tables and list-based sets. In SPAA '02: Proceedings of the fourteenth annual ACMsymposium on Parallel algorithms and architectures, ACM, New York, NY, USA, pp. 73-82.
15. Michael,M. and Scott,M. (1996) Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In Proceeding of PODC '96.
16. Miller,J.R. et al. (2008) Aggressive assembly of pyrosequencing reads with mates. Bioinformatics, 24, 2818-2824.
17. Myers,E.W. et al. (2000) A whole-genome assembly of Drosophila. Science, 287, 2196-2204.
18. Purcell,C. and Harris,T. (2005) Non-blocking hashtables with open addressing. Technical Report 639, University of Cambridge, Cambridge, UK.
19. Randall,D. (1991) Efficient generation of random nonsingular matrices. Technical Report, University of California at Berkeley, Berkeley, CA, USA.
20. Schatz,M.C. et al. (2010) Assembly of large genomes using second-generation sequencing. Genome Res., 20, 1165-1173.
21. Seward,H. (1954) Information sorting in the application of electronic digital computers to business operations. Master's Thesis, MIT, Cambridge, MA.
22. Shalev,O. and Shavit,N. (2006) Split-ordered lists: Lock-free extensible hash tables. J. ACM, 53, 379-405.
23. Sindi,S.S. et al. (2008) Duplication count distributions in DNA sequences. Phys. Rev. E, 78, 061912.