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...

Descripción completa

Detalles Bibliográficos
Autores principales: Obscura Acosta, Nidia, Mäkinen, Veli, Tomescu, Alexandru I.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2018
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5802251/
https://www.ncbi.nlm.nih.gov/pubmed/29445416
http://dx.doi.org/10.1186/s13015-018-0122-7

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5802251/
https://www.ncbi.nlm.nih.gov/pubmed/29445416
http://dx.doi.org/10.1186/s13015-018-0122-7

Ejemplares similares