Cargando…
Faucet: streaming de novo assembly graph construction
MOTIVATION: We present Faucet, a two-pass streaming algorithm for assembly graph construction. Faucet builds an assembly graph incrementally as each read is processed. Thus, reads need not be stored locally, as they can be processed while downloading data and then discarded. We demonstrate this func...
Autores principales: | Rozov, Roye, Goldshlager, Gil, Halperin, Eran, Shamir, Ron |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5870852/ https://www.ncbi.nlm.nih.gov/pubmed/29036597 http://dx.doi.org/10.1093/bioinformatics/btx471 |
Ejemplares similares
-
Utilizing de Bruijn graph of metagenome assembly for metatranscriptome analysis
por: Ye, Yuzhen, et al.
Publicado: (2016) -
SV-Bay: structural variant detection in cancer genomes using a Bayesian approach with correction for GC-content and read mappability
por: Iakovishina, Daria, et al.
Publicado: (2016) -
Accurate self-correction of errors in long reads using de Bruijn graphs
por: Salmela, Leena, et al.
Publicado: (2017) -
FastRFS: fast and accurate Robinson-Foulds Supertrees using constrained exact optimization
por: Vachaspati, Pranjal, et al.
Publicado: (2017) -
Xenolog classification
por: Darby, Charlotte A, et al.
Publicado: (2017)