Algorithm to find multiple string matches

by

Don´t reinvent the wheel

This problem has been intensively researched. Curiously, the best algorithms for searching ONE pattern/string do not extrapolate easily to multi-string matching.

The “grep” family implement the multi-string search in a very efficient way. If you can use them as external programs, do it.

In case you really need to implement the algorithm, I think the fastest way is to reproduce what agrep does (agrep excels in multi-string matching!). Here are the source and executable files.

And here you will find a paper describing the algorithms used, the theoretical background, and a lot of information and pointers about string matching.

A note of caution: multiple-string matching have been heavily researched by people like Knuth, Boyer, Moore, Baeza-Yates, and others. If you need a really fast algorithm don’t hesitate on standing on their broad shoulders. Don’t reinvent the wheel.

More Related Contents:

  1. What should be the algorithm of the below statement?
  2. Finding all possible combinations of numbers to reach a given sum
  3. Reverse the ordering of words in a string
  4. How do I search for a number in a 2d array sorted left to right and top to bottom?
  5. Generate an integer that is not among four billion given ones
  6. Nearest neighbors in high-dimensional data?
  7. Backtracking in A star
  8. Fast algorithm for searching for substrings in a string
  9. how to calculate binary search complexity
  10. Binary Search in Array
  11. What string similarity algorithms are there?
  12. Find the first un-repeated character in a string
  13. Algorithm to find two repeated numbers in an array, without sorting
  14. Fast Algorithm to Quickly Find the Range a Number Belongs to in a Set of Ranges?
  15. O(klogk) time algorithm to find kth smallest element from a binary heap
  16. Approximate string matching algorithms
  17. Print the biggest K elements in a given heap in O(K*log(K))?
  18. Word comparison algorithm
  19. Finding groups of similar strings in a large set of strings
  20. Find local minimum in n x n matrix in O(n) time
  21. Breadth First Search and Depth First Search
  22. What is the difference between Linear search and Binary search?
  23. Explanation of Algorithm for finding articulation points or cut vertices of a graph
  24. Comparison-based ranking algorithm
  25. How to convert decimal fractions to hexadecimal fractions?
  26. Convert recursion to tail recursion
  27. Finding connected components of adjacency matrix graph
  28. Stable separation for two classes of elements in an array
  29. Cache Invalidation — Is there a General Solution?
  30. Distance from a point to a polygon

Leave a Comment