Regexpcount
swMATH ID:  792 
Software Authors:  Nicodème, Pierre 
Description:  Regexpcount, a symbolic package for counting problems on regular expressions and words. In a previous work [P. Nicodème, B. Salvy and P. Flajolet, Theor. Comput. Sci. 287, 593–617 (2002; Zbl 1061.68118)], we considered algorithms related to the statistics of matches with words and regular expressions in texts generated by Bernoulli or Markov sources. In this work these algorithms are extended for two purposes: to determine the statistics of simultaneous counting of different motifs, and to compute the waiting time for the first match with a motif in a model which may be constrained. This extension also handles matches with errors. The package is fully implemented and gives access to high and low level commands. We also consider an example corresponding to a practical biological problem: getting the statistics for the number of matches of words of size 8 in a genome (a Markovian sequence), knowing that an (overrepresented DNA protecting) pattern named Chi occurs a given number of times. 
Homepage:  http://algo.inria.fr/libraries/ 
Keywords:  marked automata; generating functions 
Related Software:  Maple; RSEARCH; fastDNAml; Rfam 
Referenced in:  6 Publications 
Further Publications:  http://algo.inria.fr/papers/bibgen/algobib.html 
Standard Articles
1 Publication describing the Software, including 1 Publication in zbMATH  Year 

Regexpcount, a symbolic package for counting problems on regular expressions and words. Zbl 1051.68154 Nicodème, Pierre 
2003

all
top 5
Referenced by 11 Authors
Referenced in 3 Serials
2  Journal of Mathematical Biology 
1  Fundamenta Informaticae 
1  Algorithms 
Referenced in 5 Fields
5  Computer science (68XX) 
4  Numerical analysis (65XX) 
3  Biology and other natural sciences (92XX) 
2  Probability theory and stochastic processes (60XX) 
1  Statistics (62XX) 