CAV2 vector gene transfer into central nervious System

Estudi realitzat a partir d’una estada al Institut de Génétique Moléculaire de Montpellier, França, entre 2010 i 2012. En aquest projecte s’ha avaluat les avantatges dels vectors adenovirals canins tipus 2 (CAV2) com a vectors de transferència gènica al sistema nerviós central (SNC) en un model primat no-humà i en un model caní del síndrome de Sly (mucopolisacaridosis tipus 7, MPS VII), malaltia monogènica que cursa amb neurodegeneració. En una primera part del projecte s’ha avaluat la biodistribució, l’eficàcia i la durada de l’expressió del transgen en un model primat no humà, (Microcebus murinus). Com ha vector s’ha utilitzat un CAV2 de primera generació que expressa la proteïna verda fluorescent (CAVGFP). Els resultats aportats en aquesta memòria demostren que en primats no humans, com en d’altres espècies testades anteriorment per l’equip de l’EJ Kremer, la injecció intracerebral de CAV2 resulta en una extensa transducció del SNC, siguent les neurones i els precursors neuronals les cèl•lules preferencialment transduïdes. Els vectors canins, servint-se de vesícules intracel•lulars són transportats, majoritàriament, des de les sinapsis cap al soma neuronal, aquest transport intracel•lular permet una extensa transducció del SNC a partir d’una única injecció intracerebral dels vectors virals. En una segona part d’aquest projecte s’ha avaluat l’ús terapèutic dels CAV2. S’ha injectat un vector helper-dependent que expressa el gen la b-glucuronidasa i el gen de la proteïna verda fluorescent (HD-RIGIE), en el SNC del model caní del síndrome de Sly (MPS VII). La biodistribució i la eficàcia terapèutica han estat avaluades. Els nivells d’activitat enzimàtica en animals malalts injectats amb el vector terapèutic va arribar a valors similars als dels animals no afectes. A més a més s’ha observat una reducció en la quantitat dels GAGs acumulats en les cèl•lules dels animals malalts tractats amb el vector terapèutic, demostrant la potencialitat terapèutica dels CAV2 per a malalties que afecten al SNC. Els resultats aportats en aquest treball ens permeten dir que els CAV2 són unes bones eines terapèutiques per al tractament de malalties que afecten al SNC.

Development and validation of AMANDA, a new algorithm for selecting highly relevant regions in Molecular Interaction Fields

Descriptors based on Molecular Interaction Fields (MIF) are highly suitable for drug discovery, but their size (thousands of variables) often limits their application in practice. Here we describe a simple and fast computational method that extracts from a MIF a handful of highly informative points (hot spots) which summarize the most relevant information. The method was specifically developed for drug discovery, is fast, and does not require human supervision, being suitable for its application on very large series of compounds. The quality of the results has been tested by running the method on the ligand structure of a large number of ligand-receptor complexes and then comparing the position of the selected hot spots with actual atoms of the receptor. As an additional test, the hot spots obtained with the novel method were used to obtain GRIND-like molecular descriptors which were compared with the original GRIND. In both cases the results show that the novel method is highly suitable for describing ligand-receptor interactions and compares favorably with other state-of-the-art methods.

Generation of mouse-induced pluripotent stem cells by transient expression of a single nonviral polycistronic vector

Induced pluripotent stem (iPS) cells have generated keen interestdue to their potential use in regenerative medicine. They havebeen obtained from various cell types of both mice and humans byexogenous delivery of different combinations of Oct4, Sox2, Klf4,c-Myc, Nanog, and Lin28. The delivery of these transcription factorshas mostly entailed the use of integrating viral vectors (retrovirusesor lentiviruses), carrying the risk of both insertional mutagenesisand oncogenesis due to misexpression of these exogenousfactors. Therefore, obtaining iPS cells that do not carry integratedtransgene sequences is an important prerequisite for their eventualtherapeutic use. Here we report the generation of iPS cell linesfrom mouse embryonic fibroblasts with no evidence of integrationof the reprogramming vector in their genome, achieved by nucleofectionof a polycistronic construct coexpressing Oct4, Sox2, Klf4,and c-Myc

On codes, matroids, and secure multiparty computation from linear secret-sharing schemes

Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sharing schemes (LSSSs), are studied. Such schemes are known to enable multiparty computation protocols secure against general (nonthreshold) adversaries.Two open problems related to the complexity of multiplicative LSSSs are considered in this paper. The first one deals with strongly multiplicative LSSSs. As opposed to the case of multiplicative LSSSs, it is not known whether there is an efficient method to transform an LSSS into a strongly multiplicative LSSS for the same access structure with a polynomial increase of the complexity. A property of strongly multiplicative LSSSs that could be useful in solving this problem is proved. Namely, using a suitable generalization of the well-known Berlekamp–Welch decoder, it is shown that all strongly multiplicative LSSSs enable efficient reconstruction of a shared secret in the presence of malicious faults. The second one is to characterize the access structures of ideal multiplicative LSSSs. Specifically, the considered open problem is to determine whether all self-dual vector space access structures are in this situation. By the aforementioned connection, this in fact constitutes an open problem about matroid theory, since it can be restated in terms of representability of identically self-dual matroids by self-dual codes. A new concept is introduced, the flat-partition, that provides a useful classification of identically self-dual matroids. Uniform identically self-dual matroids, which are known to be representable by self-dual codes, form one of the classes. It is proved that this property also holds for the family of matroids that, in a natural way, is the next class in the above classification: the identically self-dual bipartite matroids.

