<?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="Cladogram - Page 14 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=cladogram&amp;p=13">1.Previous</a><br />
<a accesskey="3" href="page.php?w=cladogram&amp;p=15">3.Next</a>
</p>
<p>called a distance) to measure how consistent a candidate cladogram is with the data. Most cladogram algorithms use <a href="page.php?w=Optimization_%28mathematics%29">mathematical optimization</a>. The <a href="page.php?w=Computational_problem">computational problem</a> to be solved is the minimization of the metric.</p>

<p>Some algorithms are useful only for molecular characteristic data, others only for morphological data, and some only for characteristic data incorporating both. Algorithms for cladograms or phylogenetic trees include <a href="page.php?w=least_squares">least squares</a>,</p><p>
<a accesskey="1" href="page.php?w=cladogram&amp;p=13">1.Previous</a><br />
<a accesskey="3" href="page.php?w=cladogram&amp;p=15">3.Next</a>
</p>

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

</card>
</wml>
