Sciweavers

11 search results - page 1 / 3
» Approximating Subtree Distances Between Phylogenies
Sort
View
JDA
2008
60views more  JDA 2008»
13 years 5 months ago
A 3-approximation algorithm for the subtree distance between phylogenies
Magnus Bordewich, Catherine McCartin, Charles Semp...
JCB
2006
82views more  JCB 2006»
13 years 5 months ago
Approximating Subtree Distances Between Phylogenies
Maria Luisa Bonet, Katherine St. John, Ruchi Mahin...
CPM
2000
Springer
136views Combinatorics» more  CPM 2000»
13 years 9 months ago
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
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...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...
EUROGP
2005
Springer
107views Optimization» more  EUROGP 2005»
13 years 11 months ago
Operator-Based Distance for Genetic Programming: Subtree Crossover Distance
Abstract. This paper explores distance measures based on genetic operators for genetic programming using tree structures. The consistency between genetic operators and distance mea...
Steven M. Gustafson, Leonardo Vanneschi
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
14 years 5 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...