Lattice consensus: A partial order on phylogenetic trees that induces an associatively stable consensus method

TL;DR

This paper introduces lattice consensus, a new phylogenetic consensus method based on a partial order that is associatively stable, Pareto on rooted triples, and computationally efficient, with implications for the theory of consensus methods.

Contribution

It proposes lattice consensus, a novel regular, associatively stable consensus method based on a hierarchy-preserving partial order on trees.

Findings

Lattice consensus satisfies associative stability and Pareto on rooted triples.

The partial order on trees is based on hierarchy-preserving maps.

No regular extension stable consensus method exists for binary trees.

Abstract

There is a long tradition of the axiomatic study of consensus methods in phylogenetics that satisfy certain desirable properties. One recently-introduced property is associative stability, which is desirable because it confers a computational advantage, in that the consensus method only needs to be computed "pairwise". In this paper, we introduce a phylogenetic consensus method that satisfies this property, in addition to being "regular". The method is based on the introduction of a partial order on the set of rooted phylogenetic trees, itself based on the notion of a hierarchy-preserving map between trees. This partial order may be of independent interest. We call the method "lattice consensus", because it takes the unique maximal element in a lattice of trees defined by the partial order. Aside from being associatively stable, lattice consensus also satisfies the property of being Pareto on rooted triples, answering in the affirmative a question of Bryant et al (2017). We conclude the paper with an answer to another question of Bryant et al, showing that there is no regular extension stable consensus method for binary trees.