a31d966
bzero of matrices is unnecessaryJohn Hawthorn authored on 07/09/2014 01:55:02 |
|
f45c337
Adjust and reformat match inner loopJohn Hawthorn authored on 07/09/2014 01:33:55 |
|
aa840a0
Optimize inner loopJohn Hawthorn authored on 07/09/2014 01:07:01 |
|
5fdec18
Avoid unnecessary matrix accessJohn Hawthorn authored on 07/09/2014 01:04:10 |
|
ec97545
Rearrance calculate_score inner loop for clarityJohn Hawthorn authored on 07/09/2014 00:29:06 |
b730589
scoring: Prefer consecutive matchesJohn Hawthorn authored on 31/08/2014 02:26:22 |
|
57e9b44
Fix backtrace regarding SCORE_MATCH_CONSECUTIVEJohn Hawthorn authored on 31/08/2014 02:35:33 |
|
02b6232
We can use D[][] to test if there was a matchJohn Hawthorn authored on 31/08/2014 02:31:16 |
|
5c4ad16
D[0][0] need not be initialized to 0John Hawthorn authored on 31/08/2014 02:25:44 |
|
aa98e4a
Improve debugging outputJohn Hawthorn authored on 31/08/2014 02:11:55 |
2ef572f
Really long candidates should return SCORE_MINJohn Hawthorn authored on 17/08/2014 04:07:50 |
38e22da
No need to scale score in 0..1John Hawthorn authored on 02/08/2014 02:34:41 |
47317b3
Only M[0][0] should default to 0John Hawthorn authored on 04/08/2014 06:55:33 |
|
c2d8253
Use SCORE_MATCH_SLASH for first characterJohn Hawthorn authored on 04/08/2014 02:17:32 |
deee6d5
Lesser penalty for leading and trailing gapsJohn Hawthorn authored on 30/07/2014 11:18:47 |