Personalized modeling for drug concentration prediction using Support Vector Machine

Building a personalized model to describe the drug concentration inside the human body for each patient is highly important to the clinical practice and demanding to the modeling tools. Instead of using traditional explicit methods, in this paper we propose a machine learning approach to describe the relation between the drug concentration and patients' features. Machine learning has been largely applied to analyze data in various domains, but it is still new to personalized medicine, especially dose individualization. We focus mainly on the prediction of the drug concentrations as well as the analysis of different features' influence. Models are built based on Support Vector Machine and the prediction results are compared with the traditional analytical models.

A new hybrid summarizer based on vector Space model, statistical physics and linguistics

In this article we present a hybrid approach for automatic summarization of Spanish medical texts. There are a lot of systems for automatic summarization using statistics or linguistics, but only a few of them combining both techniques. Our idea is that to reach a good summary we need to use linguistic aspects of texts, but as well we should benefit of the advantages of statistical techniques. We have integrated the Cortex (Vector Space Model) and Enertex (statistical physics) systems coupled with the Yate term extractor, and the Disicosum system (linguistics). We have compared these systems and afterwards we have integrated them in a hybrid approach. Finally, we have applied this hybrid system over a corpora of medical articles and we have evaluated their performances obtaining good results.

Detection of Optimal Models in Parameter Space with Support Vector Machines

The paper proposes an approach aimed at detecting optimal model parameter combinations to achieve the most representative description of uncertainty in the model performance. A classification problem is posed to find the regions of good fitting models according to the values of a cost function. Support Vector Machine (SVM) classification in the parameter space is applied to decide if a forward model simulation is to be computed for a particular generated model. SVM is particularly designed to tackle classification problems in high-dimensional space in a non-parametric and non-linear way. SVM decision boundaries determine the regions that are subject to the largest uncertainty in the cost function classification, and, therefore, provide guidelines for further iterative exploration of the model space. The proposed approach is illustrated by a synthetic example of fluid flow through porous media, which features highly variable response due to the parameter values' combination.

GeoKernels: Modeling of Spatial Data on GeoManifolds

This paper presents a review of methodology for semi-supervised modeling with kernel methods, when the manifold assumption is guaranteed to be satisfied. It concerns environmental data modeling on natural manifolds, such as complex topographies of the mountainous regions, where environmental processes are highly influenced by the relief. These relations, possibly regionalized and nonlinear, can be modeled from data with machine learning using the digital elevation models in semi-supervised kernel methods. The range of the tools and methodological issues discussed in the study includes feature selection and semisupervised Support Vector algorithms. The real case study devoted to data-driven modeling of meteorological fields illustrates the discussed approach.

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

Individual Classification of Mild Cognitive Impairment Subtypes by Support Vector Machine Analysis of White Matter DTI.

BACKGROUND AND PURPOSE: MCI was recently subdivided into sd-aMCI, sd-fMCI, and md-aMCI. The current investigation aimed to discriminate between MCI subtypes by using DTI. MATERIALS AND METHODS: Sixty-six prospective participants were included: 18 with sd-aMCI, 13 with sd-fMCI, and 35 with md-aMCI. Statistics included group comparisons using TBSS and individual classification using SVMs. RESULTS: The group-level analysis revealed a decrease in FA in md-aMCI versus sd-aMCI in an extensive bilateral, right-dominant network, and a more pronounced reduction of FA in md-aMCI compared with sd-fMCI in right inferior fronto-occipital fasciculus and inferior longitudinal fasciculus. The comparison between sd-fMCI and sd-aMCI, as well as the analysis of the other diffusion parameters, yielded no significant group differences. The individual-level SVM analysis provided discrimination between the MCI subtypes with accuracies around 97%. The major limitation is the relatively small number of cases of MCI. CONCLUSIONS: Our data show that, at the group level, the md-aMCI subgroup has the most pronounced damage in white matter integrity. Individually, SVM analysis of white matter FA provided highly accurate classification of MCI subtypes.

Mapping of Environmental Data Using Kernel-Based Methods

Recently, kernel-based Machine Learning methods have gained great popularity in many data analysis and data mining fields: pattern recognition, biocomputing, speech and vision, engineering, remote sensing etc. The paper describes the use of kernel methods to approach the processing of large datasets from environmental monitoring networks. Several typical problems of the environmental sciences and their solutions provided by kernel-based methods are considered: classification of categorical data (soil type classification), mapping of environmental and pollution continuous information (pollution of soil by radionuclides), mapping with auxiliary information (climatic data from Aral Sea region). The promising developments, such as automatic emergency hot spot detection and monitoring network optimization are discussed as well.