6 search results - page 1 / 2 » Approximate Labelled Subtree Homeomorphism |
CPM
2004
Springer
13 years 10 months ago
2004
Springer
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...
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...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
Given a set of leaf-labelled trees with identical leaf sets, the well-known MAST problem consists of finding a subtree homeomorphically included in all input trees and with the la...
CPM
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
TASLP
2008
13 years 4 months ago
2008
Convolution tree kernel has shown promising results in semantic role labeling (SRL). However, this kernel does not consider much linguistic knowledge in kernel design and only perf...