Algorithms for approximate graph matching
- 1 January 1995
- journal article
- Published by Elsevier in Information Sciences
- Vol. 82 (1-2) , 45-74
- https://doi.org/10.1016/0020-0255(94)00057-i
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- An Improved Algorithm For Approximate String MatchingSIAM Journal on Computing, 1990
- Computational approaches to discovering semantics in molecular biologyProceedings of the IEEE, 1989
- Fast parallel and serial approximate string matchingJournal of Algorithms, 1989
- The synthesis of 2-pyrimidinone nucleosides and their incorporation into oligodeoxynucleotidesNucleic Acids Research, 1989
- A Learning Algorithm for Boltzmann Machines*Cognitive Science, 1985
- A Tree-Matching Algorithm Based on Node Splitting and MergingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Optimization by Simulated AnnealingScience, 1983
- The Noisy Substring Matching ProblemIEEE Transactions on Software Engineering, 1983
- An effective algorithm for string correction using generalized edit distance—II. Computational complexity of the algorithm and some applicationsInformation Sciences, 1981
- An effective algorithm for string correction using generalized edit distances—I. Description of the algorithm and its optimalityInformation Sciences, 1981