Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/11094
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFudos, I.en
dc.contributor.authorPitoura, E.en
dc.contributor.authorSzpankowski, W.en
dc.date.accessioned2015-11-24T17:02:48Z-
dc.date.available2015-11-24T17:02:48Z-
dc.identifier.issn0020-0190-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/11094-
dc.rightsDefault Licence-
dc.subjectpattern occurrenceen
dc.subjectbernoulli modelen
dc.subjectautocorrelation polynomialen
dc.subjectgenerating functionsen
dc.subjectasymptotic analysisen
dc.subjectsequence patternsen
dc.titleOn pattern occurrences in a random texten
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.publicationDate1996-
heal.abstractConsider 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.journalNameInformation Processing Lettersen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)

Files in This Item:
File Description SizeFormat 


This item is licensed under a Creative Commons License Creative Commons