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.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1089/cmb.1997.4.157 | DOI Listing |
Publication Analysis
Top Keywords
circular decomposable
8
decomposable metrics
8
recognizing circular
4
metrics circular
4
metrics cdms
4
cdms phylogenetic
4
phylogenetic studies
4
studies fastest
4
fastest algorithm
4
algorithm recognizing
4
Similar Publications
Want AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!