A NOVEL ALGORITHM FOR SOLVING THE STRING MATCHING PROBLEM

DOI10.1142/S1469026806002040MaRDI QIDQ5434994zbMATH OpenFDO

Authors Ibrahiem M. M. El Emary, Mohammed S. M. Jaber

Publication date 14 January 2008

Published in International Journal of Computational Intelligence and Applications (Search for Journal in Brave)

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

zbMATH Keywords

pattern matching

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• A New String Matching Algorithm
• scientific article; zbMATH DE number 4119620
• An Improved Algorithm For Approximate String Matching
• An approximate string-matching algorithm
• scientific article; zbMATH DE number 1555988
• Algorithms for approximate string matching
• scientific article; zbMATH DE number 2247683
• A randomized algorithm for approximate string matching
• An 0(1) time algorithm for string matching
• scientific article; zbMATH DE number 975393

Cites work

• scientific article; zbMATH DE number 3633709 (Why is no real title available?)
• On-line string matching algorithms: survey and experimental results

Cited in

(3)

• A very fast string matching algorithm based on condensed alphabets
• A memetic algorithm to schedule planned maintenance for the national grid
• Exact pattern matching. Current achievements and research

This page was built for publication: A NOVEL ALGORITHM FOR SOLVING THE STRING MATCHING PROBLEM

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