Journal of Computational Biology· 2026Q2
On Deriving Synteny Blocks by Compacting Elements
- 1citations
- Q2SCImago
- 2026year
Short summary
A new formal framework derives synteny blocks directly from sequence data by partitioning genomic elements into blocks that do not span breakpoints, ensuring rearrangements are not obscured.
AI-generated from the title and abstract; the full text is not read.
Key points
- Presents a formal framework for deriving synteny blocks directly from sequence data, not gene annotations or alignments.
- Defines synteny blocks as segments that do not span breakpoints, preserving information about genomic rearrangements.
- Formalizes two NP-hard optimization problems: minimizing total genome length and minimizing the number of blocks.
- Provides a linear-time algorithm for collinear blocks that simultaneously optimizes both objectives.
AI-generated from the title and abstract; the full text is not read.
Abstract
Abstract Genomic rearrangements are major drivers of evolution and genetic disease. However, studying rearrangements requires segmenting the genomes of interest into conserved regions, called synteny blocks, that highlight structural differences between genomes. Synteny blocks are typically defined from annotated genes or derived as a by-product of whole-genome alignments. As these procedures are heuristic and do not explicitly model rearrangements, they can obscure real variation, create false similarities, and affect phylogenetic inference. The importance of synteny block definition has long been recognized, as shown for example by discussions on breakpoint reuse, where different definitions of synteny blocks led to different estimates of rearrangement complexity in mammalian genomes. We present a formal framework for deriving synteny blocks directly from sequence data by partitioning genomic elements into blocks that do not contain breakpoints. A breakpoint is defined between a pair of genomes as an adjacency of shared elements that occurs in one genome but not in the other. Synteny blocks are therefore not allowed to span such boundaries, ensuring that rearrangements are not obscured. The framework is fully agnostic to the type of genomic element and applies to any genome representation expressed as sequences of elements, such as non-overlapping alignments, exact matches (MUMs/MEMs), k -mers, unitigs or minimizers. We formalize two optimization problems: minimizing the total genome length after replacement by synteny blocks (the Minimum-Length Synteny Block Problem) and minimizing the number of distinct blocks (the Minimum-Size Synteny Block Problem). We show that both problems are NP-hard in general. However, when blocks are required to be collinear and to contain a shared element, we provide a linear-time algorithm with respect to the number of input elements that simultaneously minimizes both objectives. The resulting method is simple, efficient, and produces large synteny blocks without obscuring rearrangements.
The authors' abstract, as published at the source. Journal of Computational Biology, 2026 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Genetics (Biochemistry, Genetics and Molecular Biology)
GeneticsBiochemistry, Genetics and Molecular Biology