I think MeowChow's would be nearly as fast,
except that for reasons of brevity it performs this
crazy map operation on every base-pair triplet
substitution.
On this train of thought, is there such as thing as a
Benchmark-type routine that will test performance on
a variety of data sizes? So many times people benchmark
a variety of routines with only one set of data, which
has the result of being a 1-dimensional test where there
are actually 2 independent variables (function and data set
size).
In line with Big-O Notation, is it possible and/or has someone
written a Benchmark-type module which would estimate what
kind of O(f(n)) function would best represent how the
algorithm in question scales? Certainly not trivial by any
means, but not impossible either.
-
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.
|
