Popular repositories Loading

1. substring-complexity substring-complexity Public

   compute/approximate the substring complexity measure delta = max_k (d_k/k), where d_k is the number of distinct factors of length k of the input string.

   C++ 3

2. finite-automata-partition-refinement finite-automata-partition-refinement Public

   A tool to sort Wheeler NFA and prune finite automata using partition refinement algorithm

   C++ 2

3. Wheeler-language-recognizer Wheeler-language-recognizer Public archive

   Tool to check if a regular expression recognizes a Wheeler language

   C++ 2

4. rho-repetitiveness rho-repetitiveness Public

   Compute statistics on the suffix link tree

   C++ 2

5. Labeled-Graph-LCP Labeled-Graph-LCP Public

   This is a software to compute the LCP of a deterministic Wheeler pseudoforest

   C++ 2

6. suffixient suffixient Public

   Compute the smallest suffixient set of a string

   C++ 2