Recognizing circular decomposable metrics

Martin Farach

    Research output: Contribution to journalArticlepeer-review


    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 languageEnglish (US)
    Pages (from-to)157-162
    Number of pages6
    JournalJournal of Computational Biology
    Issue number2
    StatePublished - 1997

    ASJC Scopus subject areas

    • Modeling and Simulation
    • Molecular Biology
    • Genetics
    • Computational Mathematics
    • Computational Theory and Mathematics


    Dive into the research topics of 'Recognizing circular decomposable metrics'. Together they form a unique fingerprint.

    Cite this