Finding similar consensus between trees: an algorithm and a distance hierarchy
- 1 January 2001
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 34 (1) , 127-137
- https://doi.org/10.1016/s0031-3203(99)00199-5
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- Identifying approximately common substructures in trees based on a restricted edit distanceInformation Sciences, 1999
- Algorithms for the constrained editing distance between ordered labeled trees and related problemsPattern Recognition, 1995
- Retrieval from hierarchical texts by partial patternsPublished by Association for Computing Machinery (ACM) ,1993
- Simple Fast Algorithms for the Editing Distance between Trees and Related ProblemsSIAM Journal on Computing, 1989
- Dictionaries, dictionary grammars and dictionary entry parsingPublished by Association for Computational Linguistics (ACL) ,1989
- THE TREE-TO-TREE EDITING PROBLEMInternational Journal of Pattern Recognition and Artificial Intelligence, 1988
- A Tree System Approach for Fingerprint Pattern RecognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Distance Transform for Images Represented by QuadtreesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- The Tree-to-Tree Correction ProblemJournal of the ACM, 1979
- The tree-to-tree editing problemInformation Processing Letters, 1977