Efficient parameterized string matching

DOI10.1016/J.IPL.2006.06.009zbMATH Open1185.68282OpenAlexW2154864405MaRDI QIDQ845838FDOQ845838

Authors: Kimmo Fredriksson, Maxim Mozgovoy 

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.06.009

Recommendations

• Fast parameterized matching with \(q\)-grams
• Sublinear Algorithms for Parameterized Matching
• Algorithms – ESA 2004
• Parameterized pattern matching: Algorithms and applications
• Parameterized matching with mismatches

zbMATH Keywords

algorithmsbit-parallelismsuffix automatonparameterized string matching

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Searching and sorting (68P10)

Cites Work

• Efficient string matching
• Algorithms on Strings, Trees and Sequences
• Title not available (Why is that?)
• Speeding up two string-matching algorithms
• A fast string searching algorithm
• Suffix Arrays: A New Method for On-Line String Searches
• Title not available (Why is that?)
• The smallest automaton recognizing the subwords of a text
• Alphabet dependence in parameterized matching
• Title not available (Why is that?)
• Multiple matching of parameterized patterns
• The Complexity of Pattern Matching for a Random String
• Faster suffix tree construction with missing suffix links
• Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
• Title not available (Why is that?)

Cited In (22)

• The structural border array
• Generalized String Matching
• Fast and flexible packed string matching
• Secure parameterized pattern matching
• Simpler FM-index for parameterized string matching
• Parameterized searching with mismatches for run-length encoded strings
• The finite automata approaches in stringology
• Alphabet dependence in parameterized matching
• Computing the parameterized Burrows-Wheeler transform online
• Parameterized matching on non-linear structures
• Weighted approximate parameterized string matching
• Position heaps for parameterized strings
• Space-efficient dictionaries for parameterized and order-preserving pattern matching
• Fast parameterized matching with \(q\)-grams
• Efficient string-matching allowing for non-overlapping inversions
• Counting Parameterized Border Arrays for a Binary Alphabet
• A brief history of parameterized matching problems
• Verifying and enumerating parameterized border arrays
• A prefix array for parameterized strings
• Algorithms – ESA 2004
• Efficient parameterized pattern matching in sublinear space
• Title not available (Why is that?)

This page was built for publication: Efficient parameterized string matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845838)