A taxonomy of some right-to-left string-matching algorithms

DOI10.1007/978-3-642-11999-6_6MaRDI QIDQ3557096zbMATH OpenOpenAlexFDO

Authors

Publication date 27 April 2010

Published in Functional and Constraint Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11999-6_6

Mathematics Subject Classification ID

Logic programming (68N17) Algorithms on strings (68W32)

Recommendations

• A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
• A taxonomy of sublinear multiple keyword pattern matching algorithms
• Disjunctive partial deduction of a right-to-left string-matching algorithm
• Fastest Pattern Matching in Strings
• Fast and flexible string matching by combining bit-parallelism and suffix automata

Cited in

(1)

• A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms

This page was built for publication: A taxonomy of some right-to-left string-matching algorithms

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