science, the longest repeated substring problem is the problem of finding the longest substring of a string that occurs at least twice. This problem can be...

LZ77 factorization in O ( n ) {\displaystyle O(n)} time. The longest repeated substring problem for a string S {\displaystyle S} of length n {\displaystyle...

operations can be performed quickly, such as locating a substring in S {\displaystyle S} , locating a substring if a certain number of mistakes are allowed, and...

numbers Longest common substring problem: find the longest string (or strings) that is a substring (or are substrings) of two or more strings Substring search...

entire word has been read completely. It is possible to find the longest palindromic substring of a given input string in linear time. The palindromic density...

{\textstyle n} -string and let S [ i , j ] {\displaystyle S[i,j]} denote the substring of S {\displaystyle S} ranging from i {\displaystyle i} to j {\displaystyle...

case here is gravely pathological: both the text string and substring are composed of a repeated single character, such as t="AAAAAAAAAAA", and s="AAA")....

looping with PERFORM UNTIL EXIT SUBSTITUTE intrinsic function allowing for substring substitution of different length CONVERT function for base-conversion...

a repeated syllable (i.e. ba, ba, ba) the span is reduced (articulatory suppression effect). Rhythm of presentation: Closely related to the problem of...

covered in several variations including edit distance and the longest common subsequence problem. The book concludes with advanced topics including two-dimensional...

the riddle of Chinese characters, where partial characters instead of substrings are clued and combined. Clues given to the solver are based on various...