Inferring a graph from path frequency

Authors:
Tatsuya Akutsu;Daiji Fukagawa
Affiliations:
Bioinformatics Center, Institute for Chemical Research, Kyoto University, Kyoto, Japan;Graduate School of Informatics, Kyoto University, Kyoto, Japan
Venue:
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Year:
2005

Citing 9
Cited 6

Bounded degree graph inference from walks

Journal of Computer and System Sciences
An O(n log log n) time algorithm for constructing a graph of maximum connectivity with prescribed degrees

Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Support-Vector Networks

Machine Learning
Inferring a tree from walks

Theoretical Computer Science
On an algorithm of Zemlyachenko for subtree isomorphism

Information Processing Letters
An introduction to support Vector Machines: and other kernel-based learning methods

An introduction to support Vector Machines: and other kernel-based learning methods
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Molecular Evolution: Automated Manipulation of Hierarchical Chemical Topology and Its Application to Average Molecular Structures

Genetic Programming and Evolvable Machines
Extensions of marginalized graph kernels

ICML '04 Proceedings of the twenty-first international conference on Machine learning

An efficient algorithm for generating colored outerplanar graphs

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Note: Absoluteness of subword inequality is undecidable

Theoretical Computer Science
A detachment algorithm for inferring a graph from path frequency

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Balanced multi-process parallel algorithm for chemical compound inference with given path frequencies

ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Inferring a graph from path frequency

Discrete Applied Mathematics
On computational complexity of graph inference from counting

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of inferring a graph (and a sequence) from the numbers of occurrences of vertex-labeled paths, which is closely related to the pre-image problem for graphs in machine learning: to reconstruct a graph from its feature space representation. We show that this problem can be solved in polynomial time in the size of an output graph if graphs are trees of bounded degree and the lengths of given paths are bounded by a constant. On the other hand, we show that this problem is strongly NP-hard even for planar graphs of bounded degree.