Genome Rearrangement Algorithms and Comparative Genomics

Genome rearrangements encompass large-scale structural changes in the organisation of chromosomes, including inversions, transpositions and chromosomal fusions or fissions. Algorithmic models for such rearrangements enable the computation of distances between genomes by finding minimal sequences of operations that transform one genome into another. Comparative genomics leverages these distances to reconstruct evolutionary histories, identify conserved and variable regions, and infer the forces shaping genome architecture across species. Over the past decade, the development of versatile frameworks—such as the double cut and join operation and variants of breakpoint graphs—has unified diverse rearrangement events under a single combinatorial umbrella. Extensions to these models incorporate insertions and deletions of chromosomal segments (indels), intergenic region lengths and gene content disparities, yielding more realistic yet computationally challenging scenarios. These algorithmic advances have facilitated the generation of phylogenetic trees concordant with sequence-based methods, the detection of rearrangement hotspots in mammalian and microbial lineages, and the estimation of true evolutionary distances beyond simple parsimony. By integrating weighted cost models, family-free gene matching and approximation or fixed-parameter algorithms, the field is now able to address genomes with multifamily gene repertoires and complex structural variation. This interplay between algorithm design and comparative analysis continues to deepen our understanding of genome evolution on a global scale.

Research from Nature Portfolio

No recent Nature Portfolio content available.

Genome Rearrangement Algorithms and Comparative Genomics publication trend

The graph below shows the total number of articles in genome rearrangement algorithms and comparative genomics across all publications each year (not limited to Nature Index journals).

Technical terms

Genome rearrangement: Large-scale mutations that alter the order or orientation of genomic segments.

Comparative genomics: Study of genome structure and function across different species to infer evolutionary relationships.

Double cut and join (DCJ): A versatile operation modelling the excision and re-insertion of genomic segments to represent various rearrangements.

Indel: An insertion or deletion of a chromosomal segment affecting gene content.

Rank-indel distance: A generalised matrix-based distance measure that accounts for both rearrangements and indels across genomes with differing content.

Family-free genomic distance: A distance computation that bypasses predefined gene families by using pairwise gene similarity scores.

Intergenic region: The noncoding DNA sequence situated between adjacent genes, whose length can inform rearrangement scenarios.

References

1. Generalizations of the genomic rank distance to indels. Bioinformatics (2023).
2. Algorithms for computing the double cut and join distance on both gene order and intergenic sizes. Algorithms for Molecular Biology (2017).
3. Natural family-free genomic distance. Algorithms for Molecular Biology (2021).