Recognizing circular decomposable metrics.
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.
Farach
M
M
Department of Computer Science, Rutgers University, Hill Center for the Mathematical Sciences, Piscataway, New Jersey 08855, USA. farach@cs.rutgers.edu
D000465:Algorithms; D010802:Phylogeny