Titlebook: Combinatorial Pattern Matching; 25th Annual Symposiu Alexander S. Kulikov,Sergei O. Kuznetsov,Pavel Pev Conference proceedings 2014 Springe

Minatory

Ourania Rizou,Aikaterini Klonaritant in the context of binary jumbled pattern matching. In this paper we present an efficient algorithm for exhaustively listing the prefix normal words with a fixed length. The algorithm is based on the fact that the language of prefix normal words is a bubble language, a class of binary languages

Constant

Ourania Rizou,Aikaterini Klonarice of a pattern which is enlarged proportionally by some scale . within a larger text. Permutation matching is the problem of finding all substrings within a text where the character statistics of the substring and the pattern are the same. Permutation matching is easy, while scaled matching require

Freeze

減去

Prosaic

反復(fù)拉緊

無意

ascend

https://doi.org/10.1007/978-3-662-62153-0mitted to Theor. Comp. Sci.), where instead of looking for an exact copy of the pattern, we only require that the relative order between the elements is the same. In our variant, we additionally allow up to . mismatches between the pattern of length . and the text of length ., and the goal is to con

有機(jī)體

MILK

https://doi.org/10.1007/978-981-16-2019-5ce algorithm to compute smallest palindromic factorizations of all prefixes of ., where . is the length of a given string .. We then show how to extend this algorithm to compute smallest maximal palindromic factorizations of all prefixes of ., consisting only of maximal palindromes (non-extensible p