-
Comments Issue for [Ukkonen's Suffix Tree Algorithm](http://mutux.com/2017/07/19/suffix-tree-implementation-move-all.html)
mutux updated
4 years ago
-
-
Any test like
```cpp
#include
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
ty…
-
Currently, the fuzzy string matching is done by combining the similarity estimates from the Damerau-Levenshtein and Ratcliff-Obershelp algorithms in quadrature. This turns out to be far too slow in si…
-
for sequences with lengths over 64 characters it would still be possible to calculate the similarity for multiple sequences in parallel using simd. However for very long sequences it might be faster t…
-
Potential readings to focus understanding on probability, mathematical statistics, algorithms, etc more deeply. Talk of applications will be secondary.
- [Statistical modeling: the two cultures](ht…
-
The section on the speedup to `O(n+m+s^2)` should have a remark on whether you are assuming a finite or infinite alphabet.
Implicitly in the context of pairwise alignment, I would assume a finite alp…
-
-
### Feature Name
Addition of more String Algorithms
### Feature Description
I want to add the following algortihms under String Algorithms:
1)Finite State Automaton Algorithm
2)Ukkonen’s Algorith…
-
Hello everyone,
I have been working on a library with many different edit distance routines that use SIMD when possible to boost the speed of calculating edit distances on both long and short strin…