@inbook{afc8ad4ba9bc45558648feac3f2b3e41,

title = "Approximate Labelled Subtree Homeomorphism",

abstract = "Given two undirected trees T and P, the Subtree Homeoraorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as repeatedly removing a degree-2 node and adding the edge joining its two neighbors. In this paper we extend the Subtree Homeomorphism Problem to a new optimization problem by enriching the subtree-comparison with node-to-node similarity scores. The new problem, denoted ALSH (Approximate Labelled Subtree Homeomorphism) is to compute the homeomorphic subtree of T which also maximizes the overall node-to-node resemblance. We describe an O(m2n /log m + mn log n) algorithm for solving ALSH on unordered, unrooted trees, where m and n are the number of vertices in P and T, respectively. We also give an O(mn) algorithm for rooted ordered trees.",

author = "Pinter, {Ron Y.} and Oleg Rokhlenko and Dekel Tsur and Michal Ziv-Ukelson",

year = "2004",

doi = "10.1007/978-3-540-27801-6_5",

language = "English",

isbn = "354022341X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "59--73",

editor = "Sahinalp, {Suleyman Cenk} and S. Muthukrishnan and Ugur Dogrusoz",

booktitle = "Combinatorial Pattern Matching",

address = "Germany",

note = "15th Annual Symposium on Combinatorial Pattern Matching, CPM 2004 ; Conference date: 05-07-2004 Through 07-07-2004",

}