Verifying and enumerating parameterized border arrays
From MaRDI portal
Publication:650937
DOI10.1016/j.tcs.2011.09.008zbMath1228.68067OpenAlexW2036743346MaRDI QIDQ650937
Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Tomohiro I.
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.09.008
Related Items
Universal Reconstruction of a String, Validating the Knuth-Morris-Pratt failure function, fast and online, Recognizing union-find trees is NP-complete, Combinatorics on partial word borders, Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info, A brief history of parameterized matching problems, Universal reconstruction of a string, A suffix tree or not a suffix tree?, String inference from longest-common-prefix array
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inferring strings from suffix trees and links on a binary alphabet
- Multiple matching of parameterized patterns
- Efficient parameterized string matching
- Parameterized matching with mismatches
- Counting suffix arrays and strings
- Periodicity and repetitions in parameterized strings
- Computing longest previous factor in linear time and applications
- The smallest automaton recognizing the subwords of a text
- An on-line string superprimitivity test
- Counting distinct strings
- Alphabet dependence in parameterized matching
- Generalization of a suffix tree for RNA structural pattern matching
- On-line construction of suffix trees
- Parameterized pattern matching: Algorithms and applications
- Searching subsequences
- A fast string searching algorithm
- Suffix Arrays: A New Method for On-Line String Searches
- Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
- Verifying a Parameterized Border Array in O(n 1.5) Time
- Cover Array String Reconstruction
- Counting Parameterized Border Arrays for a Binary Alphabet
- Lightweight Parameterized Suffix Array Construction
- Efficient string matching
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- A Space-Economical Suffix Tree Construction Algorithm
- Fast Pattern Matching in Strings
- Words over an ordered alphabet and suffix permutations
- Reversing Longest Previous Factor Tables is Hard
- REVERSE ENGINEERING PREFIX TABLES
- Mathematical Foundations of Computer Science 2003
- Algorithms – ESA 2004
- Combinatorial Pattern Matching
