Blockers and Transversals

To determine the sequence flexibility for left-handed G-quadruplex formation, we carried out a systematic analysis of thymine loop substitutions and monitored

In spite of its interesting features, the OFC model does not bring a satisfactory answer to the question of finding a simple model reproducing the GR law for two reasons: (1) a

I present an efficient algorithm which lists the minimal separators of a 3- connected planar graph in O(n) per separator.. Keywords: 3-connected planar graphs, minimal

We will now prove that the complexity of finding the a, ∗-minimal separators of a planar graph is O(n/separator) and that the complexity of finding all the minimal separators of

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

We use those results to obtain an upper bound on the average complexity of algorithms to generate the minimal transversals of an hypergraph.. Then we make our random model more

Keywords: Systems biology, Metabolic network modeling, Parameter estimation, Structural and practical identifiability, Principal Component Analysis, Singular Value

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des