When two trees go to war (Q2261656): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2161063454 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1004.5332 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q37806392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the number of hybridisation events for a consistent evolutionary history / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the minimum number of hybridization events for a consistent evolutionary history / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing phylogenetic diversity across two trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research in Computational Molecular Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring a level-1 phylogenetic network from a dense set of rooted triplets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seeing the trees and their branches in the network is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymmetric median tree. --- A new model for building consensus trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing the simplest possible phylogenetic network from triplets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new recombination lower bound and the minimum perfect phylogenetic forest problem / rank
 
Normal rank

Latest revision as of 19:07, 9 July 2024

scientific article
Language Label Description Also known as
English
When two trees go to war
scientific article

    Statements

    When two trees go to war (English)
    0 references
    0 references
    0 references
    9 March 2015
    0 references
    reticulation
    0 references
    phylogenetic network
    0 references
    cluster
    0 references
    triplet
    0 references
    character
    0 references

    Identifiers