On pattern occurrences in a random text
| dc.contributor.author | Fudos, I. | en |
| dc.contributor.author | Pitoura, E. | en |
| dc.contributor.author | Szpankowski, W. | en |
| dc.date.accessioned | 2015-11-24T17:02:48Z | |
| dc.date.available | 2015-11-24T17:02:48Z | |
| dc.identifier.issn | 0020-0190 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/11094 | |
| dc.rights | Default Licence | - |
| dc.subject | pattern occurrence | en |
| dc.subject | bernoulli model | en |
| dc.subject | autocorrelation polynomial | en |
| dc.subject | generating functions | en |
| dc.subject | asymptotic analysis | en |
| dc.subject | sequence patterns | en |
| dc.title | On pattern occurrences in a random text | en |
| heal.abstract | Consider a given pattern H and a random text T of length n. We assume that symbols in the text occur independently, and various symbols have different probabilities of occurrence (i.e., the so-called asymmetric Bernoulli model). We are concerned with the probability of exactly r occurrences of H in the text T. We derive the generating function of this probability, and show that asymptotically it behaves as alpha n(r) rho(H)(n-r-1), where alpha is an explicitly computed constant, and rho(H) < 1 is the root of an equation depending on the structure of the pattern. We then extend these findings to random patterns. | en |
| heal.access | campus | - |
| heal.fullTextAvailability | TRUE | - |
| heal.journalName | Information Processing Letters | en |
| heal.journalType | peer reviewed | - |
| heal.language | en | - |
| heal.publicationDate | 1996 | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.type | journalArticle | - |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.type.en | Journal article | en |
Αρχεία
Φάκελος/Πακέτο αδειών
1 - 1 of 1
Φόρτωση...
- Ονομα:
- license.txt
- Μέγεθος:
- 1.74 KB
- Μορφότυπο:
- Item-specific license agreed upon to submission
- Περιγραφή: