179 search results - page 24 / 36 » An Optimal Decomposition Algorithm for Tree Edit Distance |
150
click to vote
SSPR
2004
Springer
15 years 10 months ago
2004
Springer
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
138
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
176
click to vote
ISBRA
2009
Springer
16 years 15 hour ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
143
click to vote
CIBCB
2007
IEEE
15 years 9 months ago
2007
IEEE
-- A large and reliable DNA codeword library is the key to the success of DNA based computing. Searching for the set of reliable DNA codewords is an NP-hard problem, which can take...
131
click to vote
ISAAC
2007
Springer
15 years 11 months ago
2007
Springer
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...