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.
- 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.