Inferring a chemical structure from a feature vector based on frequency of labeled paths and small fragments

Series on Advances in Bioinformatics and Computational Biology

Volumn 5, Issue , 2007, Pages 165-174

  Akutsu, Tatsuya ^a   Fukagawa, Daiji ^b  

^a KYOTO UNIVERSITY   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; DYNAMIC PROGRAMMING; POLYNOMIAL APPROXIMATION; STRUCTURE (COMPOSITION);

BRANCH AND BOUNDS; COMPUTATIONAL EXPERIMENT; DRUG DESIGN; FEATURE VECTORS; INFERENCE PROBLEM; POLYNOMIAL-TIME; TREE-LIKE STRUCTURES;

INFERENCE ENGINES;

EID: 84856997531     PISSN: 17516404     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1142/9781860947995_0019     Document Type: Conference Paper

References (15)

1. E. Byvatov, U. Fechner, J. Sadowski and G. Schneider. Comparison of support vector machine and artificial neural network systems for drug/nondrug classification. Journal of Chemical Information and Computer Sciences, 43:1882-1889, 2003.
2. M. Deshpande, M. Kuramochi, N. Wale and G. Karypis. Frequent substructure-based approaches for classifying chemical compounds. IEEE Trans. Knowledge and Data Engineering, 17:1036-1050, 2005.
3. H. Kashima, K. Tsuda and A. Inokuchi. Marginalized kernels between labeled graphs. Proc. 20th Int. Conf. Machine Learning, 321-328, 2003.
4. P. Mahé, N. Ueda, T. Akutsu, J-L. Perret and J-P. Vert. Graph kernels for molecular structureactivity relationship analysis with support vector machines. Journal of Chemical Information and Modeling, 45:939-951, 2005.
5. N. Cristianini and J. Shawe-Taylor. An Introduction to Support Vector Machines and Other Kernel-based Learning Methods. Cambridge Univ. Press, 2000.
6. G. H. Bakir, J. Weston and B. Schölkopf. Learning to find pre-images. Advances in Neural Information Processing Systems, 16:449-456, 2003.
7. G. H. Bakir, A. Zien and K. Tsuda. Learning to find graph pre-images. Lecture Notes in Computer Science, 3175:253-261, 2004.
8. T. Asano. An O(n log log n) time algorithm for constructing a graph of maximum connectivity with prescribed degrees. Journal of Computer and System Sciences, 51:503-510, 1995.
9. O. Maruyama and S. Miyano. Inferring a tree from walks. Theoretical Computer Science, 161:289-300, 1996.
10. J. Lauri and R. Scapellato. Topics in Graph Automorphisms and Reconstruction. Cambridge Univ. Press, 2003.
11. T. Akutsu and D. Fukagawa. Inferring a graph from path frequency. Lecture Notes in Computer Science, 3537:371-392, 2005.
12. T. Akutsu and D. Fukagawa. On inference of a chemical structure from path frequency. Proc. BIOINFO 2005, 96-100, 2005.
13. K. Funatsu and S. Sasaki. 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. Journal of Chemical Information and Computer Sciences, 36:190-204, 1996.
14. A. Korytko, K-P. Schulz, M. S. Madison and M. E. Munk. HOUDINI: a new approach to computer-based structure generation. Journal of Chemical Information and Computer Sciences, 43:1434-1446, 2003.
15. H. Nagamochi. A detachment algorithm for inferring a graph from path frequency. Lecture Notes in Computer Science, 4112:274-283, 2006.