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

Perfect sorting by reversals is not always difficult.

Sèverine Bérard1, Anne Bergeron, Cedric Chauve

  • 1Département de Mathématiques et d'Informatique Appliquées, INRA Toulouse, Castanet-Tolosan, France. Severine.Berard@toulouse.inra.fr

IEEE/ACM Transactions on Computational Biology and Bioinformatics
|February 6, 2007
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

On using clustering statistics for assessing plasmid binning tools accuracy.

Briefings in bioinformatics·2026
Same author

Reply to Couderc et al.: Non-invasive management of bronchiolitis obliterans syndrome after hematopoietic stem cell transplantation.

American journal of respiratory and critical care medicine·2026
Same author

Economic burden of pulmonary arterial hypertension in Switzerland.

PloS one·2026
Same author

Efficacy and safety of danazol for pulmonary fibrosis or bone-marrow failure associated with telomere-related gene mutation.

ERJ open research·2026
Same author

Bronchiectasis in patients with bronchiolitis obliterans syndrome: toward phenotyping BOS?

Bone marrow transplantation·2026
Same author

Undesignable motifs in structural RNAs and combinatorial consequences.

Journal of mathematical biology·2026

We developed new algorithms for genome rearrangement analysis, specifically sorting signed permutations by reversals while preserving common intervals. This offers a faster method for understanding evolutionary relationships between species like humans, mice, and rats.

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Genomics

Background:

  • Genome rearrangements are crucial for understanding evolutionary relationships.
  • Existing methods for sorting by reversals can be computationally intensive.
  • Conserving common intervals is vital for accurate phylogenetic analysis.

Purpose of the Study:

  • To develop novel algorithms for computing pairwise genome rearrangement scenarios.
  • To conserve the combinatorial structure of genomes, specifically common intervals, during sorting by reversals.
  • To provide efficient computational methods for analyzing genomic data.

Main Methods:

  • Developed a combinatorial framework for sorting signed permutations by reversals.
  • Characterized classes of permutations solvable in polynomial time.

Related Experiment Videos

  • Defined a specific class solvable in linear time, independent of Hannenhalli-Pevzner theory.

    • Main Results:

    • Introduced algorithms that compute shortest reversal scenarios while conserving common intervals.
    • Achieved polynomial-time computation for certain permutation classes.
    • Demonstrated linear-time computation for a specific, simpler class of permutations.

    Conclusions:

    • The proposed algorithms offer efficient solutions for genome rearrangement problems.
    • The methods successfully conserve genomic combinatorial structure.
    • Applied to comparative genomics of human, mouse, and rat X chromosomes, revealing evolutionary insights.