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

The multiple gene duplication problem revisited.

Mukul S Bansal1, Oliver Eulenstein

  • 1Department of Computer Science, Iowa State University, Ames, IA 50011, USA.

Bioinformatics (Oxford, England)
|July 1, 2008
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

A PLUM Job: Peptide modeLs for Understanding and engineering antiMicrobial therapeutics.

bioRxiv : the preprint server for biology·2026
Same author

<i>Special Issue:</i> 13th International Conference on Computational Advances in Bio and Medical Sciences.

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

SISTEM: simulation of tumor evolution, metastasis, and DNA-seq data under genotype-driven selection.

Bioinformatics (Oxford, England)·2025
Same author

DupLoss-2: Improved Phylogenomic Species Tree Inference under Gene Duplication and Loss.

Systematic biology·2025
Same author

Phylo-rs: an extensible phylogenetic analysis library in rust.

BMC bioinformatics·2025
Same author

Computing generalized cophenetic distances under all Lp norms: A near-linear time algorithmic framework.

PLoS computational biology·2025
Same journal

3DICE: Interpretable 3D Cross-Modal Learning for Drug-Target Interaction Prediction and Large-Scale Drug Discovery.

Bioinformatics (Oxford, England)·2026
Same journal

KASSPer: Kinase Active Site Structure Prediction using Protein and Ligand Language Models and Its Application to Virtual Screening.

Bioinformatics (Oxford, England)·2026
Same journal

IDR searcher: a search engine solution for public image resources.

Bioinformatics (Oxford, England)·2026
Same journal

KCFtools: Rapid alignment-free method for introgression screening and GWAS using k-mer profiles.

Bioinformatics (Oxford, England)·2026
Same journal

Meta2DB: Curated shotgun metagenomic feature sets and metadata for health state prediction.

Bioinformatics (Oxford, England)·2026
Same journal

conMItion: an R package adjusting confounding factors for associations in multi-omics.

Bioinformatics (Oxford, England)·2026
See all related articles

Researchers have solved the longstanding multiple gene duplication problem with the first exact and efficient algorithm. This breakthrough advances our understanding of gene family and genome evolution across the Tree of Life.

Area of Science:

  • Evolutionary Biology
  • Genomics
  • Bioinformatics

Background:

  • Understanding gene duplication is crucial for evolutionary and genomic studies.
  • The multiple gene duplication problem aims to map duplication events on species trees.
  • Previous research lacked exact algorithms, relying on heuristic methods.

Purpose of the Study:

  • To provide the first exact and efficient solution to the multiple gene duplication problem.
  • To establish a definitive method for placing gene duplication events on phylogenetic trees.
  • To improve the analysis of gene family and genome evolution.

Main Methods:

  • Developed and implemented a novel exact algorithm for the multiple gene duplication problem.
  • Applied the algorithm to simulated datasets to assess performance.

Related Experiment Videos

  • Validated the algorithm using empirical biological datasets.

    • Main Results:

    • Successfully solved the longstanding open problem of multiple gene duplication.
    • The new algorithm provides an exact and efficient solution.
    • Demonstrated superior performance compared to existing heuristic approaches.

    Conclusions:

    • The developed algorithm offers a significant advancement in evolutionary genomics.
    • Provides a robust framework for studying gene duplication events.
    • Enables more accurate reconstruction of evolutionary histories.