Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem.

Ross Lippert1, Russell Schwartz, Giuseppe Lancia

  • 1Informatics Research department, Celera Genomics, Rockville, MD 20850, USA. Ross.Lippert@celera.com

Briefings in Bioinformatics
|May 11, 2002
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Publisher Correction: Integrated Liquid Biopsy and Tumor Tissue Genomic Profiling of Appendiceal Cancer: cfDNA Burden, Mutation Landscapes, and Clinical Outcomes.

Annals of surgical oncology·2026
Same author

Integrated Liquid Biopsy and Tumor Tissue Genomic Profiling of Appendiceal Cancer: cfDNA Burden, Mutation Landscapes, and Clinical Outcomes.

Annals of surgical oncology·2026
Same author

Deconvolution and phylogeny inference of diverse variant types integrating bulk DNA-seq with single-cell RNA-seq.

Bioinformatics advances·2025
Same author

Intensive Care Unit Monitoring Post-Tonsillectomy in Children with Obstructive Sleep Apnea.

Journal of otolaryngology - head & neck surgery = Le Journal d'oto-rhino-laryngologie et de chirurgie cervico-faciale·2025
Same author

Cell-Free DNA, Tumor Molecular Concordance, and Clinical Correlates of Patients with Cancer Treated in a Large Community Health Care Network.

The Journal of molecular diagnostics : JMD·2025
Same author

Biological databases in the age of generative artificial intelligence.

Bioinformatics advances·2025
Same journal

SA-MTP: a structure-aware framework for multifunctional therapeutic peptide annotation.

Briefings in bioinformatics·2026
Same journal

Genome assemblies and annotations are not static and need support for tracking their evolution.

Briefings in bioinformatics·2026
Same journal

A historical journey of metabolite-protein interaction discovery: from data harmonization to AI-driven prediction.

Briefings in bioinformatics·2026
Same journal

Bridging local-global transmembrane protein contexts with contrastive pretraining for alignment-free pathogenicity prediction.

Briefings in bioinformatics·2026
Same journal

Prediction of drug hypersensitivity by comprehensive modeling of HLA-peptidomes.

Briefings in bioinformatics·2026
Same journal

EssTFNet: integration of adaptive time-frequency and DNA language models for interpretable human essential gene prediction.

Briefings in bioinformatics·2026
See all related articles

Determining genetic haplotypes for large populations is challenging. This study introduces new algorithms for inferring haplotypes from short genome fragments, making genetic association studies more feasible.

Area of Science:

  • Genomics
  • Bioinformatics
  • Computational Biology

Background:

  • The completion of the human genome sequence has shifted focus to individual genetic variations.
  • Determining genetic haplotypes (sets of linked variants) is crucial for association studies but remains difficult and expensive.
  • Existing methods face challenges in scalability and cost for large-scale population studies.

Purpose of the Study:

  • To present algorithmic approaches for inferring haplotypes from localized polymorphism data.
  • To address the obstacle of efficiently determining genetic haplotypes for large numbers of individuals.
  • To explore computational strategies for haplotype assembly from short genomic fragments.

Main Methods:

  • Development of formalized models for the biological system of haplotype determination.

Related Experiment Videos

  • Examination of algorithms under various assumptions about problem goals and optimal solutions.
  • Analysis of theoretical results for handling haplotype assembly from localized data.

    • Main Results:

    • Simplified variants of the haplotype assembly problem are shown to be computationally tractable.
    • More general versions of the haplotype determination problem are often intractable in the worst case.
    • The proposed algorithmic approach offers a new method for inferring haplotypes from fragmented genomic data.

    Conclusions:

    • Inferring haplotypes from short genome fragments presents a promising avenue for advancing genetic association studies.
    • Algorithmic development is key to overcoming the computational challenges in large-scale haplotype determination.
    • While some problem variants are tractable, the complexity of general haplotype assembly necessitates further research.