Cargando…
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...
Autores principales: | Obscura Acosta, Nidia, Mäkinen, Veli, Tomescu, Alexandru I. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2018
|
Materias: | |
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 |
Ejemplares similares
-
On the complexity of Minimum Path Cover with Subpath Constraints for multi-assembly
por: Rizzi, Romeo, et al.
Publicado: (2014) -
A novel min-cost flow method for estimating transcript expression with RNA-Seq
por: Tomescu, Alexandru I, et al.
Publicado: (2013) -
Chaining for accurate alignment of erroneous long reads to acyclic variation graphs
por: Ma, Jun, et al.
Publicado: (2023) -
Improving RNA Assembly via Safety and Completeness in Flow Decompositions
por: Khan, Shahbaz, et al.
Publicado: (2022) -
A framework for space-efficient read clustering in metagenomic samples
por: Alanko, Jarno, et al.
Publicado: (2017)