We introduce the guided forest edit distance problem, which measures the similarity of two forests under the guidance of a third forest. We give an efficient algorithm for the problem. Our problem is a natural generalization of many important structure comparison problems such as the forest edit distance problem, constrained sequence alignment problem and the longest constrained common subsequence problem. Our algorithm matches the performance of the best known algorithms for these problems. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Peng, Z., & Ting, H. F. (2007). Guided forest edit distance: Better structure comparisons by using domain-knowledge. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4580 LNCS, pp. 195–204). Springer Verlag. https://doi.org/10.1007/978-3-540-73437-6_21
Mendeley helps you to discover research relevant for your work.