Re: write a new module for suffix trees?
- From: John Bokma <john@xxxxxxxxxxxxxxx>
- Date: 3 Apr 2008 22:20:11 GMT
"Heiko Eißfeldt" <donotreply@xxxxxxxxxxxxxxxxxxxxxx> wrote:
Hello,
for the purpose of detecting code copies in Perl sources,
I would like to use a suffix tree with a method to get
all longest repeated substrings (lrs).
I had a look at
1. Tree::Suffix, which looks good at first sight.
It is a wrapper around the c library libstree.
But libstree has a pretty buggy last version, and
the lib author does not respond to patches and email.
It has a lrs function, but it is buggy (incomplete).
I have patches for some of the bugs, but not all.
Can you fork this lib?
if so, would it be possible to make Tree::Suffix use your fork.
--
John
http://johnbokma.com/perl/
.
- Follow-Ups:
- Re: write a new module for suffix trees?
- From: Heiko Eißfeldt
- Re: write a new module for suffix trees?
- References:
- write a new module for suffix trees?
- From: Heiko Eißfeldt
- write a new module for suffix trees?
- Prev by Date: write a new module for suffix trees?
- Next by Date: Re: write a new module for suffix trees?
- Previous by thread: write a new module for suffix trees?
- Next by thread: Re: write a new module for suffix trees?
- Index(es):
Relevant Pages
|
|
