Reconstructing a phylogenetic level-1 network from quartets (Q486621): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q46836926, #quickstatements; #temporary_batch_1712190744730
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11538-014-0022-z / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1308.5206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3136877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing the shape of a tree from observed dissimilarity data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring evolutionary trees with strong combinatorial evidence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Cryptanalysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A few logs suffice to build (almost) all trees (I) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two novel closure rules for constructing phylogenetic super-networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency of the QNet algorithm for generating planar split networks from weighted quartets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902095 / 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: Q4792088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic permutations and evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving sparse linear equations over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of reconstructing trees from qualitative characters and subtrees / 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 / DOI
 
Property / DOI: 10.1007/S11538-014-0022-Z / rank
 
Normal rank

Latest revision as of 18:56, 9 December 2024

scientific article
Language Label Description Also known as
English
Reconstructing a phylogenetic level-1 network from quartets
scientific article

    Statements

    Reconstructing a phylogenetic level-1 network from quartets (English)
    0 references
    0 references
    0 references
    16 January 2015
    0 references
    phylogenetic networks
    0 references
    cyclic ordering
    0 references
    quartets
    0 references
    level-1 networks
    0 references
    supernetwork method
    0 references
    polynomial time algorithm
    0 references

    Identifiers