3320 search results - page 6 / 664 » Heuristics for the Phylogeny Problem |
CPM
2006
Springer
13 years 11 months ago
2006
Springer
DAM
1998
13 years 7 months ago
1998
RECOMB
2005
Springer
14 years 8 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
HEURISTICS
2002
13 years 7 months ago
2002
WABI
2009
Springer
14 years 2 months ago
2009
Springer
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...