Browse code

List all conditions identifying match in docs

Henry Baughman authored on 04/07/2016 15:14:23 • GitHub committed on 04/07/2016 15:14:23
Showing 1 changed files

... ...
@@ -55,10 +55,12 @@ Inspired by the [Gotoh algorithm
55 55
 (pdf)](http://www.cs.unibo.it/~dilena/LabBII/Papers/AffineGaps.pdf), fzy
56 56
 computes a second `D` (for diagonal) matrix in parallel with the score matrix.
57 57
 The `D` matrix computes the best score which *ends* in a match. This allows
58
-both computation of the penlalty for starting a gap and the score for a
58
+both computation of the penalty for starting a gap and the score for a
59 59
 consecutive match.
60 60
 
61
-Using this algorithm fzy is able to score based on the optimal match.
61
+Using [this 
62
+algorithm](https://github.com/jhawthorn/fzy/blob/master/src/match.c#L58) fzy 
63
+is able to score based on the optimal match.
62 64
 
63 65
 * Gaps (negative score)
64 66
   * at the start of the match
... ...
@@ -67,8 +69,8 @@ Using this algorithm fzy is able to score based on the optimal match.
67 69
 * Matches (positive score)
68 70
   * consecutive
69 71
   * following a slash
70
-  * following a space (the start of a word)
71
-  * capital letter (the start of a CamlCase word)
72
+  * following a space, underscore, dash, or number (the start of a word)
73
+  * capital letter (the start of a CamelCase word)
72 74
   * following a dot (often a file extension)
73 75
 
74 76