Inferring a graph from path frequency

Discrete Applied Mathematics

Volumn 160, Issue 10-11, 2012, Pages 1416-1428

  Akutsu, Tatsuya ^a   Fukagawa, Daiji ^b   Jansson, Jesper ^c   Sadakane, Kunihiko ^d  

^a KYOTO UNIVERSITY   (Japan)

^b DOSHISHA UNIVERSITY   (Japan)

^c OCHANOMIZU UNIVERSITY   (Japan)

^d NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

Feature vector; Graph algorithms; Kernel method; Pre image

Indexed keywords

ALPHABET SIZE; BOUNDED DEGREE; DYNAMIC PROGRAMMING ALGORITHM; FEATURE SPACE; FEATURE VECTORS; FIXED SIZE; GRAPH ALGORITHMS; KERNEL METHODS; MAXIMUM DEGREE; POLYNOMIAL-TIME; PRE-IMAGE; PRE-IMAGE PROBLEM; STRONGLY NP-HARD; SUB-STRINGS;

ALGORITHMS; FORESTRY; POLYNOMIAL APPROXIMATION;

TREES (MATHEMATICS);

ALGORITHMS; FORESTRY; PROBLEM SOLVING;

EID: 84859923569     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2012.02.002     Document Type: Article

References (29)

1. T. Akutsu, and D. Fukagawa Inferring a graph from path frequency Proc. 16th Annual Symposium on Combinatorial Pattern Matching Lecture Notes in Computer Science vol. 3537 2005 371 382 (Pubitemid 41422540)
2. T. Akutsu, and D. Fukagawa Inferring a chemical structure from a feature vector based on frequency of labeled paths and small fragments Proc. 5th Asia-Pacific Bioinformatics Conference 2007 Imperial College Press London 165 174
3. 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 1995 503 510
4. G.H. Bakir, J. Weston, and B. Schlkopf Learning to find pre-images Advances in Neural Information Processing Systems 16 2004 449 456
5. G.H. Bakir, A. Zien, and K. Tsuda Learning to find graph pre-images Proc. the 26th DAGM Symposium Lecture Notes in Computer Science vol. 3175 2004 253 261
6. C. Cortes, M. Mohri, J. Weston, A general regression technique for learning transductions, in: Proc. 22nd International Conference on Machine Learning, 2005, pp. 153-160. (Pubitemid 43183328)
7. C. Cortes, M. Mohri, and J. Weston A general regression framework for learning string-to-string mappings Bakir Predicting Structured Data 2007 The MIT Press 143 168
8. C. Cortes, and V. Vapnik Support vector networks Machine Learning 20 1995 273 297
9. Y. Dinitz, A. Itai, and M. Rodeh On an algorithm of Zemlyachenko for subtree isomorphism Information Processing Letters 70 1999 141 146
10. H. Fujiwara, J. Wang, L. Zhao, H. Nagamochi, and T. Akutsu Enumerating tree-like chemical graphs with given path frequency Journal of Chemical Information and Modeling 48 2008 1345 1357
11. M.R. Garey, and D.S. Johnson Computers and Intractability. A Guide to the Theory of NP-Completeness 1979 W.H. Freeman and Co. New York
12. T. Grtner, P.A. Flach, S. Wrobel, On graph kernels: hardness results and efficient alternatives, in: Proc. 16th Annual Conference on Computational Learning Theory and 7th Kernel Workshop, 2003, pp. 129-143. (Pubitemid 37053200)
13. Y. Hizukuri, Y. Yamanishi, O. Nakamura, F. Yagi, S. Goto, and M. Kanehisa Extraction of leukemia specific glycan motifs in humans by computational glycomics Carbohydrate Research 340 2005 2270 2278 (Pubitemid 41267006)
14. Y. Ishida, Y. Kato, L. Zhao, H. Nagamochi, and T. Akutsu Branch-and-bound algorithms for enumerating treelike chemical graphs with given path frequency using detachment-cut Journal of Chemical Information and Modeling 50 2010 934 946
15. H. Kashima, K. Tsuda, A. Inokuchi, Marginalized kernels between labeled graphs, in: Proc. 20th International Conference on Machine Learning, 2003, pp. 321-328.
16. J. Lauri, and R. Scapellato Topics in Graph Automorphisms and Reconstruction 2003 Cambridge University Press London, UK
17. C. Leslie, E. Eskin, W.S. Noble, The spectrum kernel: a string kernel for SVM protein classification, in: Proc. Pacific Symposium on Biocomputing 2002, 2002, pp. 564-575.
18. P. Mahé, N. Ueda, T. Akutsu, J.-L. Perret, J.-P. Vert, Extensions of marginalized graph kernels, in: Proc. 21st International Conference on Machine Learning, 2004, pp. 552-559. (Pubitemid 40290852)
19. O. Maruyama, and S. Miyano Inferring a tree from walks Theoretical Computer Science 161 1996 289 300 (Pubitemid 126412760)
20. R.B. Nachbar Molecular evolution: automated manipulation of hierarchical chemical topology and its application to average molecular structures Genetic Programming and Evolvable Machines 1 2000 57 94
21. H. Nagamochi A detachment algorithm for inferring a graph from path frequency Algorithmica 53 2009 207 224
22. P.A. Pevzner Computational Molecular Biology. An Algorithmic Approach 2000 The MIT Press MA
23. V. Raghavan Bounded degree graph inference from walks Journal of Computer and System Sciences 49 1994 108 132 (Pubitemid 124013310)
24. B. Schlkopf, K. Tsuda, and J.-P. Vert Kernel Methods in Computational Biology 2004 The MIT Press MA
25. J. Shawe-Taylor, and N. Cristianini Kernel Methods for Pattern Analysis 2004 Cambridge Univ. Press Cambridge, UK
26. N. Shervashidze, and K. Borgwardt Fast subtree kernels on graphs Advances in Neural Information Processing Systems 22 2009 1660 1668
27. L. Song, X. Zhang, A. Smola, A. Gretton, B. Schlkpf, Tailoring density estimation via reproducing kernel moment matching, in: Proc. 25th International Conference on Machine Learning, 2008, pp. 992-999.
28. H.M. Vinkers, M.R. de Jonge, F.F.D. Daeyaert, J. Heeres, L.M.H. Koymans, J.H. van Lenthe, P.J. Lewi, H. Timmerman, K. van Aken, and P.A.J. Janssen Synopsis: synthesize and optimize system in silico Journal of Medicinal Chemistry 46 1993 2765 2773
29. X. Zhang, L. Song, A. Gretton, and A.J. Smola Kernel measures of independence for non-iid data Advances in Neural Information Processing Systems 21 2008 1937 1944