Strings 2008 2 2: Difference between revisions
From MDWiki
Jump to navigationJump to search
ThomasHuber (talk | contribs) No edit summary |
ThomasHuber (talk | contribs) No edit summary |
||
| Line 9: | Line 9: | ||
* Search for [http://en.wikipedia.org/wiki/PCR PCR] primer matches | * Search for [http://en.wikipedia.org/wiki/PCR PCR] primer matches | ||
The following | The following sections describe basic search algorithms to locate a DNA fragment in a genome. But remember that the same concepts can be applied to any pattern/string pair. | ||
Revision as of 01:31, 10 January 2008
Pattern search
Text searching is an example of a simple problem with different algorithmic approaches. In practice most commonly one needs to check if a pattern is contained in a larger string, and if so at which location.
Despite the simplicity of the problem, it is frequently used in bioinformatics. Examples:
- Find start (ATG) and stop (TAA, TGA and TGG) codons
- Find restriction enzyme cutting sites
- Search for PCR primer matches
The following sections describe basic search algorithms to locate a DNA fragment in a genome. But remember that the same concepts can be applied to any pattern/string pair.
--ThomasHuber 12:28, 10 January 2008 (EST)
