in reply to Fast common substring matching
You're still not locating all equal-length LCSs.
P:\test>type duptest.dat >string1 AAAAAAAAAAAAAAAAAGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGTTTTTTTTTTTTTTTTT >string2 TTTTTTTTTTTTTTTTTCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCAAAAAAAAAAAAAAAAA >string3 TTTTTTTTTTTTTTTTTxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxAAAAAAAAAAAAAAAAA P:\test>gf duptest.gf 000:001 L[ 17] ( 0 47) 000:002 L[ 17] ( 0 47) 001:002 L[ 17] ( 0 0) Completed in 0.001205 Best match: >string1 - >string2. 17 characters starting at 0 and 47. Best match: >string1 - >string3. 17 characters starting at 0 and 47. Best match: >string2 - >string3. 17 characters starting at 0 and 0.
Each pairing contains two equal matches:
P:\test>484593-5 duptest.dat 000:001 L[017] (0000,0047)'TTTTTTTTTTTTTTTTT' (0047,0000)'AAAAAAAAAAAAAAAAA' 000:002 L[017] (0000,0000)'TTTTTTTTTTTTTTTTT' (0047,0047)'AAAAAAAAAAAAAAAAA' 001:002 L[017] (0000,0047)'AAAAAAAAAAAAAAAAA' (0047,0000)'TTTTTTTTTTTTTTTTT' 3 trials of duptest.dat ( 323us total), 107us/trial
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
Lingua non convalesco, consenesco et abolesco. -- Rule 1 has a caveat! -- Who broke the cabal?
"Science is about questioning the status quo. Questioning authority".
The "good enough" maybe good enough for the now, and perfection maybe unobtainable, but that should not preclude us from striving for perfection, when time, circumstance or desire allow.
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^2: Fast common substring matching
by GrandFather (Saint) on Aug 24, 2005 at 21:16 UTC | |
by BrowserUk (Patriarch) on Aug 25, 2005 at 01:02 UTC | |
by GrandFather (Saint) on Aug 25, 2005 at 01:31 UTC | |
by BrowserUk (Patriarch) on Aug 25, 2005 at 02:23 UTC | |
by GrandFather (Saint) on Aug 25, 2005 at 02:41 UTC | |
|
In Section
Cool Uses for Perl