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

On sorting by translocations.

Anne Bergeron1, Julia Mixtacki, Jens Stoye

  • 1Département d'informatique, Université du Québec à Montréal, Canada.

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|April 7, 2006
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

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

[Lung involvement in rheumatoid arthritis].

Revue medicale suisse·2026
Same author

Dyspnoea patterns in patients with advanced diseases: a functional MRI feasibility study protocol.

BMJ open·2026
Same journal

GMSA: A Graph Matching and Point Cloud Registration-Based Method for Spatial Transcriptomics Data Alignment.

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

Investigations on Multiple Protein Scaffold Filling.

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

Cell Type Prediction for Single-Cell RNA Sequencing Utilizing Unsupervised Domain Adaptation and Semi-Supervised Learning.

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

PPIGAN: Prediction of Protein-Protein Interactions Using Generative Adversarial Networks.

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

Deep Structure-Enhanced Cell Clustering Model for Single-Cell RNA Sequencing Data.

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

Asymmetric Drug-Drug Interaction Prediction Based on Generative Adversarial Networks and Knowledge Graph.

Journal of computational biology : a journal of computational molecular cell biology·2026
See all related articles

This study simplifies sorting genomes by translocations, offering a new algorithm and proof for calculating genome rearrangement distance efficiently. It corrects previous errors in translocation sorting methods.

Area of Science:

  • Genomics
  • Bioinformatics
  • Computational Biology

Background:

  • Genome rearrangements, such as translocations, are crucial for understanding evolutionary relationships between species.
  • Sorting a genome by translocations involves reordering chromosome segments to match a reference genome.

Purpose of the Study:

  • To provide an elementary proof for calculating translocation distance in linear time.
  • To introduce a novel algorithm for sorting multichromosomal genomes by translocations.
  • To address and correct an error in a previously published algorithm.

Main Methods:

  • Developing an elementary proof for the translocation distance formula.
  • Designing a new algorithm for genome sorting by translocations.
  • Comparative analysis with existing algorithms, including Hannenhalli's.

Related Experiment Videos

Main Results:

  • An efficient, linear-time method for computing translocation distance.
  • A corrected and improved algorithm for sorting genomes by translocations.
  • Demonstration of the algorithm's efficacy in genome rearrangement studies.

Conclusions:

  • The study offers a more accurate and efficient approach to analyzing genome rearrangements by translocations.
  • The findings contribute to the field of comparative genomics by refining methods for genome sorting.
  • This work provides a valuable tool for researchers studying genome evolution and structure.