Example: biology

String Matching Algorithms - Auckland

{ the state+character to state transition function For q 2Qand c , (q;c) = qcif and only if Otherwise (q;c) = psuch that is the longest su x of qc, which is a pre x of x(i.e. p2Q) Once the DFA is built, searching for the word xin a text y consists of parsing ywith the DFA beginning with the initial state q 0

Tags:

  Matching, Character, Algorithm, String, String matching algorithms

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Related search queries