Melzak algorithm for phylogenetic spaces (Q1405934)

From MaRDI portal
Revision as of 03:14, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Melzak algorithm for phylogenetic spaces
scientific article

    Statements

    Melzak algorithm for phylogenetic spaces (English)
    0 references
    0 references
    0 references
    0 references
    8 September 2003
    0 references
    The authors present an algorithm for constructing a minimal tree \(\Gamma\) of given topology \(G\) involving a finite subset \(N=\{\beta_1,\dots,\beta_n\}\) of a phylogenetic space. The algorithm velocity is of order of \(2^n| \beta_1| \cdots| \beta_n| \), where \(| \beta| \) is a length of the word \(\beta\). An algorithm for constructing the Simpson-Torrichelli point for the set \(N\) is obtained as a corollary as well as an algorithm for constructing a minimal Steiner tree for a three-point set.
    0 references
    phylogenetic space
    0 references
    Melzak algorithm
    0 references

    Identifiers