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

A linear-time algorithm for the perfect phylogeny haplotyping (PPH) problem.

Zhihong Ding1, Vladimir Filkov, Dan Gusfield

  • 1Department of Computer Science, University of California, Davis, 95616, USA. dingz@cs.ucdavis.edu

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|April 7, 2006
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

RadAnnotate: Large Language Models for Efficient and Reliable Radiology Report Annotation.

AMIA Joint Summits on Translational Science proceedings. AMIA Joint Summits on Translational Science·2026
Same author

Intelligent documentation in medical education: can AI replace manual case logging?

JAMIA open·2026
Same author

The impact of the Social Exposome in Cardiovascular Health and Disease.

Journal of precision medicine (Amsterdam, Netherlands)·2026
Same author

Natural language processing of biomedical text to map and prioritize protein-disease associations in HFpEF.

Computers in biology and medicine·2026
Same author

Sideband suppression method for fiber optic phased array coherent LiDAR echo signal based on periodic matching.

Optics express·2025
Same author

Deep Learning Models for Automatic Classification of Anatomic Location in Abdominopelvic Digital Subtraction Angiography.

Journal of imaging informatics in medicine·2025
Same journal

GMSA: A Graph Matching and Point Cloud Registration-Based Method for Spatial Transcriptomics Data Alignment.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Investigations on Multiple Protein Scaffold Filling.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Cell Type Prediction for Single-Cell RNA Sequencing Utilizing Unsupervised Domain Adaptation and Semi-Supervised Learning.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

PPIGAN: Prediction of Protein-Protein Interactions Using Generative Adversarial Networks.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Deep Structure-Enhanced Cell Clustering Model for Single-Cell RNA Sequencing Data.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Asymmetric Drug-Drug Interaction Prediction Based on Generative Adversarial Networks and Knowledge Graph.

Journal of computational biology : a journal of computational molecular cell biology·2026
See all related articles

Researchers have developed a linear-time algorithm to solve the Perfect Phylogeny Haplotyping (PPH) problem. This practical solution is faster than previous methods and useful for complex computational biology problems.

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Algorithmic Theory

Background:

  • The Perfect Phylogeny Haplotyping (PPH) problem has been an open challenge since its introduction in 2002.
  • Previous research has explored various aspects of the PPH problem, but a linear-time solution remained elusive.

Purpose of the Study:

  • To address the long-standing open problem of finding a deterministic, worst-case linear-time algorithm for the PPH problem.
  • To provide a practical and efficient algorithmic solution for haplotyping in computational biology.

Main Methods:

  • Developed a novel, deterministic algorithm with a worst-case linear time complexity.
  • The algorithm is based on a simple data structure and straightforward operations.
  • The method has been fully implemented and tested.

Related Experiment Videos

Main Results:

  • Successfully solved the open problem by providing a linear-time algorithm for PPH.
  • Simulations demonstrate that the new algorithm significantly outperforms existing nonlinear methods in practice.

Conclusions:

  • The presented linear-time algorithm offers a significant advancement for the PPH problem.
  • This solution has both conceptual importance and practical utility in computational biology, particularly within the inner loops of more complex algorithms.