Multiple pattern multiple (2^n) shaft parallel string matching

String searching is an important component of many problems including text editing data retrieval and symbol manipulation. Despite the use of indices for searching large amounts of text string searching may help in an information retrieval system. For example it may be used for filtering of potential matches or for searching retrieval terms that will be highlighted in the output. This book concentrates on retrieval of useful patterns using multiple pattern multiple (2n) shaft parallel string matching for genomics data.