3 search results - page 1 / 1 » A Lower Bound for the Breakpoint Phylogeny Problem |
CPM
2000
Springer
13 years 8 months ago
2000
Springer
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...
RECOMB
2005
Springer
14 years 5 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...
CPM
2000
Springer
13 years 9 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...