Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: SIMPLE ALGORITHMS FOR PERFECT PHYLOGENY AND TRIANGULATING COLORED GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting the branches for an evolutionary tree. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two strikes against perfect phylogeny / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex tree realizations of partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm for Near-Perfect Phylogeny / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing phylogenetic number to find good evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for inferring evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring Evolutionary History From DNA Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Mutation Trees of Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of reconstructing trees from qualitative characters and subtrees / rank
 
Normal rank

Latest revision as of 12:45, 28 June 2024

scientific article
Language Label Description Also known as
English
Convex recolorings of strings and trees: Definitions, hardness results and algorithms
scientific article

    Statements

    Identifiers

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