Abstract
Inferring a graph from path frequency has been studied as an important problem which has a potential application to drug design. Given a multiple set g of strings of labels with length at most K, the problem asks to find a vertex-labeled graph G that attains a one-to-one correspondence between g and the set of sequences of labels along all paths of length at most K in G. In this paper, we prove that the problem with K=1 can be formulated as a problem of finding a loopless and connected detachment, based on which an efficient algorithm for solving the problem is derived. Our algorithm also solves the problem with an additional constraint such that every vertex is required to have a specified degree.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akutsu, T., Fukagawa, D.: Inferring a graph from path frequency. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 371–382. Springer, Heidelberg (2005)
Akutsu, T., Fukagawa, D.: On inference of a chemical structure from path frequency. In: Proc. 2005 International Joint Conference of InCoB, AASBi and KSBI (BIOINFO 2005), Busan, Korea, pp. 96–100 (2005)
Bakir, G.H., Zien, A., Tsuda, K.: Learning to find graph pre-images. In: Rasmussen, C.E., Bülthoff, H.H., Schölkopf, B., Giese, M.A. (eds.) DAGM 2004. LNCS, vol. 3175, pp. 253–261. Springer, Heidelberg (2004)
Berg, A.R., Jackson, B., Jordán, T.: Highly edge-connected detachments of graphs and digraphs. J. Graph Theory 43, 67–77 (2003)
Cunningham, W.H.: Improved bounds for matroid partition and intersection algorithms. SIAM J. Computing 15, 948–957 (1986)
Edmonds, J.: Matroids, submodular functions, and certain polyhedra. In: Guy, R.K., Hanani, H., Sauer, N., Schönheim, J. (eds.) Combinatorial Structures and Their Applications, pp. 69–87. Gordon and Breach, New York (1970)
Fukunaga, T., Nagamochi, H.: Eulerian detachments with local-edge-connectivity (submitted to a journal)
Jackson, B., Jordán, T.: Non-separable detachments of graphs. J. Combin. Theory (B) 87, 17–37 (2003)
Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In: Proc. of the 20th Int. Conf. on Machine Learning, pp. 321–328 (2003)
Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Heidelberg (2000)
Nash-Williams, S.J.A.: Connected detachments of graphs and generalised Euler trails. J. Lond. Math. Soc. 31, 17–29 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nagamochi, H. (2006). A Detachment Algorithm for Inferring a Graph from Path Frequency. In: Chen, D.Z., Lee, D.T. (eds) Computing and Combinatorics. COCOON 2006. Lecture Notes in Computer Science, vol 4112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11809678_30
Download citation
DOI: https://doi.org/10.1007/11809678_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36925-7
Online ISBN: 978-3-540-36926-4
eBook Packages: Computer ScienceComputer Science (R0)