Correlation Engine 2.0
Clear Search sequence regions

  • archaeal genomes (1)
  • taxa (4)
  • trees (2)
  • Sizes of these terms reflect their relevance to your search.

    We consider the problem of the minimum number of phylogenetic trees it would take to display all splits in a given set, a problem related to k-compatibility. A set of trees that displays every single possible split is termed a universal tree set. In this note, we find the universal incompatibility U(n), the minimal size of a universal tree set for n taxa. By normalising incompatibility using U(n), one can then compare incompatibility of split systems across different numbers of taxa. We demonstrate this application by comparing two SplitsTree networks derived from archaeal genomes, with different numbers of taxa.


    Michael Hendriksen, Nils Kapust. On the Comparison of Incompatibility of Split Systems Across Different Numbers of Taxa. Bulletin of mathematical biology. 2021 May 21;83(7):78

    PMID: 34021420

    View Full Text