Counting Parameterized Border Arrays for a Binary Alphabet


The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alphabet with which the pattern can be transformed into a substring of the text. A parameterized border array (p-border array) is an analogue of a border array of a standard string… (More)
DOI: 10.1007/978-3-642-00982-2_36

3 Figures and Tables


  • Presentations referencing similar topics