Complexity insights of the minimum duplication problem (Q2440167): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Complexity Insights of the Minimum Duplication Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The gene evolution model and computing its associated probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconciling a gene tree to a species tree under the duplication cost model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconciling Gene Trees with Apparent Polytomies / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Gene Trees to Species Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on optimizing rooted triplets consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Duplication Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank

Revision as of 12:14, 7 July 2024

scientific article
Language Label Description Also known as
English
Complexity insights of the minimum duplication problem
scientific article

    Statements

    Complexity insights of the minimum duplication problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 March 2014
    0 references
    minimum duplication problem
    0 references
    comparative genomics
    0 references
    computational complexity
    0 references
    APX-hardness
    0 references
    randomized algorithm
    0 references

    Identifiers

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