Enumerating treelike chemical graphs with given path frequency

Journal of Chemical Information and Modeling

Volumn 48, Issue 7, 2008, Pages 1345-1357

  Fujiwara, Hiroki ^a   Wang, Jiexun ^a   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

CONSTRAINT SATISFACTION PROBLEMS; FORESTRY; GRAPH THEORY; HYDROCARBONS; ISOMERS; PARAFFINS;

ALKANE ISOMERS; CHEMICAL GRAPHS; CHEMOINFORMATICS; ENUMERATION PROBLEMS; EXACT ALGORITHMS; EXACT ENUMERATION; MULTIPLE BONDS; STATE-OF-THE-ART ALGORITHMS;

BRANCH AND BOUND METHOD;

EID: 49449088895     PISSN: 15499596     EISSN: 1549960X     Source Type: Journal    
DOI: 10.1021/ci700385a     Document Type: Article

References (47)

1. Cayley, A. On the Mathematical Theory of Isomers. Philos. Mag. (1798-1977) 1874, 47, 444-446.
2. Cayley, A. On the Analytic Forms Called Trees, with Applications to the Theory of Chemical Combinations. Rep. Br. Assoc. Adv. Sci. 1875, 45, 257-305.
3. Bytautas, L.; Klein, D. J. Chemical Combinatorics for Alkane-Isomer Enumeration and More. J. Chem. Inf. Comput. Sci. 1998, 38, 1063-1078.
4. Henze, H. R.; Blair, C. M. The Number of Isomeric Hydrocarbons of the Methane Series. J. Am. Chem. Soc. 1931, 53, 3077-3085.
5. Lederberg, J.; Sutherland, G. L.; Buchanan, A.; Feigenbaum, E. A.; Robertson, A. V.; Duffield, A. M.; Djerassi, C. Applications of Artificial Intelligence for Chemical Inference. I. The Number of Possible Organic Compounds. Acyclic Structures Containing Carbon, Hydrogen, Oxygen, and Nitrogen. J. Am. Chem. Soc. 1969, 91, 2973-2976.
6. Lederberg, J. Topology of molecules. In The Mathematical Sciences; COSRIMS, Ed.; MIT Press: Cambridge, MA, 1969; pp 37-51.
7. Lindsay, R. K.; Buchanan, B. G.; Feigenbaum, E. A.; Lederberg, J. Application of Artificial Intelligence for Organic Chemistry: The DENDRAL Project; McGraw-Hill Companies, Inc.: New York, 1980.
8. Pólya, G. Kombinatorische Anzahlbestimmungen für Gruppen, Graphen, un chemische Verbindungen. Acta Math. 1937, 68, 145-253.
9. Pólya, G.; Read, R. C. Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds; Springer-Verlag: New York, 1987.
10. Read, R. C. The Enumeration of Acyclic Chemical Compounds. In Chemical Applications of Graph Theory; Balaban, A. T., Ed.; Academic Press: New York, 1976; 25-61.
11. Rouvray, D. H. Isomer Enumeration Methods. Chem. Soc. Rev. 1974, 3, 355-372.
12. 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.
13. 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.
14. Knop, J. V.; Mueller, W. R.; Jeričević, Ź.; Trinajstić, N. Computer Enumeration and Generation of Trees and Rooted Trees. J. Chem. Inf. Comput. Sci. 1981, 21, 91-99.
15. 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.
16. Trinajstić, N.; Nicolić, 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.
17. Buchanan, B. G.; Feigenbaum, E. A. DENDRAL and Meta-DEN-DRAL - Their Applications Dimension. Artif. Intell. 1978, 11, 5-24.
18. Funatsu, K.; Sasaki, S. Recent Advances in the Automated Structure Elucidation System, CHEMICS. Utilization of Two-Dimensional NMR Spectral Information and Development of Peripheral Functions for Examination of Candidates. J. Chem. Inf. Comput. Sci. 1996, 36, 190-204.
19. Fink, T.; Reymond, J. L. Virtual Exploration of the C hemical 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.
20. Mauser, H.; Stahl, M. Chemical Fragment Spaces for De Novo Design. J. Chem. Inf. Comput. Sci. 2007, 47, 318-324.
21. 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.
22. Hall, L. H.; Dailey, E. S. 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.
23. Byvatov, E.; Fechner, U.; Sadowski, J.; Schneider, G. Comparison of Support Vector Machine and Artificial Neural Network Systems for Drug/Nondrug Classification. J. Chem. Inf. Comput. Sci. 2003, 43, 1882-1889.
24. 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.
25. 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; Fawcett, T., Mishra, N., Eds.; The AAAI Press: Menlo Park, CA, 2003; pp 321-328.
26. 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.
27. Cristianini, N.; Shawe-Taylor, J. An Introduction to Support Vector Machines and Other Kernel-based Learning Methods; Cambridge University Press: New York, 2000.
28. Bakr, G. H.; Weston, J.; Schölkopf, B. Learning to Find Pre-Images. In Advances in Neural Information Processing Systems; Thrun, S., Saul, L., Schölkopf, B., Eds.; MIT Press: Cambridge, MA, 2003; Vol. 16, pp 449-456.
29. Bakr, G. H.; Zien, A.; Tsuda, K. Learning to Find Graph Pre-Images. Lect. Notes Comput. Sci. 2004, 3175, 253-261.
30. Akutsu, T.; Fukagawa, D. Inferring A Graph from Path Frequency. Lect. Notes Comput. Sci. 2005, 3537, 371-382.
31. 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 5th Asia-Pacific Bioinformatics Conference, Hong Kong, China, January 15-17, 2007; Sankoff, D., Wang, L., Chin, F., Eds.; Imperial College Press: London, 2007; pp 165-174.
32. Nagamochi, H. A Detachment Algorithm for Inferring A Graph from Path Frequency. Lect. Notes Comput. Sci. 2006, 4112, 274-283.
33. Konc, J.; Janeč, D. An Improved Branch and Bound Algorithm for the Maximum Clique Problem. MATCH 2007, 58, 569-590.
34. Konc, J.; Janeč, D. Protein-Protein Binding-Sites Prediction by Protein Surface Structure Conservation. J. Chem. Inf. Model. 2007, 47, 940-944.
35. Konc, J.; Janeč, D. A Branch and Bound Algorithm for Matching Protein Structures. Lect. Notes Comput. Sci. 2007, 4432, 399-406.
36. Aringhieri, R.; Hansen, P.; Malucelli, F. Chemical Trees Enumeration Algorithms. 4OR: Quart. J. Oper. Res. 2003, 1, 67-83.
37. Kvasnička, V.; Pospíchal, J. Constructive Enumeration of Acyclic Molecules. Constructive Enumeration of Acyclic Molecules. Collect. Czech. Chem. Commun. 1991, 56, 1777-1802.
38. Kozina, A. V. Coding and Generation of Nonisomorphic Trees. Cybernetics 1975, 15, 645-561.
39. Liu, J. Lexicographical Generation of Rooted Trees and Trees. Kexue Tongbao 1983, 28, 448-451.
40. Nakano, S.; Uno, T. Generating Colored Trees. Lect. Notes Comput. Sci. 2005, 3787, 249-260.
41. Tinhofer, G.; Schreck, H. Linear Time Tree Codes. Computing 1984, 33, 211-225.
42. Wright, R. A.; Richmond, B.; Odlyzko, A.; Mckay, B. D. Constant Time Generation of Free Trees. SIAM J. Comput. 1986, 15, 540-548.
43. Jordan, C. Sur Les Assemblages De Lignes. J. Reine Angew. Math. 1869, 70, 185-190.
44. Nakano, S.; Uno, T. Efficient Generation of Rooted Trees. Technical Report, NII-2003-005E; National Institute of Informatics: Tokyo, Japan, July 3, 2003; ISSN: 1346-5597.
45. Knopfmacher, J. Asymptotic Isomer Enumeration in Chemistry. J. Math. Chem. 1998, 24, 61-69.
46. Wang, J.; Zhao, L.; Nagamochi, H.; Akutsu, T. An Efficient Algorithm for Generating Colored Outerplanar Graphs. Lect. Notes Comput. Sci. 2007, 4484, 573-583.
47. 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.