fsaLib : finite state automaton Library. fsaLib creates deterministic or probabilistic automata from regular expressions or PSSM (Position Specific Scoring Matrix) and then is able to count occurences whether in renewal or overlapping mode. It’s been designed to be fully operational when processing huge genetic data sets.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 1 article , 1 standard article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Nuel, G.; Delos, V.: Counting regular expressions in degenerated sequences through lazy Markov chain embedding (2016)