| Literature DB >> 9228614 |
M Farach1.
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.Entities:
Mesh：
Year: 1997 PMID： 9228614 DOI： 10.1089/cmb.1997.4.157
Source DB: PubMed Journal: J Comput Biol ISSN： 1066-5277 Impact factor: 1.479