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 and breakpoint phylogeny

D Sankoff1, M Blanchette

  • 1Centre de recherches mathématiques, Université de Montréal, Québec, Canada. sankoff@ere.umontreal.ca

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|October 17, 1998
PubMed
Summary

This study introduces breakpoint analysis for multiple genome rearrangement, simplifying complex gene order comparisons. It shows consensus-based rearrangement can be solved using the Traveling Salesman Problem, improving accuracy with more genomes.

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

Large-scale genomic analyses with machine learning uncover predictive patterns associated with fungal phytopathogenic lifestyles and traits.

Scientific reports·2023
Same author

A Genomics Approach to Mitochondrial Evolution.

The Biological bulletin·2017
Same author

Motif discovery in heterogeneous sequence data.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2004
Same author

Comparative analyses of multi-species sequences from targeted genomic regions.

Nature·2003
Same author

Detection and validation of single gene inversions.

Bioinformatics (Oxford, England)·2003
Same author

Gene and genome duplication.

Current opinion in genetics & development·2001

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Genomics

Background:

  • Macromolecular sequence alignment compares N sequences diverging via local edits (insertion, deletion, substitution).
  • Gene order sequences diverge through non-local genome rearrangements like inversions and transpositions.

Purpose of the Study:

  • To establish counterparts between multiple sequence alignment and multiple genome rearrangement formulations.
  • To propose a novel method for solving consensus-based multiple rearrangement problems.

Main Methods:

  • Breakpoint analysis is proposed as a simpler alternative to edit-distance for rearrangement.
  • Consensus-based multiple rearrangement is reduced to instances of the Traveling Salesman Problem (TSP).
  • A branch-and-bound TSP solution is developed, and tree-based multiple alignment is achieved by iterative 3-star decomposition.

Related Experiment Videos

Main Results:

  • Non-uniqueness of solutions in multiple rearrangement decreases as the number of genomes increases.
  • Iterative decomposition into 3-stars allows accurate tree-based multiple alignment.
  • Solution uniqueness in tree-based alignment depends on node position relative to terminal vertices.

Conclusions:

  • Breakpoint analysis offers a tractable approach to multiple genome rearrangement.
  • The TSP reduction provides an exact solution for consensus-based multiple rearrangement.
  • The proposed methods enhance accuracy and understanding of genome evolution and comparative genomics.