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

An efficient algorithm for Perfect Phylogeny Haplotyping.

Ravi Vijayasatya1, Amar Mukherjee

  • 1School of Computer Science, University of Central Florida, 32816-2362, USA. rvijaya@cs.ucf.edu

Proceedings. IEEE Computational Systems Bioinformatics Conference
|February 2, 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

The undirected incomplete perfect phylogeny problem.

IEEE/ACM transactions on computational biology and bioinformatics·2008
Same author

Constructing near-perfect phylogenies with multiple homoplasy events.

Bioinformatics (Oxford, England)·2006
Same author

An optimal algorithm for perfect phylogeny haplotyping.

Journal of computational biology : a journal of computational molecular cell biology·2006
Same author

A pattern matching algorithm for codon optimization and CpG motif-engineering in DNA expression vectors.

Proceedings. IEEE Computer Society Bioinformatics Conference·2006
Same author

DNA sequence compression using the burrows-wheeler transform.

Proceedings. IEEE Computer Society Bioinformatics Conference·2005
Same journal

A Two-Step Approach for Clustering Proteins based on Protein Interaction Profile.

Proceedings. IEEE Computational Systems Bioinformatics Conference·2008
Same journal

Fractal genomics modeling: a new approach to genomic analysis and biomarker discovery.

Proceedings. IEEE Computational Systems Bioinformatics Conference·2006
Same journal

Gene Ontology friendly biclustering of expression profiles.

Proceedings. IEEE Computational Systems Bioinformatics Conference·2006
Same journal

Comparative analysis of gene sets in the Gene Ontology space under the multiple hypothesis testing framework.

Proceedings. IEEE Computational Systems Bioinformatics Conference·2006
Same journal

AZuRE, a scalable system for automated term disambiguation of gene and protein names.

Proceedings. IEEE Computational Systems Bioinformatics Conference·2006
Same journal

Calculation, visualization, and manipulation of MASTs (Maximum Agreement Subtrees).

Proceedings. IEEE Computational Systems Bioinformatics Conference·2006
See all related articles

The Perfect Phylogeny Haplotyping (PPH) problem now has an efficient O(nm) solution. New data structures and ordering methods enable faster haplotype inference, outperforming previous algorithms on simulated data.

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Genetics

Background:

  • The Haplotype Inference (HI) problem is crucial in genetics.
  • The Perfect Phylogeny Haplotyping (PPH) problem is a key aspect of HI.
  • Existing PPH algorithms have a time complexity of O(nm(2)), with the problem's inherent complexity remaining an open question.

Purpose of the Study:

  • To develop a more efficient algorithm for the PPH problem.
  • To introduce novel data structures and ordering techniques to improve computational efficiency.
  • To analyze the performance of the new algorithm against existing methods.

Main Methods:

  • Introduction of the FlexTree data structure to represent all PPH solutions.
  • Development of row-ordering to manage genotype data effectively.

Related Experiment Videos

  • Integration of column ordering, FlexTree, and row ordering to create the O(nm) OPPH algorithm.

    • Main Results:

    • The developed OPPH algorithm achieves a time complexity of O(nm).
    • Simulated data analysis shows the OPPH algorithm performs impressively.
    • The new approach significantly improves upon the efficiency of previous O(nm(2)) algorithms.

    Conclusions:

    • The FlexTree data structure and ordering methods facilitate an efficient O(nm) solution for PPH.
    • The OPPH algorithm offers a substantial advancement in computational efficiency for haplotype inference.
    • The findings pave the way for more scalable and faster genetic data analysis.