Term Paper: Strings Matching

String matching is a fundamental string problem that has many important applications. For example, Internet search engines such as Google use string matching algorithms to find related documents that contain certain keywords. In this paper you are asked to research on such algorithms. Given a string P called the pattern and a longer string T called the text, the exact matching problem is to find all occurences, if any, of pattern P in text T. For example, if P=aba and T=bbabaxababay then P occurs in T starting at locations 3, 7, and 9.
 

Objectives

Contents

Requirements and Formats