Dominique Perrin

Learn More
Phosphoinositide 3-kinases (PI3K) have long been considered promising drug targets for the treatment of inflammatory and autoimmune disorders as well as cancer and cardiovascular diseases. But the lack of specificity, isoform selectivity and poor biopharmaceutical profile of PI3K inhibitors have so far hampered rigorous disease-relevant target validation.(More)
CONTEXT The optimal duration of antimicrobial treatment for ventilator-associated pneumonia (VAP) is unknown. Shortening the length of treatment may help to contain the emergence of multiresistant bacteria in the intensive care unit (ICU). OBJECTIVE To determine whether 8 days is as effective as 15 days of antibiotic treatment of patients with(More)
A new string-matching algorithm is presented, which can be viewed as an intermediate between the classical algorithms of Knuth, Morris, and Pratt on the one hand and Boyer and Moore, on the other hand. The algorithm is linear in time and uses constant space as the algorithm of Galil and Seiferas. It presents the advantage of being remarkably simple which(More)
Non-competitive N-methyl-d-aspartate (NMDA) blockers induce schizophrenic-like behavior in healthy volunteers and exacerbate symptomatology in schizophrenic patients. Hence, a compound able to enhance NMDA neurotransmission by increasing levels of d-serine, an endogenous full agonist at the glycine site of the NMDA receptors, could have anti-psychotic(More)
We study the expressive power of linear propositional temporal logic interpreted on finite sequences or words. We first give a transparent proof of the fact that a formal language is expressible in this logic if and only if its syntactic semigroup is finite and aperiodic. This gives an effective algorithm to decide whether a given rational language is(More)
Černý’s conjecture asserts the existence of a synchronizing word of length at most (n− 1) for any synchronized n-state deterministic automaton. We prove a quadratic upper bound on the length of a synchronizing word for any synchronized n-state deterministic automaton satisfying the following additional property: there is a letter a such that for any pair of(More)
The theory of automata on infinite words was initiated by Buchi and McNaughton at the beginning of the sixties, with a flavour of mathematical logic. As for the rest of automata theory, it uses concepts and methods which are familiar to computer scientists. The consideration of infinite words, which could in fact seem at first glance to be highly(More)