Faster Greedy Consensus Trees

03/01/2020

∙

by   Pongsaphol Pongsawakul, et al.

∙

0

∙

share

We consider the tree consensus problem, an important problem in bioinformatics. Gawrychowski, Landau, Sung, and Weimann [ICALP'18] devise a greedy algorithm that runs in time O(n^1.5log n) based on micro-macro decomposition. We give a faster algorithm that runs in time O(nlog n). Our key ingredient is a bipartition compatibility criteria based on amortized-time leaf counters.