Sciweavers

293 search results - page 32 / 59
» Fixed-Parameter Algorithms in Phylogenetics
Sort
View
RECOMB
2009
Springer
15 years 6 months ago
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep
Abstract Constantinos Daskalakis1 , Elchanan Mossel2, , and Sebastien Roch1 1 Microsoft Research 2 UC Berkeley and Weizman Institute We introduce a new phylogenetic reconstruction ...
Constantinos Daskalakis, Elchanan Mossel, Sé...
JCB
2006
124views more  JCB 2006»
14 years 11 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 ...
EVOW
2005
Springer
15 years 5 months ago
On the Application of Evolutionary Algorithms to the Consensus Tree Problem
Computing consensus trees amounts to finding a single tree that summarizes a collection of trees. Three evolutionary algorithms are defined for this problem, featuring characteri...
Carlos Cotta
BMCBI
2010
135views more  BMCBI 2010»
14 years 12 months ago
MrsRF: an efficient MapReduce algorithm for analyzing large collections of evolutionary trees
Background: MapReduce is a parallel framework that has been used effectively to design largescale parallel applications for large computing clusters. In this paper, we evaluate th...
Suzanne Matthews, Tiffani L. Williams
TCBB
2008
73views more  TCBB 2008»
14 years 11 months ago
Nature Reserve Selection Problem: A Tight Approximation Algorithm
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
Magnus Bordewich, Charles Semple