New results for the longest haplotype reconstruction problem (Q423956): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The haplotyping problem: an overview of computational models and solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the single individual SNP haplotyping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Opportunities for Combinatorial Optimization in Computational Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of comparing evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating the longest path in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank

Latest revision as of 07:29, 5 July 2024

scientific article
Language Label Description Also known as
English
New results for the longest haplotype reconstruction problem
scientific article

    Statements

    New results for the longest haplotype reconstruction problem (English)
    0 references
    0 references
    30 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    computational biology
    0 references
    approximation complexity
    0 references
    fixed-parameter algorithms
    0 references
    0 references