Cargando…
Integer programming-based method for grammar-based tree compression and its application to pattern extraction of glycan tree structures
BACKGROUND: A bisection-type algorithm for the grammar-based compression of tree-structured data has been proposed recently. In this framework, an elementary ordered-tree grammar (EOTG) and an elementary unordered-tree grammar (EUTG) were defined, and an approximation algorithm was proposed. RESULTS...
Autores principales: | Zhao, Yang, Hayashida, Morihiro, Akutsu, Tatsuya |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2010
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3024861/ https://www.ncbi.nlm.nih.gov/pubmed/21172054 http://dx.doi.org/10.1186/1471-2105-11-S11-S4 |
Ejemplares similares
-
Grammar-based compression approach to extraction of common rules among multiple trees of glycans and RNAs
por: Zhao, Yang, et al.
Publicado: (2015) -
Parallelization of enumerating tree-like chemical compounds by breadth-first search order
por: Hayashida, Morihiro, et al.
Publicado: (2015) -
Enumeration method for tree-like chemical compounds with benzene rings and naphthalene rings by breadth-first search order
por: Jindalertudomdee, Jira, et al.
Publicado: (2016) -
A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures
por: Fukagawa, Daiji, et al.
Publicado: (2011) -
Comparing biological networks via graph compression
por: Hayashida, Morihiro, et al.
Publicado: (2010)