Application of Suffix Arrays to Detect Repeats in Genomic Sequences

In recent years, genomes of higher eukaryotes without gaps have become available to researchers. These are the so-called T2T (telomere-to-telomere) assemblies. Compared to the reference genomes studied before the T2T era, they consist of a minimal number of undefined regions or do not contain them at all. Comprehensive information on telomeres, centromeres, ribosomal RNA, complex chromosomal regions and transposon elements has now become available. New computational approaches are needed to find all repeats in genomic sequences without exception. In this article, we described some of the algorithmic problems that we solved in the course of our work on the technology of de novo detection of long fuzzy repeat fragments in huge symbolic arrays that represent genomic sequences. Approaches that use the k-mer composition of the analyzed sequence are promising. The article discusses the importance of choosing an adequate value of k, since the result of the analisys depends on this key parameter of the algorithm.

Authors

Publication Details

Journal
Mathematical Biology and Bioinformatics
Published
2025-08-16
DOI
https://doi.org/10.17537/2025.20.348
Primary Topic
Algorithms and Data Compression
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Application of Suffix Arrays to Detect Repeats in Genomic Sequences

Н.Н. Назипова
Mathematical Biology and Bioinformatics
Algorithms and Data Compression
article

Application of Suffix Arrays to Detect Repeats in Genomic Sequences

Н.Н. Назипова
article en

Abstract

In recent years, genomes of higher eukaryotes without gaps have become available to researchers. These are the so-called T2T (telomere-to-telomere) assemblies. Compared to the reference genomes studied before the T2T era, they consist of a minimal number of undefined regions or do not contain them at all. Comprehensive information on telomeres, centromeres, ribosomal RNA, complex chromosomal regions and transposon elements has now become available. New computational approaches are needed to find all repeats in genomic sequences without exception. In this article, we described some of the algorithmic problems that we solved in the course of our work on the technology of de novo detection of long fuzzy repeat fragments in huge symbolic arrays that represent genomic sequences. Approaches that use the k-mer composition of the analyzed sequence are promising. The article discusses the importance of choosing an adequate value of k, since the result of the analisys depends on this key parameter of the algorithm.

Mathematical Biology and BioinformaticsVol. 20(2)
Openalex Percentile: Top 88%
Algorithms and Data Compression
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.

Application of Suffix Arrays to Detect Repeats in Genomic Sequences — Н.Н. Назипова · Mathematical Biology and Bioinformatics (2025) | TGRS Research Map | TGRS