title: Recognizing circular decomposable metrics.
abstract: Circular decomposable metrics (CDMs) have been used in phylogenetic studies. The fastest algorithm for recognizing a CDM runs in time O(n5), given an n x n table of pairwise distances. We give an O(n2) time algorithm for this problem.
authors.affiliation: Department of Computer Science, Rutgers University, Hill Center for the Mathematical Sciences, Piscataway, New Jersey 08855, USA. farach@cs.rutgers.edu
authors.forename: M
authors.initials: M
authors.lastname: Farach
mesh_terms: D000465:Algorithms; D010802:Phylogeny