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

Title
A fast, lock-free approach for efficient parallel counting of occurrences of k-mers
Authors
Keywords
-
Journal
BIOINFORMATICS
Volume 27, Issue 6, Pages 764-770
Publisher
Oxford University Press (OUP)
Online
2011-01-09
DOI
10.1093/bioinformatics/btr011

Ask authors/readers for more resources

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search