Unbiased anchors for reliable genome-wide synteny detection

Orthology inference lies at the foundation of comparative genomics research. The correct identification of loci which descended from a common ancestral sequence is not only complicated by sequence divergence but also duplication and other genome rearrangements. The conservation of gene order, i.e. synteny, is used in conjunction with sequence similarity as an additional factor for orthology determination. Current approaches, however, rely on genome annotations and are therefore limited. Here we present an annotation-free approach and compare it to synteny analysis with annotations. We find that our approach works better in closely related genomes whereas there is a better performance with annotations for more distantly related genomes. Overall, the presented algorithm offers a useful alternative to annotation-based methods and can outperform them in many cases.

Authors

Institutions

Publication Details

Journal
Algorithms for Molecular Biology
Published
2025-04-05
DOI
https://doi.org/10.1186/s13015-025-00275-9
Citations
2
Primary Topic
Genomics and Phylogenetic Studies
Type
article
Field-Weighted Citation Impact
1.61

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Unbiased anchors for reliable genome-wide synteny detection

Peter F. Stadler, Karl K. Käther, Steffen Lemke, Andreas Remmel
2 citations
Algorithms for Molecular Biology
Genomics and Phylogenetic Studies
1.61
article

Unbiased anchors for reliable genome-wide synteny detection

Peter F. Stadler, Karl K. Käther, Steffen Lemke, Andreas Remmel
article en
2 citations

Abstract

Orthology inference lies at the foundation of comparative genomics research. The correct identification of loci which descended from a common ancestral sequence is not only complicated by sequence divergence but also duplication and other genome rearrangements. The conservation of gene order, i.e. synteny, is used in conjunction with sequence similarity as an additional factor for orthology determination. Current approaches, however, rely on genome annotations and are therefore limited. Here we present an annotation-free approach and compare it to synteny analysis with annotations. We find that our approach works better in closely related genomes whereas there is a better performance with annotations for more distantly related genomes. Overall, the presented algorithm offers a useful alternative to annotation-based methods and can outperform them in many cases.

Algorithms for Molecular BiologyVol. 20(1)
University of Hohenheim (DE), University of Vienna (AT), Santa Fe Institute (US), Copenhagen Business School (DK), Universidad Nacional de Colombia (CO), Telstra (Australia) (AU), Max Planck Institute for Mathematics in the Sciences (DE)
Universität Leipzig
Life in Land
Openalex Percentile: Top 18%
Genomics and Phylogenetic Studies
1.61
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.