Cargando…
Topology-based sparsification of graph annotations
MOTIVATION: Since the amount of published biological sequencing data is growing exponentially, efficient methods for storing and indexing this data are more needed than ever to truly benefit from this invaluable resource for biomedical research. Labeled de Bruijn graphs are a frequently-used approac...
Autores principales: | Danciu, Daniel, Karasikov, Mikhail, Mustafa, Harun, Kahles, André, Rätsch, Gunnar |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8346655/ https://www.ncbi.nlm.nih.gov/pubmed/34252940 http://dx.doi.org/10.1093/bioinformatics/btab330 |
Ejemplares similares
-
Sparse Binary Relation Representations for Genome Graph Annotation
por: Karasikov, Mikhail, et al.
Publicado: (2020) -
Lossless indexing with counting de Bruijn graphs
por: Karasikov, Mikhail, et al.
Publicado: (2022) -
Dynamic compression schemes for graph coloring
por: Mustafa, Harun, et al.
Publicado: (2019) -
Fast Community Detection with Graph Sparsification
por: Laeuchli, Jesse
Publicado: (2020) -
Faster Cut Sparsification of Weighted Graphs
por: Forster, Sebastian, et al.
Publicado: (2022)