Branch-and-bound algorithms for enumerating treelike chemical graphs with given path frequency using detachment-cut

Journal of Chemical Information and Modeling

Volumn 50, Issue 5, 2010, Pages 934-946

  Ishida, Yusuke ^a   Kato, Yuki ^b   Zhao, Liang ^a   Nagamochi, Hiroshi ^a   Akutsu, Tatsuya ^b  

^a KYOTO UNIVERSITY   (Japan)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; FORESTRY; GRAPH THEORY;

BRANCH-AND-BOUND ALGORITHMS; CHEMICAL GRAPHS; CHEMOINFORMATICS; COMPUTATION TIME; SEARCH SPACES; STRUCTURE DETERMINATION; WEB SERVERS;

GRAPH ALGORITHMS;

ALGORITHM; ARTICLE; BIOLOGY; CHEMICAL STRUCTURE; COMPUTER ANALYSIS; FACTUAL DATABASE; METHODOLOGY;

ALGORITHMS; COMPUTATIONAL BIOLOGY; COMPUTING METHODOLOGIES; DATABASES, FACTUAL; MOLECULAR STRUCTURE;

EID: 77952771659     PISSN: 15499596     EISSN: 1549960X     Source Type: Journal    
DOI: 10.1021/ci900447z     Document Type: Article

References (31)

