On the editing distance between undirected acyclic graphs and related problems

  • Kaizhong Zhang
  • Jason T. L. Wang
  • Dennis Shasha
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 937)

Abstract

Using these simple, efficient algorithms, a user can submit a query structure and obtain those data structures approximately matching the query. To our knowledge, this work gives the first polynomial time algorithm ever presented to solve the edit distance problem between undirected acyclie graphs. We will have this algorithm implemented within a few months and will make it available to the community.

Keywords

Edit Distance Edit Operation Mapping Line Limited Graph Unordered Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    K. Abrahamson. Generalized string matching. SIAM J. Comput., 16:1039–1051, 1987.CrossRefGoogle Scholar
  2. 2.
    J. E. Ash, P. A. Chubb, S. E. Ward, S. M. Welford, and P. Willett. Communication, Storage and Retrieval of Chemical Information. Ellis Horwood, Chichester, England, 1985.Google Scholar
  3. 3.
    J. E. Ash and E. Hyde, editors. Chemical Information Systems. Ellis Horwood, Chichester, England, 1975.Google Scholar
  4. 4.
    H. N. Gabow, Z. Galil, and T. H. Spencer. Efficient implementation of graph algorithms using contraction. In Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, pages 347–357, 1984.Google Scholar
  5. 5.
    H. N. Gabow and R. E. Tarjan. Faster scaling algorithms for network problems. SIAM J. Comput., 18(5):1013–1036, 1989.CrossRefGoogle Scholar
  6. 6.
    Z. Galil and K. Park. An improved algorithm for approximate string matching. SIAM J. Comput., 19(6):989–999, Dec. 1990.CrossRefGoogle Scholar
  7. 7.
    M. A. Johnson and G. M. Maggiora, editors. Concepts and Applications of Molecular Similarity. Wiley, New York, 1990.Google Scholar
  8. 8.
    J. Kaminski, B. Wallmark, C. Briving, and B.-M. Andersson. Antiulcer agents. 5. inhibition of gastric H+/K+-ATPase by substituted imidazo[1,2-a]pyridines and related analogues and its implication in modeling the high affinity potassium ion binding site of the gastric proton pump enzyme. Journal of Medicinal Chemistry, 34:533–541, 1991.PubMedGoogle Scholar
  9. 9.
    R. L. Kashyap and B. J. Oommen. An effective algorithm for string correction using a generalized edit distance — I. Description of the algorithm and its optimality. Information Sci., 23(2):123–142, 1981.Google Scholar
  10. 10.
    P. Kilpelainen and H. Mannila. Query primitives for tree-structured data. In M. Crochemore and D. Gusfield, editors, Combinatorial Pattern Matching, Lecture Notes in Computer Science, 807, pages 213–225. Springer-Verlag, 1994.Google Scholar
  11. 11.
    G. M. Landau and U. Vishkin. Fast parallel and serial approximate string matching. Journal of Algorithms, 10(2):157–169, 1989.Google Scholar
  12. 12.
    Y. C. Martin, M. G. Bures, and P. Willett. Searching databases of three-dimensional structures. In K. B. Lipkowitz and D. D. Boyd, editors, Reviews in Computational Chemistry, pages 213–263. VCH Publishers, New York, 1990.Google Scholar
  13. 13.
    W. J. Masek and M. S. Paterson. A faster algorithm for computing string editing distances. J. Comput. System Sci., 20:18–31, 1980.CrossRefGoogle Scholar
  14. 14.
    E. M. Mitchell, P. J. Artymiuk, D. W. Rice, and P. Willett. Use of techniques derived from graph theory to compare secondary structure motifs in proteins. Journal of Molecular Biology, 212:151–166, 1989.Google Scholar
  15. 15.
    A. S. Noetzel and S. M. Selkow. An analysis of the general tree-editing problem. In D. Sankoff and J. B. Kruskal, editors, Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, pages 237–252. Addison-Wesley, Reading, MA, 1983.Google Scholar
  16. 16.
    P. A. Pevzner and M. S. Waterman. A fast filtration algorithm for the substring matching problem. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Combinatorial Pattern Matching, Lecture Notes in Computer Science, 684, pages 197–214. Springer-Verlag, 1993.Google Scholar
  17. 17.
    S. M. Selkow. The tree-to-tree editing problem. Information Processing Letters, 6(6):184–186, Dec. 1977.Google Scholar
  18. 18.
    D. Shasha, J. T. L. Wang, K. Zhang, and F. Y. Shih. Exact and approximate algorithms for unordered tree matching. IEEE Transactions on Systems, Man and Cybernetics, 24(4):668–678, April 1994.Google Scholar
  19. 19.
    K.-C. Tai. The tree-to-tree correction problem. J. ACM, 26(3):422–433, 1979.Google Scholar
  20. 20.
    E. Ukkonen. Finding approximate patterns in strings. Journal of Algorithms, 6:132–137, 1985.Google Scholar
  21. 21.
    E. Ukkonen. Approximate string-matching over suffix trees. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Proc. of the 4th Annual Symposium on Combinatorial Pattern Matching, pages 228–242. Lecture Notes in Computer Science, 684, Springer-Verlag, 1993.Google Scholar
  22. 22.
    R. A. Wagner and M. J. Fischer. The string-to-string correction problem. J. ACM, 21(1):168–173, Jan. 1974.CrossRefGoogle Scholar
  23. 23.
    W. E. Warr. Chemical Structures. Springer-Verlag, Berlin, 1988.Google Scholar
  24. 24.
    P. Willett. Similarity and Clustering Methods in Chemical Information Systems. Research Studies Press, Letchworth, 1987.Google Scholar
  25. 25.
    P. Willett. Algorithms for the calculation of similarity in chemical structure databases. In M. A. Johnson and G. M. Maggiora, editors, Concepts and Applications of Molecular Similarity, pages 43–61. John Wiley & Sons, Inc., 1990.Google Scholar
  26. 26.
    S. Wu and U. Manber. Fast text searching allowing errors. Communications of the ACM, 35(10):83–91, Oct. 1992.Google Scholar
  27. 27.
    K. Zhang. The Editing Distance between Trees: Algorithms and Applications. PhD thesis, Courant Institute of Mathematical Sciences, New York University, 1989.Google Scholar
  28. 28.
    K. Zhang. A new editing based distance between unordered labeled trees. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Combinatorial Pattern Matching, Lecture Notes in Computer Science, 684, pages 254–265. Springer-Verlag, 1993; journal version is to appear in Algorithmica.Google Scholar
  29. 29.
    K. Zhang and D. Shasha. Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput., 18(6):1245–1262, Dec. 1989.CrossRefGoogle Scholar
  30. 30.
    K. Zhang, D. Shasha, and J. T. L. Wang. Approximate tree matching in the presence of variable length don't cares. Journal of Algorithms, 16(1):33–66, Jan. 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Kaizhong Zhang
    • 1
  • Jason T. L. Wang
    • 2
  • Dennis Shasha
    • 3
  1. 1.Department of Computer ScienceThe University of Western OntarioLondonCanada
  2. 2.Department of CISNew Jersey Institute of TechnologyNewarkUSA
  3. 3.Courant Institute of Mathematical SciencesNew York UniversityNew YorkUSA

Personalised recommendations