लोड हो रहा है...
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
BACKGROUND: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly problem fall into two broad categories - based on the data structures which they employ. The first class uses an overlap/strin...
में बचाया:
| मुख्य लेखकों: | , , , , |
|---|---|
| स्वरूप: | Artigo |
| भाषा: | Inglês |
| प्रकाशित: |
BioMed Central
2010
|
| विषय: | |
| ऑनलाइन पहुंच: | https://ncbi.nlm.nih.gov/pmc/articles/PMC2996408/ https://ncbi.nlm.nih.gov/pubmed/21078174 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/1471-2105-11-560 |
| टैग : |
टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|