The probability of finding a fixed pattern in random data depends monotonically on the bifix indicator
From MaRDI portal
Publication:6234737
arXiv1207.6991MaRDI QIDQ6234737FDOQ6234737
Authors: Alex Schreiber 
Publication date: 30 July 2012
Abstract: We consider the problem of finding a fixed L-ary sequence in a stream of random L-ary data. It is known that the expected search time is a strictly increasing function of the lengths of the bifices of the pattern. In this paper we prove the related statement that the probability of finding the pattern in a finite random word is a strictly decreasing function of the lengths of the bifices of the pattern.
This page was built for publication: The probability of finding a fixed pattern in random data depends monotonically on the bifix indicator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6234737)
