PANOW is a software dedicated to the search of rare words in biological sequences (over- or under-represented words in DNA or protein sequences). Using recent results on occurrence times of a string of symbols in a stochastic process with mixing properties (such as Markov chains), it computes point by point error between the law of the number of occurrences of a word and the Poisson approximation of this law. Then, it gives a limit number of occurrences from which a word can be considered as a rare word. PANOW is written in ANSI Cplusplus and developed on x86 GNU/Linux systems with GCC 3.4, and successfully tested with GCC latest versions on Sun and Apple Mac OSX systems. It relies on seqpp library. Compilation and installation are compliant with the GNU standard procedure. PANOW is licensed under the GNU General Public License (GNU GPL).
Keywords for this software
References in zbMATH (referenced in 5 articles , 1 standard article )
Showing results 1 to 5 of 5.
- Haydn, N.; Yang, F.: Entry times distribution for mixing systems (2016)
- Kifer, Yuri; Rapaport, Ariel: Poisson and compound Poisson approximations in conventional and nonconventional setups (2014)
- Abadi, Miguel; Vergne, Nicolas: Sharp error terms for return time statistics under mixing conditions (2009)
- Abadi, Miguel; Vergne, Nicolas: Sharp errors for point-wise Poisson approximations in mixing processes (2008)
- Vergne, Nicolas; Abadi, Miguel: Poisson approximation for search of rare words in DNA sequences (2008)