Pattern matching statistics on correlated sources
Résumé
In pattern matching algorithms, two characteristic parameters play an important rˆole : the number of occurrences of a given pattern, and the number of positions where a pattern occurrence ends. Since there may exist many occurrences which end at the same position, these two parameters may differ in a significant way. Here, we consider a general framework where the text is produced by a probabilistic source, which can be built by a dynamical system.
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...