logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Compressed consecutive pattern matching

delete2025-08-28
delete0
delete
OA
AI
P
Paweł Gawrychowski
T
Tatiana Starikovskaya
T
Teresa Anna Steiner *
DOI：10.1016/j.is.2025.102607delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
• Algorithm for finding consecutive occurrences of two patterns in a compressed string without decompressing. • Optimal asymptotic runtime. • Strategy extends to finding gapped consecutive occurrences and top- k closest consecutive occurrences.
Keywords:
pattern matching
compressed string
consecutive occurrences
gapped patterns
top-k occurrences

Journal

Enterprise Information Systems cover
Enterprise Information Systems
IF:
3.9
Papers:
2.8K
Citations:
1.8K

Organization

U
University of Wrocław
Scholars:
125
Papers: 66
Citations: 0
P
psl research university
Scholars:
312
Papers: 118
Citations: 0
U
University of Southern Denmark
Scholars:
2.1W
Papers: 2.0W
Citations: 2.9W
researcher View more organizations