Much research is being performed on this, and the area has progressed from being simply algorithmic in content to one that has become complex with significant applications. Applications are being extended to fields that include molecular biology and genetic engineering, as well as information retrieval, pattern recognition, biometric authentication (such as speech and speaker recognition, feature recognition, and so forth), program compilation, data compression, program analysis, and system security. Summary and Conclusions

String-searching algorithms are used for matching words, patterns, and concepts from string to text. In order to be as effective as possible, various patterns have been devised. There are those that work according to comparison that simply slide the words -- or pattern -- along the text and attempt to find comparisons. Others use approximate string matching where a pattern is sought. This is faster but allows errors in text to creep in. Other algorithms are formatted on finding the similarity of two strings. Here, for instance, the Bittap algorithm transforms one string into another by converting into numeric value.

With...

String-searching algorithms are invaluable to all fields of human knowledge from basic Internet searching to genetic engineering and has significant applications to each and every component of our world of knowledge.
References

Book Rags String-Matching Algorithms. http://www.bookrags.com/research/string-matching-algorithms-wcs/

Boyer, R.S., & Moore, J.S. (1977). A fast string searching algorithm, Carom. ACM, 20, 262 -- 272.

Cormen, T.H. et al. (2002). Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. Chapter 32: String Matching, pp.906 -- 932.

Karp, R. & Rabin, M.O. (1987). Efficient randomized pattern-matching algorithms. 31. http://www.research.ibm.com/journal/rd/312/ibmrd3102P.pdf.

Sabin. T. String-matching algorithms. http://caveshadow.com/CS566/Sabin%20M.%20Thomas%20%20String%20Matching%20Algorithms.ppt