> at least O(N^2)
A disagree, rather at most O(N*log N) for base64 input and a given max distance.
My algorithm based on Re: Suffix-prefix matching done right correctly calculated 1million overlaps with up to 6 errors in 2 seconds 53 sec , without being particularly tuned for speed.
You just have to avoid impossible matches right from the beginning and to bail out with the longest match.
Nobody needs all Levenshtein distances for all combinations.
Parameters:
my $n_tests = 1_000_000;
my $error= 1+ int rand 5;
my $A = rand64($n_err + 1 + rand 50);
my $B = rand64($n_err + 1 + rand 50);
my $prefix = rand64($n_err + 1 + rand 20);
> Took: 2.20354223251343 sec
update
sorry
> Took: 53.5716695785522
I forgot a bail-out flag.
I'll try now strings with 2000 bytes ...
update
my $n_tests = 100_000;
my $min_str = 2000;# 50;
my $max_overlap = 500; #20;
> Took: 56.4621770381927
as I said, it's still tuned for correctness not for performance
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|