Yüklüyor......
A fast, lock-free approach for efficient parallel counting of occurrences of k-mers
Motivation: Counting the number of occurrences of every k-mer (substring of length k) in a long string is a central subproblem in many applications, including genome assembly, error correction of sequencing reads, fast multiple sequence alignment and repeat detection. Recently, the deep sequence cov...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Oxford University Press
2011
|
| Konular: | |
| Online Erişim: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3051319/ https://ncbi.nlm.nih.gov/pubmed/21217122 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1093/bioinformatics/btr011 |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|