Exact algorithm

exact algorithm

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

Definition

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

• An algorithm for constructing cladograms that is guaranteed to find one or all of the most parsimonious cladograms. Cf. heuristic algorithm. See also branch-and-bound, exhaustive search.

文献（引用）

• Kitching, I. J., Forey, P. L. Humphries, C. J. & Williams, D. M. 1998. Cladistics, 2nd ed.: the Theory and Practice of Parsimony Analysis. -xii + 228 pp. Oxford University Press, New York.

---

広島大学 / デジタル自然史博物館 / 植物 / アルファベット順 / E | 仮名順 にもどる