Cargando…
On the combinatorics of sparsification
BACKGROUND: We study the sparsification of dynamic programming based on folding algorithms of RNA structures. Sparsification is a method that improves significantly the computation of minimum free energy (mfe) RNA structures. RESULTS: We provide a quantitative analysis of the sparsification of a par...
Autores principales: | Huang, Fenix WD, Reidys, Christian M |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2012
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3549849/ https://www.ncbi.nlm.nih.gov/pubmed/23088372 http://dx.doi.org/10.1186/1748-7188-7-28 |
Ejemplares similares
-
Sequence-structure relations of pseudoknot RNA
por: Huang, Fenix WD, et al.
Publicado: (2009) -
Nonparametric Sparsification of Complex Multiscale Networks
por: Foti, Nicholas J., et al.
Publicado: (2011) -
Fast Community Detection with Graph Sparsification
por: Laeuchli, Jesse
Publicado: (2020) -
Topology-based sparsification of graph annotations
por: Danciu, Daniel, et al.
Publicado: (2021) -
Faster Cut Sparsification of Weighted Graphs
por: Forster, Sebastian, et al.
Publicado: (2022)