Efficient inference of haplotypes from genotypes on a pedigree.

doi:10.1142/s0219720003000204

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

Back to search

Article

Efficient inference of haplotypes from genotypes on a pedigree.

Journal of bioinformatics and computational biology - 1 Apr 2003

Li Jing, Jiang Tao

Abstract excerpt

We study haplotype reconstruction under the Mendelian law of inheritance and the minimum recombination principle on pedigree data. We prove that the problem of finding a minimum-recombinant haplotype configuration (MRHC) is in general NP-hard. This is the first complexity result concerning the problem to our knowledge. An iterative algorithm based on blocks of consecutive resolved marker loci (called...

Topics

Algorithms
Computational Biology
Databases, Genetic
Female
Genotype
Haplotypes
Humans
Male
Models, Genetic
Pedigree
Polymorphism, Single Nucleotide
Recombination, Genetic
Software

Source

Open in PubMed

Identifiers

PMID: 15290781
DOI: 10.1142/s0219720003000204

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 30 Aug 2026.

Community interpretation

Discuss the evidence

Ask a question, add context or challenge an interpretation. Community activity is separate from scientific evidence strength.

discussions

replies

Citations encouraged

Claims remain attributable.

No discussion yet

Be the first to add a careful, cited interpretation.

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics