diff options
| author | Henry Baughman <hbaughman741@gmail.com> | 2016-07-04 11:14:23 -0400 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2016-07-04 11:14:23 -0400 |
| commit | 3efee2acf639df7122c0de77b4627762c0dfd975 (patch) | |
| tree | 5f090144a93b98fb0203c0e185a0ae11ace8e118 /ALGORITHM.md | |
| parent | 53f09a342e6904aef2bfd4bb2cdf34e484e5a3bd (diff) | |
List all conditions identifying match in docs
Diffstat (limited to 'ALGORITHM.md')
| -rw-r--r-- | ALGORITHM.md | 10 |
1 files changed, 6 insertions, 4 deletions
diff --git a/ALGORITHM.md b/ALGORITHM.md index 30ebd5a..f4f9b27 100644 --- a/ALGORITHM.md +++ b/ALGORITHM.md @@ -55,10 +55,12 @@ Inspired by the [Gotoh algorithm (pdf)](http://www.cs.unibo.it/~dilena/LabBII/Papers/AffineGaps.pdf), fzy computes a second `D` (for diagonal) matrix in parallel with the score matrix. The `D` matrix computes the best score which *ends* in a match. This allows -both computation of the penlalty for starting a gap and the score for a +both computation of the penalty for starting a gap and the score for a consecutive match. -Using this algorithm fzy is able to score based on the optimal match. +Using [this +algorithm](https://github.com/jhawthorn/fzy/blob/master/src/match.c#L58) fzy +is able to score based on the optimal match. * Gaps (negative score) * at the start of the match @@ -67,8 +69,8 @@ Using this algorithm fzy is able to score based on the optimal match. * Matches (positive score) * consecutive * following a slash - * following a space (the start of a word) - * capital letter (the start of a CamlCase word) + * following a space, underscore, dash, or number (the start of a word) + * capital letter (the start of a CamelCase word) * following a dot (often a file extension) |