#### Filter Results:

#### Publication Year

1982

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

#### Brain Region

#### Organism

Learn More

- Maria C Carrillo, Robert A Dean, François Nicolas, David S Miller, Robert Berman, Zaven Khachaturian +3 others
- Alzheimer's & dementia : the journal of the…
- 2013

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)

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)

Supported by the Action Incitative Informatique-Mathématique-Physique en Biologie Moléculaire [ACI IMP-Bio].

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)

Given a finite set of strings, the median string problem consists in finding a string that minimizes the sum of the 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 in… (More)

BACKGROUND
Variable minisatellites count among the most polymorphic markers of eukaryotic and prokaryotic genomes. This variability can affect gene coding regions, like in the prion protein gene, or gene regulation regions, like for the cystatin B gene, and be associated or implicated in diseases: the Creutzfeld-Jakob disease and the myoclonus epilepsy type… (More)

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a… (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)