Finding similar consensus between trees: An algorithm and a distance hierarchy

DOI10.1016/S0031-3203(99)00199-5zbMath0972.68142OpenAlexW2021791566MaRDI QIDQ5926038

Wang, Jason T. L., Zhang, Kaizhong

Publication date: 12 March 2001

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0031-3203(99)00199-5

zbMATH Keywords

dynamic programmingpattern recognition

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (6)

Tai mapping hierarchy for rooted labeled trees through common subforest ⋮ TRACTABLE AND INTRACTABLE VARIATIONS OF UNORDERED TREE EDIT DISTANCE ⋮ A theory of subtree matching and tree kernels based on the edit distance concept ⋮ Selected tree classifier combination based on both accuracy and error diversity ⋮ Homeomorphic alignment of weighted trees ⋮ Homeomorphic Alignment of Edge-Weighted Trees

Cites Work

• Alignment of trees -- an alternative to tree edit
• Comparison of phylogenetic trees
• Finding patterns common to a set of strings
• The tree-to-tree editing problem
• Transducers and repetitions
• Identifying approximately common substructures in trees based on a restricted edit distance
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• An O(n log n) algorithm for finding all repetitions in a string
• Finding approximate patterns in strings
• The Tree-to-Tree Correction Problem
• Efficient algorithms for inferring evolutionary trees

This page was built for publication: Finding similar consensus between trees: An algorithm and a distance hierarchy