Learn More
In 2011, the National Institute on Aging and the Alzheimer's Association (NIA-AA) proposed revising the criteria for diagnosing Alzheimer's disease (AD), which had been established more than 25 years earlier by the National Institute on Neurologic and Communicative Disorders and Stroke (NINCDS) and the Alzheimer's Disease and Related Disorders Association(More)
Adenosine is a nucleoside which has been shown to participate in the regulation of physiological activity in a variety of mammalian tissues, and has been recognized as a homeostatic neuromodulator. It exerts its actions via membrane-bound receptors which have been characterized using biochemical, electrophysiological and radioligand binding techniques.(More)
Adenosine participates in the physiology of central and peripheral tissues through several subtypes of G-protein-coupled receptors. Positively linked to adenylate cyclase, A2 receptors have been subdivided into A2a and A2b sites on the basis of their molecular, biochemical and pharmacological properties. They exhibit selective distribution, and are(More)
Speeding up approximate pattern matching is a line of research in stringology since the 80's. Practically fast approaches belong to the class of filtration algorithms, in which text regions dissimilar to the pattern are first excluded, and the remaining regions are then compared to the pattern by dynamic programming. Among the conditions used to test(More)
Given a set of evolutionary trees on a same set of taxa, the maximum agreement subtree problem (MAST), respectively, maximum compatible tree problem (MCT), consists of finding a largest subset of taxa such that all input trees restricted to these taxa are isomorphic, respectively compatible. These problems have several applications in phylogenetics such as(More)
Given a finite set of strings, the MEDIAN STRING problem consists in finding a string that minimizes the sum of the edit distances to the strings in the set. Approximations of the median string are used in a very broad range of applications where one needs a representative string that summarizes common information to the strings of the set. It is the case(More)
Given a set of leaf-labelled trees with identical leaf sets, the well-known MAST problem consists of finding a subtree homeomorphi-cally included in all input trees and with the largest number of leaves. MAST and its variant called MCT are of particular interest in computational biology. This paper presents positive and negative results on the approximation(More)
In metabolomics and other fields dealing with small compounds, mass spectrometry is applied as a sensitive high-throughput technique. Recently, fragmentation trees have been proposed to automatically analyze the fragmentation mass spectra recorded by such instruments. Computationally, this leads to the problem of finding a maximum weight subtree in an(More)