Sciweavers

44 search results - page 1 / 9
» On the Repeat-Annotated Phylogenetic Tree Reconstruction Pro...
Sort
View
45
Voted
JCB
2006
80views more  JCB 2006»
14 years 9 months ago
On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem
Firas Swidan, Michal Ziv-Ukelson, Ron Y. Pinter
CPM
2004
Springer
84views Combinatorics» more  CPM 2004»
15 years 2 months ago
Small Phylogeny Problem: Character Evolution Trees
Abstract. Phylogenetics is a science of determining connections between groups of organisms in terms of ancestor/descendent relationships, usually expressed by phylogenetic trees, ...
Arvind Gupta, Ján Manuch, Ladislav Stacho, ...
ICNC
2005
Springer
15 years 2 months ago
Local Search for the Maximum Parsimony Problem
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
76
Voted
STOC
2006
ACM
129views Algorithms» more  STOC 2006»
15 years 9 months ago
Optimal phylogenetic reconstruction
One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...
Constantinos Daskalakis, Elchanan Mossel, Sé...
80
Voted
MFCS
2005
Springer
15 years 2 months ago
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix
Abstract. Given a distance matrix M that specifies the pairwise evolutionary distances between n species, the phylogenetic tree reconstruction problem asks for an edge-weighted ph...
Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Mi...