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

标题
A fast, lock-free approach for efficient parallel counting of occurrences of k-mers
作者
关键词
-
出版物
BIOINFORMATICS
Volume 27, Issue 6, Pages 764-770
出版商
Oxford University Press (OUP)
发表日期
2011-01-09
DOI
10.1093/bioinformatics/btr011

向作者/读者发起求助以获取更多资源

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

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started