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 easy case of sorting by reversals.

N Tran1

  • 1Department of Computer Science, Wichita State University, Kansas 67260-0083, USA. tran@cs.twsu.edu

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|March 11, 1999
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

Biomedical titanium-tantalum alloys for orthopedic implant applications: From manufacturing to biological performance.

Bioactive materials·2026
Same author

Results from the T2K Experiment on Neutrino Mixing Including a New Far Detector μ-like Sample.

Physical review letters·2026
Same author

First Differential Measurement of the Single π^{+} Production Cross Section in Neutrino Neutral-Current Scattering.

Physical review letters·2025
Same author

First Measurement of the Electron-Neutrino Charged-Current Pion Production Cross Section on Carbon with the T2K Near Detector.

Physical review letters·2025
Same author

Towards a home-grown rural health workforce: Evidence from Tasmania, Australia.

The Australian journal of rural health·2024
Same author

Low latency optical-based mode tracking with machine learning deployed on FPGAs on a tokamak.

The Review of scientific instruments·2024

We demonstrate that a specific scenario of sorting by reversals is solvable in polynomial time. This occurs when the number of breakpoints equals twice the genomic distance.

Area of Science:

  • Computational biology
  • Bioinformatics
  • Genomics

Background:

  • Sorting by reversals is a fundamental problem in computational biology.
  • Understanding genome rearrangements is crucial for evolutionary studies.

Purpose of the Study:

  • To investigate the computational complexity of sorting by reversals under specific conditions.
  • To identify a tractable special case of the sorting by reversals problem.

Main Methods:

  • Algorithmic analysis
  • Complexity theory
  • Breakpoint analysis

Main Results:

  • A special case of sorting by reversals is solvable in polynomial time.
  • The condition for polynomial time solvability is when the number of breakpoints is twice the distance.

Related Experiment Videos

Conclusions:

  • This finding provides an efficient algorithm for a specific genome rearrangement scenario.
  • Highlights the importance of analyzing special cases in complex computational problems.