Identifying consensus of trees through alignment

DOI10.1016/S0020-0255(00)00014-1zbMath0969.68595OpenAlexW1983869386MaRDI QIDQ5938834

Wang, Jason T. L., Zhang, Kaizhong

Publication date: 1 October 2001

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(00)00014-1

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Data structures (68P05)

Related Items

An influence analysis of the number of members on the quality of knowledge in a collective ⋮ A METHOD FOR TEMPORAL KNOWLEDGE INTEGRATION USING INDETERMINATE MODEL OF TIME ⋮ Consensus system for solving conflicts in distributed systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Alignment of trees -- an alternative to tree edit
• A dynamic programming algorithm to find all solutions in a neighborhood of the optimum
• Finding patterns common to a set of strings
• 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
• The Tree-to-Tree Correction Problem
• Approximate Tree Matching in the Presence of Variable Length Don′t Cares
• Exact and approximate algorithms for unordered tree matching

This page was built for publication: Identifying consensus of trees through alignment