Practical KMP/BM style pattern-matching on indeterminate strings

DOI10.1016/J.DAM.2025.02.032MaRDI QIDQ6992289zbMATH OpenFDO

Authors Hossein Dehghani, Thierry Lecroq, Neerja Mhaskar, W. F. Smyth

Publication date 28 April 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.02.032

zbMATH Keywords

Boyer-Moore algorithmbrute force algorithmindeterminate encodingindeterminate patternKnuth-Morris-Pratt algorithmpattern matching

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites work

• A fast string searching algorithm
• A universal compiler system based on production rules
• Algorithmic Combinatorics on Partial Words
• An adaptive hybrid pattern-matching algorithm on indeterminate strings
• Comparing Degenerate Strings
• Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform
• Fast Pattern Matching in Strings
• Fast pattern-matching on indeterminate strings
• Generalized String Matching
• scientific article; zbMATH DE number 3471577 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 2052918 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• On-line pattern matching on similar texts
• Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.

This page was built for publication: Practical KMP/BM style pattern-matching on indeterminate strings

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