Pasar al contenido principal

MINERIA EN DATOS BIOLOGICOS Y SOCIALES: ALGORITMOS, TEORIA E IMPLEMENTACION - ZARAGOZA

TIN2011-27479-C04-01

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2011
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSIDAD DE ZARAGOZA
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

Resultados totales (Incluyendo duplicados): 9
Encontrada(s) 1 página(s)

Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Conservation in Mitochondrial DNA: Parallelized Estimation and Alignment Influence

  • Merino-Casallo, Francisco
  • Álvarez-Jarreta, Jorge
  • Mayordomo, Elvira
The wide availability of sequenced biological data has challenged the conventional methods and tools used in molecular biology to compute the conservation index. As the size of input datasets increases, the time-cost of current conservation methods is becoming unafTordable. We propose a new software tool that combines several estimation methods applied to the conservation computation process with parallelization and divide-and-conquer techniques substantially improving its performance without affecting its accuracy. We have also made an in-depth analysis of the impact of different methods and parameter selection on the alignment process applied to input datasets prior to their conservation analysis. We have used sets of mitochondrial DNA sequences with different levels of heterogeneity and length, to provide a full case study. Both the software tool and the input datasets used in this research are freely available at http://www.zaramit.orglconservation_index
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

MEvoLib v1.0: The first molecular evolution library for Python

  • Álvarez-Jarreta, J.
  • Ruiz-Pesini, E.
Background: Molecular evolution studies involve many different hard computational problems solved, in most cases, with heuristic algorithms that provide a nearly optimal solution. Hence, diverse software tools exist for the different stages involved in a molecular evolution workflow. Results: We present MEvoLib, the first molecular evolution library for Python, providing a framework to work with different tools and methods involved in the common tasks of molecular evolution workflows. In contrast with already existing bioinformatics libraries, MEvoLib is focused on the stages involved in molecular evolution studies, enclosing the set of tools with a common purpose in a single high-level interface with fast access to their frequent parameterizations. The gene clustering from partial or complete sequences has been improved with a new method that integrates accessible external information (e.g. GenBank''s features data). Moreover, MEvoLib adjusts the fetching process from NCBI databases to optimize the download bandwidth usage. In addition, it has been implemented using parallelization techniques to cope with even large-case scenarios. Conclusions: MEvoLib is the first library for Python designed to facilitate molecular evolution researches both for expert and novel users. Its unique interface for each common task comprises several tools with their most used parameterizations. It has also included a method to take advantage of biological knowledge to improve the gene partition of sequence datasets. Additionally, its implementation incorporates parallelization techniques to enhance computational costs when handling very large input datasets.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Machine learning classifier for identification of damaging missense mutations exclusive to human mitochondrial DNA-encoded polypeptides

  • Martín Navarro, Antonio
  • Gaudioso Simón, Andrés
  • Álvarez Jarreta, Jorge
  • Montoya, Julio
  • Mayordomo, Elvira
  • Ruiz Pesini, Eduardo
Background: Several methods have been developed to predict the pathogenicity of missense mutations but none has been specifically designed for classification of variants in mtDNA-encoded polypeptides. Moreover, there is not available curated dataset of neutral and damaging mtDNA missense variants to test the accuracy of predictors. Because mtDNA sequencing of patients suffering mitochondrial diseases is revealing many missense mutations, it is needed to prioritize candidate substitutions for further confirmation. Predictors can be useful as screening tools but their performance must be improved. Results: We have developed a SVM classifier (Mitoclass.1) specific for mtDNA missense variants. Training and validation of the model was executed with 2,835 mtDNA damaging and neutral amino acid substitutions, previously curated by a set of rigorous pathogenicity criteria with high specificity. Each instance is described by a set of three attributes based on evolutionary conservation in Eukaryota of wildtype and mutant amino acids as well as coevolution and a novel evolutionary analysis of specific substitutions belonging to the same domain of mitochondrial polypeptides. Our classifier has performed better than other web-available tested predictors. We checked performance of three broadly used predictors with the total mutations of our curated dataset. PolyPhen-2 showed the best results for a screening proposal with a good sensitivity. Nevertheless, the number of false positive predictions was too high. Our method has an improved sensitivity and better specificity in relation to PolyPhen-2. We also publish predictions for the complete set of 24,201 possible missense variants in the 13 human mtDNA-encoded polypeptides. Conclusions: Mitoclass.1 allows a better selection of candidate damaging missense variants from mtDNA. A careful search of discriminatory attributes and a training step based on a curated dataset of amino acid substitutions belonging exclusively to human mtDNA genes allows an improved performance. Mitoclass.1 accuracy could be improved in the future when more mtDNA missense substitutions will be available for updating the attributes and retraining the model.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Computing absolutely normal numbers in nearly linear time

  • Lutz, Jack H
  • Mayordomo, Elvira
