On the compatibility of binary qualitative taxonomic characters
From MaRDI portal
Publication:1237657
DOI10.1007/BF02462853zbMATH Open0356.92003OpenAlexW2053407986WikidataQ52820016 ScholiaQ52820016MaRDI QIDQ1237657FDOQ1237657
Publication date: 1977
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02462853
Cites Work
Cited In (6)
- Median graphs and tree analysis of dichotomous data, an approach to qualitative factor analysis
- The complexity of reconstructing trees from qualitative characters and subtrees
- Efficient algorithms for inferring evolutionary trees
- On the semilattice of weak orders of a set
- Two strikes against perfect phylogeny
- A probability measure for character compatibility
This page was built for publication: On the compatibility of binary qualitative taxonomic characters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1237657)