A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops (Q965820): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1007/s10878-008-9180-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027596093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934651 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:12, 2 July 2024

scientific article
Language Label Description Also known as
English
A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops
scientific article

    Statements

    A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops (English)
    0 references
    0 references
    0 references
    26 April 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    haplotype inference
    0 references
    pedigree analysis
    0 references
    mating loop
    0 references
    tree-pedigree
    0 references
    linear-time algorithm
    0 references
    system of linear equations
    0 references
    general solution
    0 references
    0 references