The pure parsimony haplotyping problem: overview and computational advances (Q3563606): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1111/j.1475-3995.2009.00716.x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085915668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving haplotyping inference parsimony problem using a new basic polynomial formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Metaheuristics in Combinatorial Optimization: A Tutorial / 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 minimum evolution problem: Overview and classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class Representative Model for Pure Parsimony Haplotyping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Haplotype Inference with Pseudo-boolean Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Methods for SNPs and Haplotype Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: The phasing of heterozygous traits: Algorithms and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial case of the parsimony haplotyping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Set-Covering Approach with Column Generation for Parsimony Haplotyping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms / rank
 
Normal rank

Latest revision as of 21:47, 2 July 2024

scientific article
Language Label Description Also known as
English
The pure parsimony haplotyping problem: overview and computational advances
scientific article

    Statements

    The pure parsimony haplotyping problem: overview and computational advances (English)
    0 references
    0 references
    0 references
    31 May 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    integer programming
    0 references
    computational biology
    0 references
    pure parsimony haplotyping
    0 references
    SNPs
    0 references
    0 references