Načítá se...
A safe and complete algorithm for metagenomic assembly
BACKGROUND: Reconstructing the genome of a species from short fragments is one of the oldest bioinformatics problems. Metagenomic assembly is a variant of the problem asking to reconstruct the circular genomes of all bacterial species present in a sequencing sample. This problem can be naturally for...
Uloženo v:
| Vydáno v: | Algorithms Mol Biol |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
BioMed Central
2018
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5802251/ https://ncbi.nlm.nih.gov/pubmed/29445416 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/s13015-018-0122-7 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|