Clan Properties in Parton Showers

By considering clans as genuine elementary subprocesses, i.e., intermediate parton sources in the Simplified Parton Shower model, a generalized version of this model is defined. It predicts analytically clan properties at parton level in agreement with the general trends observed experimentally at hadronic level and in Monte Carlo simulations both at partonic and hadronic level. In particular the model shows a linear rising in rapidity of the average number of clans at fixed energy of the initial parton and its subsequent bending for rapidity intervals at the border of phase space, and approximate energy independence of the average number of clans in fixed rapidity intervals. The energy independence becomes stricter by properly normalizing the average number of clans.Comment: (27 pages in Plain TeX plus 10 Postscript Figures, all compressed via uufiles) DFTT 7/9

Cross-Document Pattern Matching

We study a new variant of the string matching problem called cross-document string matching, which is the problem of indexing a collection of documents to support an efficient search for a pattern in a selected document, where the pattern itself is a substring of another document. Several variants of this problem are considered, and efficient linear-space solutions are proposed with query time bounds that either do not depend at all on the pattern size or depend on it in a very limited way (doubly logarithmic). As a side result, we propose an improved solution to the weighted level ancestor problem

Fast Dynamic Pointer Following via Link-Cut Trees

In this paper, we study the problem of fast dynamic pointer following: given a directed graph $G$ where each vertex has outdegree $1$, efficiently support the operations of i) changing the outgoing edge of any vertex, and ii) find the vertex $k$ vertices `after' a given vertex. We exhibit a solution to this problem based on link-cut trees that requires $O(\lg n)$ time per operation, and prove that this is optimal in the cell-probe complexity model.Comment: 7 page

Simple and Efficient Fully-Functional Succinct Trees

The fully-functional succinct tree representation of Navarro and Sadakane (ACM Transactions on Algorithms, 2014) supports a large number of operations in constant time using $2n+o(n)$ bits. However, the full idea is hard to implement. Only a simplified version with $O(\log n)$ operation time has been implemented and shown to be practical and competitive. We describe a new variant of the original idea that is much simpler to implement and has worst-case time $O(\log\log n)$ for the operations. An implementation based on this version is experimentally shown to be superior to existing implementations

A theoretical investigation of the effect of proliferation and\ud adhesion on monoclonal conversion in the colonic crypt

Colorectal cancers are initiated by the accumulation of mutations in the colonic epithelium. Using a spatially structured cell-based model of a colonic crypt, we investigate the likelihood that the progeny of a mutated cell will dominate, or be sloughed out of, a crypt. Our approach is to perform multiple simulations, varying the spatial location of the initial mutation, and its proliferative and adhesive properties, to obtain statistical distributions for the probability of domination. Our simulations lead us to make a number of predictions. The process of monoclonal conversion always occurs, and does not require that the cell which initially gave rise to the population remains in the crypt. Mutations occurring more than one to two cells from the base of the crypt are unlikely to become the dominant clone. The probability of a mutant clone persisting in the crypt is sensitive to dysregulation of adhesion, and comparison with a one-dimensional model suggests that this is caused by competition directly at the base of the crypt.\ud We also predict that increases in the extent of the spatial domain in which the mutant cells proliferate cause counter-intuitive non-linear changes to the probability of its fixation, due to effects that cannot be captured in simpler models

Correcting Errors in the Bostrom/Kulczycki Simulation Arguments

Both patched versions of the Bostrom/Kulczycki simulation argument contain serious objective errors, discovered while attempting to formalize them in predicate logic. The English glosses of both versions involve badly misleading meanings of vague magnitude terms, which their impressiveness benefits from. We fix the errors, prove optimal versions of the arguments, and argue that both are much less impressive than they originally appeared. Finally, we provide a guide for readers to evaluate the simulation argument for themselves, using well-justified settings of the argument parameters that have simple, accurate statements in English, which are easier to understand and critique than the statements in the original paper

Compressed Subsequence Matching and Packed Tree Coloring

We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size $n$ compressing a string of size $N$ and a pattern string of size $m$ over an alphabet of size $\sigma$, our algorithm uses $O(n+\frac{n\sigma}{w})$ space and $O(n+\frac{n\sigma}{w}+m\log N\log w\cdot occ)$ or $O(n+\frac{n\sigma}{w}\log w+m\log N\cdot occ)$ time. Here $w$ is the word size and $occ$ is the number of occurrences of the pattern. Our algorithm uses less space than previous algorithms and is also faster for $occ=o(\frac{n}{\log N})$ occurrences. The algorithm uses a new data structure that allows us to efficiently find the next occurrence of a given character after a given position in a compressed string. This data structure in turn is based on a new data structure for the tree color problem, where the node colors are packed in bit strings.Comment: To appear at CPM '1