Cargando…
Efficient enumeration of monocyclic chemical graphs with given path frequencies
BACKGROUND: The enumeration of chemical graphs (molecular graphs) satisfying given constraints is one of the fundamental problems in chemoinformatics and bioinformatics because it leads to a variety of useful applications including structure determination and development of novel chemical compounds....
Autores principales: | Suzuki, Masaki, Nagamochi, Hiroshi, Akutsu, Tatsuya |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4049473/ https://www.ncbi.nlm.nih.gov/pubmed/24955135 http://dx.doi.org/10.1186/1758-2946-6-31 |
Ejemplares similares
-
Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies
por: Shimizu, Masaaki, et al.
Publicado: (2011) -
Comparison and Enumeration of Chemical Graphs
por: Akutsu, Tatsuya, et al.
Publicado: (2013) -
Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank
por: Azam, Naveed Ahmed, et al.
Publicado: (2020) -
An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops
por: Azam, Naveed Ahmed, et al.
Publicado: (2020) -
Combinatorial enumeration of groups, graphs, and chemical compounds
por: Pólya, G, et al.
Publicado: (1987)