𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Length laws for random subdivision of longest intervals

✍ Scribed by Michael D. Brennan

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
500 KB
Volume
22
Category
Article
ISSN
0304-4149

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bounds of the longest directed cycle len
Bounds of the longest directed cycle length for minimal strong digraphs
✍ Zhi-bo Chen; Fu-ji Zhang πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 532 KB

In this paper we present the upper and lower bounds of the longest directed cycle length for minimal strr,ng digraphs in terms of the numbers of vertices and arcs. These bounds are both sharp. In addition, we give analogous results for minimal 2-edge connected graphs.

An accurate approximation to the distrib
An accurate approximation to the distribution of the length of the longest matching word between two random DNA sequences
✍ R.F. Mott; T.B.L. Kirkwood; R.N. Curnow πŸ“‚ Article πŸ“… 1990 πŸ› Springer 🌐 English βš– 514 KB

An accurate approximation is derived to the distribution of the length of the longest matching word present between two random DNA sequences of finite length, using only elementary probability arguments. The distribution is shown to be consistent with previous asymptotic results for the mean and var