Sciweavers

440 search results - page 27 / 88
» Comparison of Galled Trees
Sort
View
AAAI
2010
13 years 10 months ago
Genome Rearrangement: A Planning Approach
Evolutionary trees of species can be reconstructed by pairwise comparison of their entire genomes. Such a comparison can be quantified by determining the number of events that cha...
Tansel Uras, Esra Erdem
AIPS
2010
13 years 7 months ago
Genome Rearrangement and Planning: Revisited
Evolutionary trees of species can be reconstructed by pairwise comparison of their entire genomes. Such a comparison can be quantified by determining the number of events that ch...
Tansel Uras, Esra Erdem
ICDIM
2007
IEEE
14 years 3 months ago
Pattern-based decision tree construction
Learning classifiers has been studied extensively the last two decades. Recently, various approaches based on patterns (e.g., association rules) that hold within labeled data hav...
Dominique Gay, Nazha Selmaoui, Jean-Françoi...
ICALP
2000
Springer
14 years 9 days ago
An Optimal Minimum Spanning Tree Algorithm
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
Seth Pettie, Vijaya Ramachandran
CSDA
2007
148views more  CSDA 2007»
13 years 8 months ago
Classifying densities using functional regression trees: Applications in oceanology
The problem of building a regression tree is considered when the response variable is a probability density function. Splitting criteria which are well adapted to measure the diss...
David Nerini, Badih Ghattas