Sciweavers

371 search results - page 29 / 75
» Algorithms for phylogenetic footprinting
Sort
View
JCB
2006
124views more  JCB 2006»
13 years 9 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
14 years 3 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»
13 years 10 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»
13 years 9 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
BMEI
2008
IEEE
14 years 4 months ago
A New Approach for Tree Alignment Based on Local Re-Optimization
Multiple sequence alignment is the most fundamental task in bioinformatics and computational biology. In this paper, we present a new algorithm to conduct multiple sequences align...
Feng Yue, Jijun Tang