- An exact algorithm for cladogram construction. The method begins by constructing a cladogram by means of a heuristic method. The length of this cladogram is used as the initial upper bound for an exhaustive search. The number of topologies to be examined is then restricted by discarding all partial cladograms whose length exceeds the uppoer bound. If a complete cladogram is found that is shorter than the upper bound, then the upper bound is reset to this length in order to increase efficiency further.
広島大学 / デジタル自然史博物館 / 植物 / アルファベット順 / B | 仮名順 にもどる