Sciweavers

347 search results - page 45 / 70
» Visualising phylogenetic trees
Sort
View
BMCBI
2010
110views more  BMCBI 2010»
15 years 2 months ago
Discovering local patterns of co - evolution: computational aspects and biological examples
Background: Co-evolution is the process in which two (or more) sets of orthologs exhibit a similar or correlative pattern of evolution. Co-evolution is a powerful way to learn abo...
Tamir Tuller, Yifat Felder, Martin Kupiec
GECCO
2004
Springer
211views Optimization» more  GECCO 2004»
15 years 7 months ago
Node-Depth Encoding for Evolutionary Algorithms Applied to Network Design
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
Alexandre C. B. Delbem, André Carlos Ponce ...
BMCBI
2010
104views more  BMCBI 2010»
14 years 9 months ago
A systematic study of genome context methods: calibration, normalization and combination
Background: Genome context methods have been introduced in the last decade as automatic methods to predict functional relatedness between genes in a target genome using the patter...
Luciana Ferrer, Joseph M. Dale, Peter D. Karp
AB
2008
Springer
15 years 3 months ago
The Geometry of the Neighbor-Joining Algorithm for Small Trees
In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstr...
Kord Eickmeyer, Ruriko Yoshida
TCBB
2008
107views more  TCBB 2008»
15 years 1 months ago
Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...