Cargando…
Sparse Binary Relation Representations for Genome Graph Annotation
High-throughput DNA sequencing data are accumulating in public repositories, and efficient approaches for storing and indexing such data are in high demand. In recent research, several graph data structures have been proposed to represent large sets of sequencing data and to allow for efficient quer...
Autores principales: | Karasikov, Mikhail, Mustafa, Harun, Joudaki, Amir, Javadzadeh-no, Sara, Rätsch, Gunnar, Kahles, André |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Mary Ann Liebert, Inc., publishers
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7185347/ https://www.ncbi.nlm.nih.gov/pubmed/31891531 http://dx.doi.org/10.1089/cmb.2019.0324 |
Ejemplares similares
-
Topology-based sparsification of graph annotations
por: Danciu, Daniel, et al.
Publicado: (2021) -
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) -
Exploiting ontology graph for predicting sparsely annotated gene function
por: Wang, Sheng, et al.
Publicado: (2015) -
Graph Regularized Deep Sparse Representation for Unsupervised Anomaly Detection
por: Li, Shicheng, et al.
Publicado: (2021)