PAMA: A FAST STRING MATCHING ALGORITHM

DOI10.1142/S0129054106003875MaRDI QIDQ5291301zbMATH OpenOpenAlexFDO

Authors Shiyong Lu, Feng Cao, Yi Lu

Publication date 10 May 2006

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054106003875

zbMATH Keywords

pattern matching

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 1982175
• Combinatorial Pattern Matching
• Fast-search algorithms: new efficient variants of the Boyer-Moore pattern-matching algorithm
• Fastest Pattern Matching in Strings
• Fast string matching for DNA sequences

Cites work

• A fast string searching algorithm
• A unifying look at the Apostolico--Giancarlo string-matching algorithm
• Algorithms on Strings, Trees and Sequences
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 5725179 (Why is no real title available?)

Cited in

(4)

• PAMA
• Fast string matching for DNA sequences
• A memetic algorithm to schedule planned maintenance for the national grid
• An aggressive algorithm for multiple string matching

This page was built for publication: PAMA: A FAST STRING MATCHING ALGORITHM

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