GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable
ACM Transactions on Mathematical Software (TOMS)
A calculus for the random generation of labelled combinatorial structures
Theoretical Computer Science
Random generation of words in an algebraic language in linear binary space
Information Processing Letters
Systems of functional equations
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
Combinatorics of RNA secondary structures
Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
Uniform random generation of decomposable structures using floating-point arithmetic
Theoretical Computer Science - Special issue on Caen '97
Theoretical Computer Science
Journal of Symbolic Computation
Boltzmann Samplers for the Random Generation of Combinatorial Structures
Combinatorics, Probability and Computing
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Differential equations for algebraic functions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Analytic Combinatorics
Journal of Computational and Applied Mathematics
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
A combinatorial framework for designing (pseudoknotted) RNA algorithms
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
Path computation in multi-layer multi-domain networks: A language theoretic approach
Computer Communications
Flexible RNA design under structure and sequence constraints using formal languages
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Non-redundant random generation algorithms for weighted context-free grammars
Theoretical Computer Science
| Hi-index | 5.23 |
Consider a class of decomposable combinatorial structures, using different types of atoms Z={Z"1,...,Z"|"Z"|}. We address the random generation of such structures with respect to a size n and a targeted distribution in k of its distinguished atoms. We consider two variations on this problem. In the first alternative, the targeted distribution is given by k real numbers @m"1,...,@m"k such that 0=0 is the number of undistinguished atoms. The structures must be generated uniformly among the set of structures of size n that contain exactlyn"i atoms Z"i (1@?i@?k). We give a O(r^2@?"i"="1^kn"i^2+mnklogn) algorithm for generating m structures, which simplifies into a O(r@?"i"="1^kn"i+mn) for regular specifications.