Sciweavers

4759 search results - page 4 / 952
» Parallelizing the Phylogeny Problem
Sort
View
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 9 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
CPM
2004
Springer
84views Combinatorics» more  CPM 2004»
13 years 11 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, ...
RECOMB
2007
Springer
13 years 12 months ago
Parts of the Problem of Polyploids in Rearrangement Phylogeny
Abstract. Genome doubling simultaneously doubles all genetic markers. Genome rearrangement phylogenetics requires that all genomes analyzed have the same set of orthologs, so that ...
Chunfang Zheng, Qian Zhu, David Sankoff
ICDT
2010
ACM
141views Database» more  ICDT 2010»
13 years 10 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller