Alignment of trees -- an alternative to tree edit
From MaRDI portal
Publication:673642
DOI10.1016/0304-3975(95)80015-8zbMath0873.68150MaRDI QIDQ673642
Zhang, Kaizhong, Lusheng Wang, Tao Jiang
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)80015-8
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
Finding similar consensus between trees: An algorithm and a distance hierarchy, Identifying consensus of trees through alignment, On the complexity of comparing evolutionary trees, A survey on tree edit distance and related problems, A similarity measure for graphs with low computational complexity, Comparing similar ordered trees in linear-time, Space efficient algorithms for ordered tree comparison, Computational methods in noncoding RNA research, Average complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of an RNA secondary structure alignment algorithm, Comparing trees via crossing minimization, Selected tree classifier combination based on both accuracy and error diversity, Data mining in an engineering design environment: OR applications from graph matching, An algebraic view of the relation between largest common subtrees and smallest common supertrees, Decomposition algorithms for the tree edit distance problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Optimization, approximation, and complexity classes
- On the editing distance between unordered labeled trees
- Some MAX SNP-hard results concerning unordered labeled trees
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Threshold decomposition of gray-scale morphology into binary morphology
- A Tree-to-Tree Distance and Its Application to Cluster Analysis
- The Tree-to-Tree Correction Problem
