A Very Fast String Matching Algorithm Based on Condensed Alphabets

DOI10.1007/978-3-319-41168-2_6zbMath1476.68313OpenAlexW2499948330MaRDI QIDQ2830059

Simone Faro

Publication date: 9 November 2016

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-41168-2_6

zbMATH Keywords

string matchingtext processingexperimental algorithmsexact text analysis

Mathematics Subject Classification ID

Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)

Related Items (1)

Improved characters distance sampling for online and offline text searching

Cites Work

• Fast and flexible packed string matching
• Improved and self-tuned occurrence heuristics
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• Fast exact string matching algorithms
• Speeding up two string-matching algorithms
• The exact online string matching problem
• A Fast Suffix Automata Based Algorithm for Exact Online String Matching
• EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM
• Efficient randomized pattern-matching algorithms
• The Complexity of Pattern Matching for a Random String
• Fast Pattern Matching in Strings
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Very Fast String Matching Algorithm Based on Condensed Alphabets