lecture_notes:04-22-2011
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
lecture_notes:04-22-2011 [2011/06/09 23:56] eyliaw |
lecture_notes:04-22-2011 [2011/06/09 23:57] eyliaw [Searching] |
||
|---|---|---|---|
| Line 49: | Line 49: | ||
| | 6 | LO$OOG | 1 | 1 | 3 | | | 6 | LO$OOG | 1 | 1 | 3 | | ||
| | 7 | LO$OOGG | 2 | 1 | 3 | | | 7 | LO$OOGG | 2 | 1 | 3 | | ||
| - | + | ||
| - | There are then two recursive formulas to find the start and end positions of a substring: | + | There are then two recursive formulas to find the start and end positions of a substring. |
| End R_(aW) = C(a) + O(a,R_(W) - 1) + 1 or 1 if W is the empty string | End R_(aW) = C(a) + O(a,R_(W) - 1) + 1 or 1 if W is the empty string | ||
| Start R-(aW) = C(a) + O(a,R-(W)) or n - 1 if W is the empty string | Start R-(aW) = C(a) + O(a,R-(W)) or n - 1 if W is the empty string | ||
lecture_notes/04-22-2011.txt · Last modified: 2015/08/09 23:06 by 212.129.31.47
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported
