Sciweavers

1594 search results - page 196 / 319
» Fast Prediction on a Tree
Sort
View
BMCBI
2006
92views more  BMCBI 2006»
14 years 10 months ago
Recrafting the neighbor-joining method
Background: The neighbor-joining method by Saitou and Nei is a widely used method for constructing phylogenetic trees. The formulation of the method gives rise to a canonical (n3)...
Thomas Mailund, Gerth Stølting Brodal, Rolf...
115
Voted
JCB
2006
124views more  JCB 2006»
14 years 10 months ago
The Average Common Substring Approach to Phylogenomic Reconstruction
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
Igor Ulitsky, David Burstein, Tamir Tuller, Benny ...
BMCBI
2005
134views more  BMCBI 2005»
14 years 10 months ago
Ancestral sequence alignment under optimal conditions
Background: Multiple genome alignment is an important problem in bioinformatics. An important subproblem used by many multiple alignment approaches is that of aligning two multipl...
Alexander K. Hudek, Daniel G. Brown 0001
ICML
2005
IEEE
15 years 11 months ago
Closed-form dual perturb and combine for tree-based models
This paper studies the aggregation of predictions made by tree-based models for several perturbed versions of the attribute vector of a test case. A closed-form approximation of t...
Pierre Geurts, Louis Wehenkel
ICMCS
2005
IEEE
133views Multimedia» more  ICMCS 2005»
15 years 3 months ago
Error resilience and error concealment for embedded wavelet coders
This paper presents an error-resilient coding technique combined with error concealment for embedded wavelet coders. The coded images are partitioned into packets and protected by...
Shih-Hsuan Yang, Po-Feng Cheng