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

Fast and cheap genome wide haplotype construction via optical mapping.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing - 1 Jan 2005

Anantharaman T S, Mysore V, Mishra B

Abstract excerpt

We describe an efficient algorithm to construct genome wide haplotype restriction maps of an individual by aligning single molecule DNA fragments collected with Optical Mapping technology. Using this algorithm and small amount of genomic material, we can construct the parental haplotypes for each diploid chromosome for any individual. Since such haplotype maps reveal the polymorphisms due to single nucleotide...

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Chromosome Mapping
Share to Genome

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

Share to Models, Genetic

Share to Polymorphism, Restriction Fragment Length

Share to Restriction Mapping

Share to Sequence Alignment

Share to Sequence Deletion

Source

Identifiers

PMID: 15759644
DOI: 10.1142/9789812702456_0037

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.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Fast and cheap genome wide haplotype construction via optical mapping.PMID 15759644Read ↗

A Markov chain model for haplotype assembly from SNP fragments.Semantic proximity Read ↗

Efficient whole genome haplotyping and high-throughput single molecule phasing with barcode-linked readsSemantic proximity Read ↗

Joint haplotype phasing and genotype calling of multiple individuals using haplotype informative reads.Semantic proximity Read ↗

A highly accurate heuristic algorithm for the haplotype assembly problem.Semantic proximity Read ↗

Linear reduction method for predictive and informative tag SNP selection.Semantic proximity Read ↗

Joint haplotype assembly and genotype calling via sequential Monte Carlo algorithm.Semantic proximity Read ↗

Finding Overlapping Rmaps via Gaussian Mixture Model ClusteringSemantic proximity Read ↗

Fast and Efficient Rmap Assembly using the Bi-labelled de Bruijn GraphSemantic proximity Read ↗

Massively parallel haplotyping on microscopic beads for the high-throughput phase analysis of single molecules.Semantic proximity Read ↗

Efficient fast heuristic algorithms for minimum error correction haplotyping from SNP fragments.Semantic proximity Read ↗

Highly scalable genotype phasing by entropy minimization.Semantic proximity Read ↗

Analysis of association studies and inference of haplotypic phase using hidden Markov modelsSemantic proximity Read ↗

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