ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS

DOI10.1142/S0129054196000051zbMath0852.68067OpenAlexW2163509192MaRDI QIDQ4888367

Wang, Jason T. L., Dennis Shasha, Zhang, Kaizhong

Publication date: 26 November 1996

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054196000051

zbMATH Keywords

approximate pattern matchingmolecular databases

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Statistical distribution theory (62E99)

Related Items (9)

Tai mapping hierarchy for rooted labeled trees through common subforest ⋮ TRACTABLE AND INTRACTABLE VARIATIONS OF UNORDERED TREE EDIT DISTANCE ⋮ Tree edit distance and maximum agreement subtree ⋮ Space efficient algorithms for ordered tree comparison ⋮ Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees ⋮ Cost and accuracy aware scientific workflow retrieval based on distance measure ⋮ A comparative analysis of multidimensional features of objects resembling sets of graphs ⋮ Finding approximate patterns in undirected acyclic graphs ⋮ Constrained tree inclusion

This page was built for publication: ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS