activity
20042015
most citedGenerating functions for generating trees

22 citations · 52 across the 6 of their papers we have counts for

collaborators

6 papers

math.AC2015★ 5 cited

A Description of Totally Reflexive Modules for a Class of non-Gorenstein Rings

Denise A. Rangel Tracy

We consider local non-Gorenstein rings of the form where We show that every totall…

q-bio.QM2013★ 5 cited

Flexible RNA design under structure and sequence constraints using formal languages

Yu Zhou, Yann Ponty, Stéphane Vialette +3

The problem of RNA secondary structure design (also called inverse folding) is the following: given a target secondary structure, one aims to create a sequence that folds into, or…

q-bio.QM2012

Tree decomposition and parameterized algorithms for RNA structure-sequence alignment including tertiary interactions and pseudoknots

Philippe Rinaudo, Yann Ponty, Dominique Barth +1

We present a general setting for structure-sequence comparison in a large class of RNA structures that unifies and generalizes a number of recent works on specific families on stru…

cs.DM2010★ 20 cited

Controlled non uniform random generation of decomposable structures

Alain Denise, Yann Ponty, Michel Termier

Consider a class of decomposable combinatorial structures, using different types of atoms $\Atoms = \{\At_1,\ldots ,\At_{|{\Atoms}|}\}$. We address the random generation of such st…

cs.LO2006

Uniform Random Sampling of Traces in Very Large Models

Alain Denise, Marie-Claude Gaudel, Sandrine-Dominique Gouraud +3

This paper presents some first results on how to perform uniform random walks (where every trace has the same probability to occur) in very large models. The models considered here…

math.CO2004★ 22 cited

Generating functions for generating trees

Cyril Banderier, Philippe Flajolet, Daniele Gardy +3

Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the n…