Efficient parameterized string matching
type: Item
instance of: scholarly article
title: Efficient parameterized string matching
zbMATH Open document ID: 1185.68282
author: Kimmo Fredriksson
author: Maxim Mozgovoy
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5664698
zbMATH Keywords: algorithms
zbMATH Keywords: parameterized string matching
zbMATH Keywords: bit-parallelism
zbMATH Keywords: suffix automaton
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.06.009
OpenAlex ID: W2154864405
cites work: Efficient string matching
cites work: Alphabet dependence in parameterized matching
cites work: Q4028877
cites work: Q4886089
cites work: Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
cites work: The smallest automaton recognizing the subwords of a text
cites work: A fast string searching algorithm
cites work: Faster suffix tree construction with missing suffix links
cites work: Speeding up two string-matching algorithms
cites work: Q4849531
cites work: Algorithms on Strings, Trees and Sequences
cites work: Multiple matching of parameterized patterns
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: Q4534878
cites work: The Complexity of Pattern Matching for a Random String
DOI: 10.1016/J.IPL.2006.06.009
description: scientific article; zbMATH DE number 5664698