Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\) (Q1889603)

From MaRDI portal
Revision as of 21:28, 28 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\)
scientific article

    Statements

    Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\) (English)
    0 references
    0 references
    0 references
    0 references
    2 December 2004
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references