Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Comment on

( #3333=superdoc: print w/ replies, xml ) Need Help??

The same benchmark as above but excluding the two slowest/erroneous algorithms, allows me to run 1000 strings looking for common substrings of lengths 2 .. 6 and get more digestable results:

c:\test>608174-b -N=1000 -LENGTH=2 Rate BH2 BH1 MN L~R Buk BH2 2.57/s -- -8% -52% -73% -86% BH1 2.81/s 9% -- -48% -70% -85% MN 5.41/s 110% 93% -- -43% -71% L~R 9.46/s 268% 237% 75% -- -50% Buk 18.9/s 635% 574% 249% 100% -- ---- BH2 => 14 L~R => 14 Buk => 14 BH1 => 14 MN => 14 c:\test>608174-b -N=1000 -LENGTH=3 Rate BH1 MN BH2 L~R Buk BH1 2.51/s -- -28% -54% -69% -81% MN 3.50/s 40% -- -36% -57% -73% BH2 5.47/s 118% 56% -- -33% -58% L~R 8.20/s 227% 134% 50% -- -38% Buk 13.2/s 425% 276% 141% 61% -- ---- BH2 => 10 L~R => 10 Buk => 10 BH1 => 10 MN => 10 c:\test>608174-b -N=1000 -LENGTH=4 Rate BH1 MN L~R BH2 Buk BH1 2.35/s -- -23% -70% -73% -80% MN 3.05/s 30% -- -62% -64% -75% L~R 7.92/s 237% 160% -- -8% -34% BH2 8.58/s 265% 182% 8% -- -28% Buk 12.0/s 410% 293% 51% 40% -- ---- BH2 => 6 L~R => 6 Buk => 6 BH1 => 6 MN => 6 c:\test>608174-b -N=1000 -LENGTH=5 Rate BH1 MN L~R BH2 Buk BH1 2.38/s -- -20% -71% -77% -80% MN 2.98/s 25% -- -64% -71% -75% L~R 8.25/s 246% 177% -- -21% -32% BH2 10.4/s 337% 249% 26% -- -14% Buk 12.1/s 408% 307% 47% 16% -- ---- BH2 => 1 L~R => 1 Buk => 1 BH1 => 1 MN => 1 c:\test>608174-b -N=1000 -LENGTH=6 Rate BH1 MN L~R BH2 Buk BH1 2.45/s -- -19% -70% -78% -80% MN 3.02/s 23% -- -64% -73% -76% L~R 8.29/s 238% 175% -- -26% -34% BH2 11.2/s 358% 272% 35% -- -10% Buk 12.5/s 410% 314% 51% 11% -- ---- BH2 => 0 L~R => 0 Buk => 0 BH1 => 0 MN => 0

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.

In reply to Re^2: Challenge: Fast Common Substrings by BrowserUk
in thread Challenge: Fast Common Substrings by Limbic~Region

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":



  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • Outside of code tags, you may need to use entities for some characters:
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.
  • Log In?
    Username:
    Password:

    What's my password?
    Create A New User
    Chatterbox?
    and the web crawler heard nothing...

    How do I use this? | Other CB clients
    Other Users?
    Others making s'mores by the fire in the courtyard of the Monastery: (10)
    As of 2014-12-25 23:45 GMT
    Sections?
    Information?
    Find Nodes?
    Leftovers?
      Voting Booth?

      Is guessing a good strategy for surviving in the IT business?





      Results (163 votes), past polls