Re: [FWP] Quick hack for common length

[Abhijit Menon-Sen <ams@wiw.org>]

At 2001-06-25 16:20:09, clintp@geeksalad.org wrote:
>
> In #perl today, we were looking at a longest substrings problem,
> utilizing a suffix tree solution.

Todd Olson spoke about this at YAPC 19100:

<URL:http://www.people.cornell.edu/pages/tco2/papers/common_leading_substring/>

(For what it's worth, the $a^$b =~ m/^\0+/ solution was the fastest he
found, as well.)

- ams

==== Want to unsubscribe from Fun With Perl?  Well, if you insist...
==== Send email to <fwp-request@technofile.org> with message _body_
====   unsubscribe