Re: divide & conquer algorithm to implement string matching
- From: CBFalconer <cbfalconer@xxxxxxxxx>
- Date: Wed, 30 May 2007 11:17:35 -0400
misterio wrote:
The following is an example execution of the program :
sequence[0] = 0110
sequence[3] = 0101
sequence[6] = 1100
sequence[9] = 0011
sequence[12] = 1010
sequence[15] = 0110
sequence[1] = 1101
sequence[4] = 1011
sequence[7] = 1000
sequence[10] = 0110
sequence[13] = 0101
sequence[16] = 1100
sequence[2] = 1010
sequence[5] = 0110
sequence[8] = 0001
sequence[11] = 1101
sequence[14] = 1011
number of sequences found = 4
Brilliantly opaque. This message has virtually zero chance of
being understood anywhere, lacking any quotation.
--
<http://www.cs.auckland.ac.nz/~pgut001/pubs/vista_cost.txt>
<http://www.securityfocus.com/columnists/423>
<http://www.aaxnet.com/editor/edit043.html>
<http://kadaitcha.cx/vista/dogsbreakfast/index.html>
cbfalconer at maineline dot net
--
Posted via a free Usenet account from http://www.teranews.com
.
- Follow-Ups:
- Re: divide & conquer algorithm to implement string matching
- From: misterio
- Re: divide & conquer algorithm to implement string matching
- From: Richard Harter
- Re: divide & conquer algorithm to implement string matching
- References:
- divide & conquer algorithm to implement string matching
- From: misterio
- Re: divide & conquer algorithm to implement string matching
- From: Logan Shaw
- Re: divide & conquer algorithm to implement string matching
- From: misterio
- Re: divide & conquer algorithm to implement string matching
- From: misterio
- divide & conquer algorithm to implement string matching
- Prev by Date: Re: divide & conquer algorithm to implement string matching
- Next by Date: Re: divide & conquer algorithm to implement string matching
- Previous by thread: Re: divide & conquer algorithm to implement string matching
- Next by thread: Re: divide & conquer algorithm to implement string matching
- Index(es):
Relevant Pages
|