40 search results - page 1 / 8 » Faster subtree isomorphism |
ISTCS
1997
Springer
13 years 9 months ago
1997
Springer
We study the subtree isomorphism problem: Given trees H and G, find a subtree of G which is isomorphic to H or decide that there is no
CPM
2000
Springer
13 years 9 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
CPM
2004
Springer
13 years 10 months ago
2004
Springer
For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) i...
SODA
1996
ACM
13 years 6 months ago
1996
ACM
The Maximum Agreement Subtree problem is the following: given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these i...
POPL
1996
ACM
13 years 9 months ago
1996
ACM
