Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets (Q513300): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/algorithmica/HuberIMSW17, #quickstatements; #temporary_batch_1731508824982
 
(6 intermediate revisions by 6 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Dendroscope / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1911223732 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59603599 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1411.6804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the maximum agreement of phylogenetic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On encodings of phylogenetic networks of bounded level / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fine Structure of Galls in Phylogenetic Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encoding and constructing 1-nested phylogenetic networks with trinets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research in Computational Molecular Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trinets encode tree-child and level-2 phylogenetic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the rooted triplet distance between galled trees by counting triangles / 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 / DBLP publication ID
 
Property / DBLP publication ID: journals/algorithmica/HuberIMSW17 / rank
 
Normal rank

Latest revision as of 15:41, 13 November 2024

scientific article
Language Label Description Also known as
English
Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets
scientific article

    Statements

    Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 March 2017
    0 references
    phylogenetic tree
    0 references
    phylogenetic network
    0 references
    polynomial-time algorithm
    0 references
    exponential-time algorithm
    0 references
    NP-hard
    0 references
    supernetwork
    0 references
    trinet
    0 references
    Aho algorithm
    0 references

    Identifiers