Research on parameterized algorithms of the individual haplotyping problem.

doi:10.1142/s0219720007002710

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

Research on parameterized algorithms of the individual haplotyping problem.

Journal of bioinformatics and computational biology - 1 Jun 2007

Xie Minzhu, Chen Jian'er, Wang Jianxin

Abstract excerpt

The individual haplotyping problem is a computing problem of reconstructing two haplotypes for an individual based on several optimal criteria from one's fragments sequencing data. This paper is based on the fact that the length of a fragment and the number of the fragments covering a SNP (single nucleotide polymorphism) site are both very small compared with the length of a sequenced region and the total number...

Topics

Algorithms
Computational Biology
Genome, Human
Haplotypes
Humans
Models, Genetic
Polymorphism, Single Nucleotide
Sequence Analysis, DNA

Source

Open in PubMed

Identifiers

PMID: 17688317
DOI: 10.1142/s0219720007002710

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