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

Efficient computation of minimum recombination with genotypes (not haplotypes).

Journal of bioinformatics and computational biology - 1 Apr 2007

Wu Yufeng, Gusfield Dan

Abstract excerpt

A current major focus in genomics is the large-scale collection of genotype data in populations in order to detect variations in the population. The variation data are sought in order to address fundamental and applied questions in genetics that concern the haplotypes in the population. Since, almost all the collected data is in the form of genotypes, but the downstream genetics questions concern haplotypes, the...

Read the complete abstract on PubMed

Topics

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

Share to Chromosome Mapping
Share to Genetic Variation
Share to Genotype

Methodology Data sources Editorial policy Privacy Delete account & data About Contact Helena Bioinformatics

Share to Haplotypes

Share to Models, Genetic

Share to Polymorphism, Single Nucleotide

Share to Recombination, Genetic

Share to Sequence Analysis, DNA

Source

Identifiers

PMID: 17589959
DOI: 10.1142/s0219720007002631

Provenance

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

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence. Graph snapshot: 2026-09-29.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Efficient computation of minimum recombination with genotypes (not haplotypes).PMID 17589959Read ↗

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

Computing the minimum recombinant haplotype configuration from incomplete genotype data on a pedigree by integer linear programming.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 ↗

A survey of current software for haplotype phase inference.Semantic proximity Read ↗

Genotype phasing in populations of closely related individuals.Semantic proximity Read ↗

Constructing founder sets under allelic and non-allelic homologous recombinationSemantic proximity Read ↗

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

Algorithms to estimate the lower bounds of recombination with or without recurrent mutations.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 ↗

Deriving haplotypes through recombination and gene conversion pathways.Semantic proximity Read ↗

Global haplotype partitioning for maximal associated SNP pairs.Semantic proximity Read ↗

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