Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on a pedigree.

BMC bioinformatics - 1 Jan 2012

Lai En-Yu, Wang Wei-Bung, Jiang Tao, Wu Kun-Pin

Abstract excerpt

BACKGROUND: When studying genetic diseases in which genetic variations are passed on to offspring, the ability to distinguish between paternal and maternal alleles is essential. Determining haplotypes from genotype data is called haplotype inference. Most existing computational algorithms for haplotype inference have been designed to use genotype data collected from individuals in the form of a pedigree. A...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Algorithms
Share to Child
Share to Computer Simulation

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Genetic Diseases, Inborn

Share to Haplotypes

Share to Models, Genetic

Share to Pedigree

Share to Recombination, Genetic

Source

Open in PubMed Open full text

Identifiers

PMID: 23281626
DOI: 10.1186/1471-2105-13-S17-S19
PMCID: PMC3521470

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 7 Sept 2026. Manifest publication-graph-cohort-2026-09-07.1.

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on a pedigree.PMID 23281626Read ↗

Computing the minimum recombinant haplotype configuration from incomplete genotype data on a pedigree by integer linear programming.Semantic proximity Read ↗

A novel algorithm for minimum recombinant haplotyping on pedigrees by zero recombinant block partition.Semantic proximity Read ↗

Efficient inference of haplotypes from genotypes on a pedigree.Semantic proximity Read ↗

An efficient algorithm for haplotype inference on pedigrees with recombinations and mutations.Semantic proximity Read ↗

Minimum-recombinant haplotyping in pedigrees.Semantic proximity Read ↗

Linear-time reconstruction of zero-recombinant Mendelian inheritance on pedigrees without mating loops.Semantic proximity Read ↗

Inferring haplotypes from genotypes on a pedigree with mutations, genotyping errors and missing alleles.Semantic proximity Read ↗

An almost linear time algorithm for a general haplotype solution on tree pedigrees with no recombination and its extensions.Semantic proximity Read ↗

Estimate haplotype frequencies in pedigrees.Semantic proximity Read ↗

Detecting genome-wide haplotype polymorphism by combined use of Mendelian constraints and local population structure.Semantic proximity Read ↗

A fast and practical approach to genotype phasing and imputation on a pedigree with erroneous and incomplete information.Semantic proximity Read ↗

Linked region detection using high-density SNP genotype data via the minimum recombinant model of pedigree haplotype inference.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.