1. Cayley, A. On the Analytic Forms Called Trees with Applications to the Theory of Chemical Combinations Rep. Brit. Assoc. Adv. Sci. 1875, 45, 257-305
2. Balaban, T. S.; Filip, P. A.; Ivanciuc, O. Computer Generation of Acyclic Graphs Based on Local Vertex Invariants and Topological Indices. Derived Canonical Labeling and Coding of Trees and Alkanes J. Math. Chem. 1992, 11, 79-105
3. Jackson, M. D.; Bieber, T. I. Applications of Degree Distribution. 2. Construction and Enumeration of Isomers in the Alkane Series J. Chem. Inf. Comput. Sci. 1993, 33, 701-708
4. Knop, J. V.; Müeller, W. R.; Jeričevic, Z.; Trinajstic, N. Computer Enumeration and Generation of Trees and Rooted Trees J. Chem. Inf. Comput. Sci. 1981, 21, 91-99
5. Masinter, L. M.; Sridharan, N. S.; Lederberg, J.; Smith, D. H. Applications of Artificial Intelligence for Chemical Inference. XII. Exhaustive Generation of Cyclic and Acyclic Isomers J. Am. Chem. Soc. 1974, 96, 7702-7714
6. Trinajstic, N.; Nicolic, S.; Knop, J. V.; Müller, W. R.; Szymanski, K. Computational Chemical Graph Theory: Characterization, Enumeration and Generation of Chemical Structures by Computer Methods; Simon Schuster/Horwood: Chichester, U. K., 1991.
7. Faulon, J.-L.; Churchwell, C. J.; Visco, D. P., Jr. The Signature Molecular Descriptor. 2. Enumerating Molecules from Their Extended Valence Sequences J. Chem. Inf. Comput. Sci. 2003, 43, 721-734
8. Hall, L. H.; Dailey, R. S.; Kier, L. B. Design of Molecules from Quantitative Structure Activity Relationship Models. 3. Role of Higher Order Path Counts: Path 3 J. Chem. Inf. Comput. Sci. 1993, 33, 598-603
9. Deshpande, M.; Kuramochi, M.; Wale, N.; Karypis, G. Frequent Substructure-Based Approaches for Classifying Chemical Compounds IEEE Trans. Knowl. Data Eng. 2005, 17, 1036-1050
10. Fink, T.; Reymond, J. L. Virtual Exploration of the Chemical Universe up to 11 Atoms of C, N, O, F: Assembly of 26.4 Million Structures (110.9 Million Stereoisomers) and Analysis for New Ring Systems, Stereochemistry, Physicochemical Properties, Compound Classes, and Drug Discovery J. Chem. Inf. Comput. Sci. 2007, 47, 342-353
11. Mauser, H.; Stahl, M. Chemical Fragment Spaces for De Novo Design J. Chem. Inf. Comput. Sci. 2007, 47, 318-324
12. Akutsu, T.; Fukagawa, D. Inferring a Chemical Structure from a Feature Vector Based on Frequency of Labeled Paths and Small Fragments. In Series on Advances in Bioinformatics and Computational Biology, Proceedings of the Fifth Asia Pacific Bioinformatics Conference, Hong Kong, China, January 15-17, 2007
13. Sankoff, D.; Wang, L.; Chin, F., Eds.; Imperial College Press: London, 2007; pp 165 - 174.
14. Bak r, G. H.; Zien, A.; Tsuda, K. Learning to Find Graph Pre-Images Lect. Notes Comput.Sci 2004, 3175, 253-261
15. Mahé, P.; Ueda, N.; Akutsu, T.; Perret, J. L.; Vert, J. P. Graph Kernels for Molecular Structure Activity Relationship Analysis with Support Vector Machines J. Chem. Inf. Model. 2005, 45, 939-951
16. Kashima, H.; Tsuda, K.; Inokuchi, A. Marginalized Kernels between Labeled Graphs. Proceedings of 20th International Conference on Machine Learning, Washington, DC, August 21-24, 2003
17. Fawcett, T.; Mishra, N., Eds.; The AAAI Press: Menlo Park, CA, 2003; pp 321 - 328.
18. Akutsu, T.; Fukagawa, D. Inferring a Graph from Path Frequency Lect. Notes Comput. Sci. 2005, 3537, 371-382
19. Fujiwara, H.; Wang, J.; Zhao, L.; Nagamochi, H.; Akutsu, T. Enumerating Treelike Chemical Graphs with Given Path Frequency J. Chem. Inf. Model. 2008, 48, 1345-1357
20. Nakano, S.; Uno, T. Efficient Generation of Rooted Trees; Technical Report NII-2003-005E, National Institute of Informatics: Tokyo, Japan, 2003.
21. Nakano, S.; Uno, T. Generating Colored Trees Lect. Notes Comput. Sci. 2005, 3787, 249-260
22. Kier, L. B.; Hall, L. H.; Frazer, J. W. Design of Molecules from Quantitative Structure-Activity Relationship Models. 1. Information Transfer between Path and Vertex Degree Counts J. Chem. Inf. Comput. Sci. 1993, 33, 143-147
23. Skvortsova, M. I.; Baskin, I. I.; Slovokhotova, O. L.; Palyulin, V. A.; Zefirov, N. S. Inverse Problem in QSAR/QSPR Studies for the Case of Topological Indices Characterizing Molecular Shape (Kier Indices) J. Chem. Inf. Comput. Sci. 1993, 33, 630-634
24. Churchwell, C. J.; Rintoul, M. D.; Martin, S.; Visco, D. P., Jr.; Kotu, A.; Larson, R. S.; Sillerud, L. O.; Brown, D. C.; Faulon, J.-L. The Signature Molecular Descriptor: 3. Inverse-Quantitative Structure-Activity Relationship of ICAM-1 Inhibitory Peptides J. Mol. Graphics Model. 2004, 22, 263-273
25. Brown, W. M.; Martin, S.; Rintoul, M. D.; Faulon, J.-L. Designing Novel Polymers with Targeted Properties Using the Signature Molecular Descriptor J. Chem. Inf. Model. 2006, 46, 826-835
26. Nagamochi, H. A Detachment Algorithm for Inferring a Graph from Path Frequency Algorithmica 2009, 53, 207-224
27. Ishida, Y.; Zhao, L.; Nagamochi, H.; Akutsu, T. Improved Algorithms for Enumerating Tree Like Chemical Graphs with Given Path Frequency Genome Inf. Ser. 2008, 21, 53-64
28. Aringhieri, R.; Hansen, P.; Malucelli, F. Chemical Trees Enumeration Algorithms. 4OR Quart. J. Oper. Res. 2003, 1, 67-83
29. Jordan, C. Sur Les Assemblages De Lignes J. Reine Angew. Math. 1869, 70, 185-190
30. Wang, J.; Zhao, L.; Nagamochi, H.; Akutsu, T. An Efficient Algorithm for Generating Colored Outerplanar Graphs Lect. Notes Comput. Sci. 2007, 4484, 573-583
31. Shungo, K.; Iwata, S.; Uno, T.; Koshino, H.; Satoh, H. Algorithm for Advanced Canonical Coding of Planar Chemical Structures that Considers Stereochemical and Symmetric Information J. Chem. Inf. Model. 2007, 47, 1734-1746