Ensemble Algorithms and Analytic Combinatorics in RNA Bioinformatics and Beyond

Thus all these algebras satisfy the analytic Ditkin condition; t h e y include in particular the algebra C(OD), the algebra of absolutely convergent Fourier series,

and his research also opened new avenues in various domains of applied computer science, including streaming algorithms, communication protocols, database ac- cess methods, data

A simple improvement of the previous specification avoids the empty wire as a parallel sub-process. This obvious modification in the specification induces many difficulties in

Keywords: Lattice path, analytic combinatorics, generating function, kernel method, algebraic function, singularity analysis, Brownian

He is best known for funda- mental advances in mathematical methods for the analysis of algorithms, and his research also opened new avenues in various domains of applied

an extension of the fiducial paradigm for statistical inference, while Shafer inter- preted these upper and lower probabilities as plausibility and belief functions with- out

The main purpose of this section is to provide explicit formulae for the probability distribution of the stopping time of the Mabinogion urn process (Theorem 1 below).. These arise,

One of our first results (and our main technical tool) (Theorem 3.3) is the fact that the Brianchon-Gram combinatorial function X (#, τ )( p, q) coincides with the analogous