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

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

Journal of computational biology : a journal of computational molecular cell biology - 1 Jan 2000

Li Jing, Jiang Tao

Abstract excerpt

We study the problem of reconstructing haplotype configurations from genotypes on pedigree data with missing alleles under the Mendelian law of inheritance and the minimum-recombination principle, which is important for the construction of haplotype maps and genetic linkage/association analyses. Our previous results show that the problem of finding a minimum-recombinant haplotype configuration (MRHC) is in...

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Computational Biology

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Haplotypes

Share to Linkage Disequilibrium

Share to Models, Genetic

Share to Pedigree

Share to Recombination, Genetic

Share to Software

Source

Identifiers

PMID: 16108713
DOI: 10.1089/cmb.2005.12.719

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

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

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

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

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

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

Minimum-recombinant haplotyping in pedigrees.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 ↗

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

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

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

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

Efficient computation of minimum recombination with genotypes (not haplotypes).Semantic proximity Read ↗

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