#### Filter Results:

#### Publication Year

1975

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

In this report, we prove that under a Markovian model of order one, the average depth of suffix trees of index n is asymptotically similar to the average depth of tries (a.k.a. digital trees) built on n independent strings. This leads to an asymptotic behavior of (log n)/h + C for the average of the depth of the suffix tree, where h is the entropy of the… (More)

Dedicated to the memory of Philippe Flajolet Keywords: Binary search trees Random structure Combinatorial probability Asymptotic analysis a b s t r a c t We derive exact moments of the number of 2-protected nodes in binary search trees grown from random permutations. Furthermore, we show that a properly normalized version of this tree parameter converges to… (More)

- Irina Gheorghiciuc, Mark Daniel Ward
- 2007

We consider words with letters from a q-ary alphabet A. The kth subword complexity of a word w ∈ A * is the number of distinct subwords of length k that appear as contiguous subwords of w. We analyze subword complexity from both combinatorial and probabilistic viewpoints. Our first main result is a precise analysis of the expected kth subword complexity of… (More)

- Jeffrey Gaither, Yushi Homma, Mark Sellke, Mark Daniel Ward
- 2012

We use probabilistic and combinatorial tools on strings to discover the average number of 2-protected nodes in tries and in suffix trees. Our analysis covers both the uniform and non-uniform cases. For instance, in a uniform trie with n leaves, the number of 2-protected nodes is approximately 0.803n, plus small first-order fluctuations. The 2-protected… (More)

We investigate protected nodes in random recursive trees. The exact mean of the number of such nodes is obtained by recurrence, and a linear asymptotic equivalent follows. A nonlinear recurrence for the variance shows that the variance grows linearly, too. It follows that the number of protected nodes in a random recursive tree, upon proper scaling,… (More)

We consider a serialized coin-tossing leader election algorithm that proceeds in rounds until a winner is chosen, or all contestants are eliminated. The analysis allows for either biased or fair coins. We find the exact distribution for the duration of any fixed contestant; asymptotically it turns out to be a geometric distribution. Rice's method (an… (More)

Wilf's Sixth Unsolved Problem asks for any interesting properties of the set of partitions of integers for which the (nonzero) multiplicities of the parts are all different. We refer to these as Wilf partitions. Using f (n) to denote the number of Wilf partitions, we establish lead-order asymptotics for ln f (n). 1 The Problem Herbert S. Wilf was an expert… (More)

Calmodulin-dependent protein kinase III (CaM kinase III, elongation factor-2 kinase) is a unique member of the Ca2+/CaM-dependent protein kinase family. Activation of CaM kinase III leads to the selective phosphorylation of elongation factor 2 (eEF-2) and transient inhibition of protein synthesis. Recent cloning and sequencing of CaM kinase III revealed… (More)

— We propose a joint source-channel coding algorithm capable of correcting some errors in the popular Lempel-Ziv'77 scheme without introducing any measurable degradation in the compression performance. This can be achieved because the LZ'77 encoder does not completely eliminate the redundancy present in the input sequence. One source of redundancy can be… (More)

Calmodulin-dependent protein kinases phosphorylate certain substrates that have been implicated in regulating cellular proliferation. For example, upon mitogenic stimulation, there is a rapid activation of calmodulin-dependent protein kinase III (CaM kinase III), which leads to the phosphorylation of elongation factor 2. Recently, our laboratory… (More)