A real number x is absolutely normal if, for every base b ≥ 2, every two equally long strings of digits appear with equal asymptotic frequency in the base-b expansion of x. This paper presents an explicit algorithm that generates the binary expansion of an absolutely normal number x, with the nth bit of x appearing after npolylog(n) computation steps. This speed is achieved by simultaneously computing and diagonalizing against a martingale that incorporates Lempel-Ziv parsing algorithms in all bases.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Speeding Up Phylogenetic Model Checking

  • Requeno, J.I.
  • Colom, J.M.
Model checking is a generic and formal technique that the authors have proposed for the study of properties that emerge from the biological labeling of the states defined over the phylogenetic tree [3] [10]. This strategy allows us to use generic software tools already present in the industry. However, the performance of traditional model checking is penalized when scaling the system for large phylogenies. To this end, two strategies are presented here. The first one consists of partitioning the phylogenetic tree into a set of related subproblems so as to speed up the computation time and distribute the memory consumption. The second strategy is based on uncoupling the information associated to each state of the phylogenetic tree (mainly, the DNA sequence) and exporting it to an external tool for the management of large information systems. The integration of all these approaches outperformed the results of monolithic model checking and helped us to execute the verification of properties in a real phylogenetic tree.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Temporal logics for phylogenetic analysis via model checking

  • Requeno, J.I.
  • De Miguel Casado, G.
  • Blanco, R.
  • Colom, J.M.
The need for general-purpose algorithms for studying biological properties in phylogenetics motivates research into formal verification frameworks. Researchers can focus their efforts exclusively on evolution trees and property specifications. To this end, model checking, a mature automated verification technique originating in computer science, is applied to phylogenetic analysis. Our approach is based on three cornerstones: a logical modeling of the evolution with transition systems; the specification of both phylogenetic properties and trees using flexible temporal logic formulas; and the verification of the latter by means of automated computer tools. The most conspicuous result is the inception of a formal framework which allows for a symbolic manipulation of biological data (based on the codification of the taxa). Additionally, different logical models of evolution can be considered, complex properties can be specified in terms of the logical composition of others, and the refinement of unfulfilled properties as well as the discovery of new properties can be undertaken by exploiting the verification results. Some experimental results using a symbolic model verifier support the feasibility of the approach.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Sliced model checking for phylogenetic analysis

  • Requeno, J.I.
  • Blanco, R.
  • De Miguel Casado, Gregorio
  • Colom, J.M.
Model checking provides a powerful and flexible formal framework to state and verify biological properties on phylogenies. However, current model checking techniques fail to scale up the big amount of biological information relevant to each state of the system. This fact motivates the development of novel cooperative algorithms and slicing techniques that distribute not the graph structure of a phylogenetic system but the state information contained in its nodes.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Compact representation of biological sequences using set decision diagrams

  • Requeno, J.I.
  • Colom, J.M.
Nowadays, the exponential availability of biological sequences and the complexity of the computational methods that use them as input motivate the research of new compact representations. To this end, we propose an alternative method for storing sets of sequences based on set decision diagrams instead of classical compression techniques. The set decision diagrams are an extension of the reduced ordered binary decision diagrams, a graph data structure used as a symbolic compact representation of sets or relations between sets. Some experiments with genes of the mitochondrion DNA support the feasibility of our approach.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Timed and Probabilistic Model Checking over Phylogenetic Trees

  • Requeno, José Ignacio
  • Colom, José Manuel
Model checking is a generic verification technique that allows the phylogeneticist to focus on models and specifications instead of on implementation issues. Phylogenetic trees are considered as transition systems over which we interrogate phylogenetic questions written as formulas of temporal logic. Nonetheless, standard logics become insuficient for the usual practices of phylogenetic analysis since they don't allow the inclusion of explicit time and probabilities. The aim of this paper is to extend the application of model checking techniques beyond qualitative phylogenetic properties and adapt the existing logical extensions and tools to the field of phylogeny. The introduction of time and probabilities in phylogenetic specifications is motivated by a real example.