Combinatorial views on persistent characters in phylogenetics (Q2182613): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Mathematica / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3023714558 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1802.02520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The binary perfect phylogeny with persistent characters / rank
 
Normal rank
Property / cites work
 
Property / cites work: A colored graph approach to perfect phylogeny with persistent characters / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem in phylogeny is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phylogeny / rank
 
Normal rank

Latest revision as of 17:55, 22 July 2024

scientific article
Language Label Description Also known as
English
Combinatorial views on persistent characters in phylogenetics
scientific article

    Statements

    Combinatorial views on persistent characters in phylogenetics (English)
    0 references
    0 references
    0 references
    26 May 2020
    0 references
    persistent characters
    0 references
    maximum parsimony
    0 references
    Fitch algorithm
    0 references
    tree balance
    0 references
    sackin index
    0 references
    \(X\)-splits
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references