3 citations · 3 across the 3 of their papers we have counts for
3 papers
q-bio.QM2011
A Combinatorial Framework for Designing (Pseudoknotted) RNA Algorithms
Yann Ponty, Cédric Saule
We extend an hypergraph representation, introduced by Finkelstein and Roytberg, to unify dynamic programming algorithms in the context of RNA folding with pseudoknots. Classic appl…
cs.DS2010
Non-redundant random generation from weighted context-free languages
Yann Ponty
We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of…
cs.DS2010★ 3 cited
Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models
Danièle Gardy, Yann Ponty
The present work analyzes the redundancy of sets of combinatorial objects produced by a weighted random generation algorithm proposed by Denise et al. This scheme associates weight…