On the editing distance between undirected acyclic graphs and related problems
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 395-407
- https://doi.org/10.1007/3-540-60044-2_58
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Query primitives for tree-structured dataPublished by Springer Nature ,1994
- Antiulcer agents. 5. Inhibition of gastric H+/K+-ATPase by substituted imidazo[1,2-a]pyridines and related analogs and its implication in modeling the high affinity potassium ion binding site of the gastric proton pump enzymeJournal of Medicinal Chemistry, 1991
- An Improved Algorithm For Approximate String MatchingSIAM Journal on Computing, 1990
- Use of techniques derived from graph theory to compare secondary structure motifs in proteinsJournal of Molecular Biology, 1990
- Faster Scaling Algorithms for Network ProblemsSIAM Journal on Computing, 1989
- Fast parallel and serial approximate string matchingJournal of Algorithms, 1989
- Generalized String MatchingSIAM Journal on Computing, 1987
- Efficient Implementation Of Graph Algorithms Using ContractionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- An effective algorithm for string correction using generalized edit distances—I. Description of the algorithm and its optimalityInformation Sciences, 1981
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980