Counting Parameterized Border Arrays for a Binary Alphabet
From MaRDI portal
Publication:3618600
DOI10.1007/978-3-642-00982-2_36zbMath1234.68476OpenAlexW1589909894MaRDI QIDQ3618600
Masayuki Takeda, Hideo Bannai, Shunsuke Inenaga, Tomohiro I.
Publication date: 2 April 2009
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_36
Related Items
Validating the Knuth-Morris-Pratt failure function, fast and online ⋮ The structural border array ⋮ Recognizing union-find trees is NP-complete ⋮ Variations of the parameterized longest previous factor ⋮ Compressed parameterized pattern matching ⋮ Combinatorics on partial word borders ⋮ Indeterminate string inference algorithms ⋮ Verifying and enumerating parameterized border arrays ⋮ Inferring strings from suffix trees and links on a binary alphabet ⋮ A prefix array for parameterized strings ⋮ Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info ⋮ A brief history of parameterized matching problems ⋮ A suffix tree or not a suffix tree?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiple matching of parameterized patterns
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Efficient parameterized string matching
- Parameterized matching with mismatches
- Counting suffix arrays and strings
- Periodicity and repetitions in parameterized strings
- The smallest automaton recognizing the subwords of a text
- Counting distinct strings
- Alphabet dependence in parameterized matching
- Generalization of a suffix tree for RNA structural pattern matching
- Parameterized pattern matching: Algorithms and applications
- Searching subsequences
- Suffix Arrays: A New Method for On-Line String Searches
- Approximate parameterized matching
- Efficient string matching
- Words over an ordered alphabet and suffix permutations
- Mathematical Foundations of Computer Science 2003
- Combinatorial Pattern Matching
