Cargando…
Simplitigs as an efficient and scalable representation of de Bruijn graphs
de Bruijn graphs play an essential role in bioinformatics, yet they lack a universal scalable representation. Here, we introduce simplitigs as a compact, efficient, and scalable representation, and ProphAsm, a fast algorithm for their computation. For the example of assemblies of model organisms and...
Autores principales: | Břinda, Karel, Baym, Michael, Kucherov, Gregory |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8025321/ https://www.ncbi.nlm.nih.gov/pubmed/33823902 http://dx.doi.org/10.1186/s13059-021-02297-z |
Ejemplares similares
-
Scalable, ultra-fast, and low-memory construction of compacted de Bruijn graphs with Cuttlefish 2
por: Khan, Jamshed, et al.
Publicado: (2022) -
deBGR: an efficient and near-exact representation of the weighted de Bruijn graph
por: Pandey, Prashant, et al.
Publicado: (2017) -
Extremely fast construction and querying of compacted and colored de Bruijn graphs with GGCAT
por: Cracco, Andrea, et al.
Publicado: (2023) -
Lossless indexing with counting de Bruijn graphs
por: Karasikov, Mikhail, et al.
Publicado: (2022) -
GRIDSS: sensitive and specific genomic rearrangement detection using positional de Bruijn graph assembly
por: Cameron, Daniel L., et al.
Publicado: (2017)