提供: 広島大学デジタル博物館
2015年11月1日 (日) 05:29時点におけるChubo (トーク | 投稿記録)による版 (ページの作成:「=branch-and-bound= *(日本語) * (Español) == Definition == ===Glossary of "Cladistics (2nd ed.)" by Kitching_Forey_Humphries_Williams_1998|Kitching et al. (199...」)
(差分) ← 古い版 | 最新版 (差分) | 新しい版 → (差分)


  • (日本語)
  • (Español)


Glossary of "Cladistics (2nd ed.)" by Kitching et al. (1998)

  • 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 | 仮名順 にもどる