Related papers: String Matching and 1d Lattice Gases
A weighted string over an alphabet of size $\sigma$ is a string in which a set of letters may occur at each position with respective occurrence probabilities. Weighted strings, also known as position weight matrices or uncertain sequences,…
We study a one dimensional gas of $N$ noninteracting diffusing particles in a harmonic trap, whose stiffness switches between two values $\mu_1$ and $\mu_2$ with constant rates $r_1$ and $r_2$ respectively. Despite the absence of direct…
I derive a loop representation for the canonical and grand-canonical partition functions for an interacting four-component Fermi gas in one spatial dimension and an arbitrary external potential. The representation is free of the "sign…
The standard setup for single-file diffusion is diffusing particles in one dimension which cannot overtake each other, where the dynamics of a tracer (tagged) particle is of main interest. In this article we generalise this system and…
We enumerate the number of monotonic lattice paths starting at $(0,0)$ and terminating at $(m,n)$ in which $l$ of the first $k$ steps lie below the line $y=x\ (0\leq k\leq m\leq n)$. These closed formulas consist of terms which are a…
Finding the common subsequences of $L$ multiple strings has many applications in the area of bioinformatics, computational linguistics, and information retrieval. A well-known result states that finding a Longest Common Subsequence (LCS)…
Two strings are considered to have parameterized matching when there exists a bijection of the parameterized alphabet onto itself such that it transforms one string to another. Parameterized matching has application in software duplication…
Given two sequences over a finite alphabet $\mathcal{L}$, the $D_2$ statistic is the number of $m$-letter word matches between the two sequences. This statistic is used in bioinformatics for expressed sequence tag database searches. Here we…
We solve an one-dimensional stochastic model of interacting particles on a chain. Particles can have branching and coagulation reactions, they can also appear on an empty site and disappear spontaneously. This model which can be viewed as…
We extend the convergence law for sparse random graphs proven by Lynch to arbitrary relational languages. We consider a finite relational vocabulary $\sigma$ and a first order theory $T$ for $\sigma$ composed of symmetry and…
We study mixed long-range percolation on the square lattice. Each vertical edge of unit length is independently open with probability $\varepsilon$, and each horizontal edge of length $i$ is independently open with probability $p_i$. Also,…
We determine the asymptotic behavior of the tails of the steady state velocity distribution of a homogeneously driven granular gas comprising of particles having a scalar velocity. A pair of particles undergo binary inelastic collisions at…
We describe a Markov-Chain-Monte-Carlo algorithm which can be used to generate naturally labeled n-element posets at random with a probability distribution of one's choice. Implementing this algorithm for the uniform distribution, we…
Linear systems with many degrees of freedom containing multiplicative and additive noise are considered. The steady state probability distribution for equations of this kind is examined. With multiplicative white noise it is shown that…
We discuss stationary aspects of a set of driven lattice gases in which hard-core particles with spatial extent, covering more than one lattice site, diffuse and reconstruct in one dimension under nearest-neighbor interactions. As in the…
We consider the first problem that appears in any application of synchronizing automata, namely, the problem of deciding whether or not a given $n$-state $k$-letter automaton is synchronizing. First we generalize results from…
Systems described by equations involving both multiplicative and additive noise are common in nature. Examples include convection of a passive scalar field, polymersin turbulent flow, and noise in dye lasers. In this paper the one component…
The object of the present article is a 1d lattice-gas system comprised of soft-particles, wherein particles interact only if they occupy the same or a neighboring site, as a simple representation of penetrable particles of soft condensed…
In a recent paper (Tran et al., Ann.Phys.311(2004)204), some asymptotic number theoretical results on the partitioning of an integer were derived exploiting its connection to the quantum density of states of a many-particle system. We…
We consider the problem of inferring the probability distribution associated with a language, given data consisting of an infinite sequence of elements of the languge. We do this under two assumptions on the algorithms concerned: (i) like a…