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.
| Original language | American English |
|---|---|
| Pages (from-to) | 157-162 |
| Number of pages | 6 |
| Journal | Journal of Computational Biology |
| Volume | 4 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1997 |
ASJC Scopus subject areas
- Modeling and Simulation
- Molecular Biology
- Genetics
- Computational Mathematics
- Computational Theory and Mathematics