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

Multiple genome rearrangement by reversals.

Shiquan Wu1, Xun Gu

  • 1Center of Bioinformatics and Biological Statistics, Iowa State University, Ames, IA 50011, USA. sqwu,xgu@iastate.edu

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing
|April 4, 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

Cross-species integration of single-cell data reveals conserved pathology-associated cell populations across animal models and human samples.

Cell reports methods·2026
Same author

Characterization of Cancer Hallmark Enhancer RNA Uncovers Novel Strategies for Precision Oncology.

Genomics, proteomics & bioinformatics·2026
Same author

MRDviz: an integrated platform for interactive visualization and joint simulation of minimal residual disease trajectories and associated survival outcomes.

Bioinformatics advances·2026
Same author

Oxygen-sparing photodynamic therapy via dissolving microneedles for rheumatoid arthritis.

International journal of pharmaceutics: X·2026
Same author

ProtFPreDTI: Drug-Target Interaction Prediction Study and LIME Interpretability Analysis Based on the ProtBERT Deep Language Model with Adaptive Fuzzy Sampling Strategy.

Bioconjugate chemistry·2026
Same author

Identification of cancer mini-drivers by deciphering selective landscape in the cancer genome.

Briefings in bioinformatics·2026

This study addresses the NP-hard genome rearrangement problem by developing efficient heuristic algorithms. New approximation algorithms are presented for generating multiple genomes using signed reversals, demonstrating practical efficiency.

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Genomics

Background:

  • The multiple genome rearrangement problem seeks to minimize signed reversals to transform one genome into a collection.
  • This problem is computationally complex (NP-hard), necessitating efficient heuristic approaches.

Purpose of the Study:

  • To develop efficient heuristic and approximation algorithms for the multiple genome rearrangement problem.
  • To provide polynomial-time algorithms for special cases and extend them to general cases.

Main Methods:

  • Developing polynomial-time algorithms for generating two and three genomes in specific scenarios.
  • Designing approximation algorithms based on these polynomial algorithms for general cases.
  • Applying these approximation algorithms to create a novel method for generating multiple genomes.

Related Experiment Videos

Main Results:

  • The study presents novel approximation algorithms for the multiple genome rearrangement problem.
  • Experimental results indicate the efficiency of the developed algorithms.
  • The algorithms provide a practical approach to solving this NP-hard problem.

Conclusions:

  • The developed approximation algorithms offer an efficient solution for the multiple genome rearrangement problem.
  • The research contributes practical computational tools for genomic analysis.
  • The findings are validated through experimental examples, showing algorithmic efficiency.