When are two qualitative taxonomic characters compatible?

DOI10.1007/BF00275985zbMath0355.92005OpenAlexW2036210254WikidataQ52812468 ScholiaQ52812468MaRDI QIDQ1237438

G. F. Estabrook, Fred R. McMorris

Publication date: 1977

Published in: Journal of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00275985

Mathematics Subject Classification ID

Trees (05C05) Genetics and epigenetics (92D10) General biology and biomathematics (92B05)

Related Items (6)

Closure operations in phylogenetics ⋮ Convex tree realizations of partitions ⋮ The complexity of reconstructing trees from qualitative characters and subtrees ⋮ Efficient algorithms for inferring evolutionary trees ⋮ On the compatibility of binary qualitative taxonomic characters ⋮ On the semilattice of weak orders of a set

Cites Work

• An idealized concept of the true cladistic character
• A mathematical foundation for the analysis of cladistic character compatibility
• An algebraic analysis of cladistic characters
• Unnamed Item
• Unnamed Item

This page was built for publication: When are two qualitative taxonomic characters compatible?