Cargando…
Lossless indexing with counting de Bruijn graphs
Sequencing data are rapidly accumulating in public repositories. Making this resource accessible for interactive analysis at scale requires efficient approaches for its storage and indexing. There have recently been remarkable advances in building compressed representations of annotated (or colored)...
Autores principales: | Karasikov, Mikhail, Mustafa, Harun, Rätsch, Gunnar, Kahles, André |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Cold Spring Harbor Laboratory Press
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9528980/ https://www.ncbi.nlm.nih.gov/pubmed/35609994 http://dx.doi.org/10.1101/gr.276607.122 |
Ejemplares similares
-
Utilizing de Bruijn graph of metagenome assembly for metatranscriptome analysis
por: Ye, Yuzhen, et al.
Publicado: (2016) -
Accurate self-correction of errors in long reads using de Bruijn graphs
por: Salmela, Leena, et al.
Publicado: (2017) -
Assembler artifacts include misassembly because of unsafe unitigs and underassembly because of bidirected graphs
por: Rahman, Amatur, et al.
Publicado: (2022) -
Topology-based sparsification of graph annotations
por: Danciu, Daniel, et al.
Publicado: (2021) -
Dynamic compression schemes for graph coloring
por: Mustafa, Harun, et al.
Publicado: (2019)