<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Computational phylogenetics - Page 34 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=computational_phylogenetics&amp;p=33">1.Previous</a><br />
<a accesskey="3" href="page.php?w=computational_phylogenetics&amp;p=35">3.Next</a>
</p>
<p>applied to phylogenetics in the early 1980s. Branch and bound is particularly well suited to phylogenetic tree construction because it inherently requires dividing a problem into a <a href="page.php?w=tree_structure">tree structure</a> as it subdivides the problem space into smaller regions. As its name implies, it requires as input both a branching rule (in the case of phylogenetics, the addition of the next species or sequence to the tree) and a bound (a rule that excludes certain regions of the search space from consideration, thereby assuming</p><p>
<a accesskey="1" href="page.php?w=computational_phylogenetics&amp;p=33">1.Previous</a><br />
<a accesskey="3" href="page.php?w=computational_phylogenetics&amp;p=35">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
