Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

STRINGOLOGY
2008

favoriteEmaildiscussreport

123views Programming Languages» more STRINGOLOGY 2008»

Efficient Variants of the Backward-Oracle-Matching Algorithm

13 years 6 months ago

Efficient Variants of the Backward-Oracle-Matching Algorithm

Download www-igm.univ-mlv.fr

In this article we present two efficient variants of the BOM string matching algorithm which are more efficient and flexible than the original algorithm. We also present bit-parallel versions of them obtaining an efficient variant of the BNDM algorithm. Then we compare the newly presented algorithms with some of the most recent and effective string matching algorithms. It turns out that the new proposed variants are very flexible and achieve very good results, especially in the case of large alphabets.

Simone Faro, Thierry Lecroq

Real-time Traffic

BOM String | Efficient Variant | Programming Languages | String Matching Algorithms | STRINGOLOGY 2008 |

claim paper

Related Content

» Variants of Jump Flooding Algorithm for Computing Discrete Voronoi Diagrams

» Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut

» A secure variant of the Hill Cipher

» Efficient Variants of the ICP Algorithm

» A variant of the FordJohnson algorithm that is more space efficient

» Is LevenbergMarquardt the Most Efficient Optimization Algorithm for Implementing Bundle Ad...

» Efficient Mapping of Hardware Tasks on Reconfigurable Computers Using Libraries of Archite...

» Block variants of Hammarlings method for solving Lyapunov equations

» Algorithms for computing variants of the longest common subsequence problem

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	STRINGOLOGY
Authors	Simone Faro, Thierry Lecroq

Comments (0)