Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[HTML][HTML] Maximal degenerate palindromes with gaps and mismatches
A degenerate symbol over an alphabet Σ is a non-empty subset of Σ, and a sequence of
such symbols is a degenerate string. We investigate the exact computation of maximal …
such symbols is a degenerate string. We investigate the exact computation of maximal …
Matching patterns with variables
A pattern α α (ie, a string of variables and terminals) matches a word w, if w can be obtained
by uniformly replacing the variables of α α by terminal words. The respective matching …
by uniformly replacing the variables of α α by terminal words. The respective matching …
Computing a longest common palindromic subsequence
The longest common subsequence (LCS) problem is a classic and well-studied problem in
computer science. Palindrome is a word which reads the same forward as it does backward …
computer science. Palindrome is a word which reads the same forward as it does backward …
Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes: Finding All Maximal α-gapped Repeats and Palindromes in Optimal …
An α-gapped repeat (α≥ 1) in a word w is a factor uvu of w such that| uv|≤ α| u|; the two
occurrences of u are called arms of this α-gapped repeat. An α-gapped repeat is called …
occurrences of u are called arms of this α-gapped repeat. An α-gapped repeat is called …
Computing palindromic factorizations and palindromic covers on-line
A palindromic factorization of a string w is a factorization of w consisting only of palindromic
substrings of w. In this paper, we present an on-line O (n log n)-time O (n)-space algorithm to …
substrings of w. In this paper, we present an on-line O (n log n)-time O (n)-space algorithm to …
Longest common extensions with wildcards: Trade-off and applications
G Bathie, P Charalampopoulos… - ar** LZ77 factorization and LZ78 substring compression queries with suffix trees
D Köppl - Algorithms, 2021 - mdpi.com
We present algorithms computing the non-overlap** Lempel–Ziv-77 factorization and the
longest previous non-overlap** factor table within small space in linear or near-linear time …
longest previous non-overlap** factor table within small space in linear or near-linear time …
Optimal Bounds for Computing -gapped Repeats
Abstract Following (Kolpakov et al., 2013; Gawrychowski and Manea, 2015), we continue
the study of α α-gapped repeats in strings, defined as factors uvu with| uv| ≤ α| u|| uv|≤ α| u …
the study of α α-gapped repeats in strings, defined as factors uvu with| uv| ≤ α| u|| uv|≤ α| u …