Generalized Hultman Numbers and Cycle Structures of Breakpoint Graphs

Area of Science:

• Computational Biology
• Genomics
• Combinatorics

Background:

• Genome rearrangements are modeled as k-breaks, with 2-breaks for simple events and 3-breaks for transpositions.
• K-break distance is computable via breakpoint graph cycle lengths.
• K-break models are vital for understanding chromothripsis in cancer genomics.

Purpose of the Study:

• To combinatorially enumerate genomes at a specified k-break distance from a reference genome.
• To enumerate genome pairs with specific breakpoint graph cycle length distributions.
• To facilitate uniform random sampling of genomes based on k-break distance.

Main Methods:

• Utilizing breakpoint graph theory to analyze genome rearrangements.
• Developing combinatorial methods for enumerating genomes based on k-break distance.
• Establishing connections between genome rearrangement enumeration and combinatorial structures.

Main Results:

• A method for enumerating genomes at a given k-break distance is presented.
• The enumeration of genome pairs based on breakpoint graph cycle lengths is achieved.
• The enumeration technique supports uniform sampling of random genomes at a specific k-break distance.

Conclusions:

• The study provides a combinatorial framework for understanding genome rearrangements at a k-break distance.
• The developed methods offer insights into chromothripsis and related genomic events.
• Connections to Bell polynomials highlight the broader combinatorial implications of genome rearrangement analysis.