A similarity measure for graphs with low computational complexity

We present and analyze an algorithm to measure the structural similarity of generalized trees, a new graph class which includes rooted trees. For this, we represent structural properties of graphs as strings and define the similarity of two graphs as optimal alignments of the corresponding property stings. We prove that the obtained graph similarity measures are so called Backward similarity measures. From this we find that the time complexity of our algorithm is polynomial and, hence, significantly better than the time complexity of classical graph similarity methods based on isomorphic relations.

[1]  Matthias Dehmer,et al.  Classification of Large Graphs by a Local Tree Decomposition , 2005, DMIN.

[2]  H. Bunke.  Graph Matching : Theoretical Foundations , Algorithms , and Applications , 2022 .

[3]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[4]  Frieder Kaden,et al.  Graphmetriken und Isometrieprobleme zugehöriger Distanzgraphen , 1986 .

[5]  Kaizhong Zhang,et al.  On the Editing Distance Between Unordered Labeled Trees , 1992, Inf. Process. Lett..

[6]  Lusheng Wang,et al.  Alignment of trees: an alternative to tree edit , 1995 .

[7]  Robert Giegerich,et al.  Local similarity in RNA secondary structures , 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.

[8]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[9]  Kuo-Chung Tai,et al.  The Tree-to-Tree Correction Problem , 1979, JACM.

[10]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[11]  Alexander Mehler,et al.  Web corpus mining by instance of Wikipedia , 2006 .

[12]  Dan Gusfield,et al.  Algorithms on strings , 1997 .

[13]  David Sankoff,et al.  Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison , 1983 .

[14]  Bohdan Zelinka,et al.  On a certain distance between isomorphism classes of graphs , 1975 .

[15]  Lusheng Wang,et al.  Parametric alignment of ordered trees , 2003, Bioinform..

[16]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[17]  Horst Bunke,et al.  Recent developments in graph matching , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[18]  Thomas Lengauer,et al.  An Algorithm for Finding Maximal Common Subtopologies in a Set of Protein Structures , 1996, J. Comput. Biol..

[19]  Eiichi Tanaka,et al.  The Tree-to-Tree Editing Problem , 1988, Int. J. Pattern Recognit. Artif. Intell..

[20]  Alexander Mehler,et al.  Hierarchical Orderings of Textual Units , 2002, COLING.

[21]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[22]  Alexander Mehler,et al.  Towards Logical Hypertext Structure A Graph-Theoretic Perspective , 2006 .

[23]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[24]  Alexander Mehler,et al.  Towards Logical Hypertext Structure , 2004, IICS.