Abstract
ABSTRACT
Circular decomposable metrics (CDMs) have been used in phylogenetic studies. The fastest algorithm for recognizing a CDM runs in time 0(n5), given an n × n table of pairwise distances. We give an 0(n2) time algorithm for this problem.
Get full access to this article
View all access options for this article.