in reply to Re^17: list of unique strings, also eliminating matching substrings
in thread list of unique strings, also eliminating matching substrings
Anyway when using C, my approach to start with the longest is for sure better and one can avoid allocation problems.
But I'm sure there are already much more efficient algorithms out there (something like presorting the input in a dynamic tree) and there is no need to reinvent the wheel.
And analyzing sequences is such a common task in bioinformatics, that I can hardly imagine that none of the BioPerl modules already include necessary routines. (just 50% inclusion redundancy is IMHO a very low estimation)
Thats very likely an xy question, because normally the next step is to find overlapping endings to reconstruct the original DNA.
Cheers Rolf
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^19: list of unique strings, also eliminating matching substrings
by BrowserUk (Patriarch) on Jun 03, 2011 at 17:46 UTC | |
|