Verifying and enumerating parameterized border arrays
type: Item
instance of: scholarly article
title: Verifying and enumerating parameterized border arrays
zbMATH Open document ID: 1228.68067
author: Shunsuke Inenaga
author: Hideo Bannai
author: Masayuki Takeda
author: Tomohiro I
published in: Theoretical Computer Science
publication date: 2011-12-07T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 5987015
zbMATH Keywords: string matching
zbMATH Keywords: parameterized pattern matching
zbMATH Keywords: reverse engineering
zbMATH Keywords: enumeration algorithms
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.09.008
OpenAlex ID: W2036743346
cites work: Parameterized pattern matching: Algorithms and applications
cites work: Efficient parameterized string matching
cites work: Generalization of a suffix tree for RNA structural pattern matching
cites work: Alphabet dependence in parameterized matching
cites work: Q4886089
cites work: Q4252748
cites work: Combinatorial Pattern Matching
cites work: Algorithms – ESA 2004
cites work: Parameterized matching with mismatches
cites work: Periodicity and repetitions in parameterized strings
cites work: Lightweight Parameterized Suffix Array Construction
cites work: Multiple matching of parameterized patterns
cites work: Efficient string matching
cites work: Words over an ordered alphabet and suffix permutations
cites work: Mathematical Foundations of Computer Science 2003
cites work: Counting suffix arrays and strings
cites work: REVERSE ENGINEERING PREFIX TABLES
cites work: Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
cites work: Cover Array String Reconstruction
cites work: Reversing Longest Previous Factor Tables is Hard
cites work: Q4795855
cites work: Q3370008
cites work: Counting distinct strings
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: A fast string searching algorithm
cites work: Fast Pattern Matching in Strings
cites work: An on-line string superprimitivity test
cites work: A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
cites work: The smallest automaton recognizing the subwords of a text
cites work: Searching subsequences
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: On-line construction of suffix trees
cites work: Inferring strings from suffix trees and links on a binary alphabet
cites work: Computing longest previous factor in linear time and applications
cites work: Counting Parameterized Border Arrays for a Binary Alphabet
cites work: Verifying a Parameterized Border Array in O(n 1.5) Time
DOI: 10.1016/J.TCS.2011.09.008
description: scientific article; zbMATH DE number 5987015