<?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 21 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Computational_phylogenetics&amp;p=20">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Computational_phylogenetics&amp;p=22">3.Next</a>
</p>
<p>is constructed a phylogenetic tree that places closely related sequences under the same <a href="page.php?w=interior_node">interior node</a> and whose branch lengths closely reproduce the observed distances between sequences. Distance-matrix methods may produce either rooted or unrooted trees, depending on the algorithm used to calculate them. They are frequently used as the basis for progressive and iterative types of <a href="page.php?w=multiple_sequence_alignment">multiple sequence alignment</a>s. The main disadvantage of distance-matrix methods</p><p>
<a accesskey="1" href="page.php?w=Computational_phylogenetics&amp;p=20">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Computational_phylogenetics&amp;p=22">3.Next</a>
</p>

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

</card>
</wml>
