Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Joan-Josep Gallardo-Chacón

dblp:61/8321 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Information theory · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › statistical genetics
genetic association study
0.112010
MISS: a non-linear methodology based on mutual information for genetic association studies in both population and sib-pairs analysis · Bioinform. 2010
Bioinformatics and computational biology › statistical genetics › genetic association study
multi-locus association mapping
0.112010
MISS: a non-linear methodology based on mutual information for genetic association studies in both population and sib-pairs analysis · Bioinform. 2010
Bioinformatics and computational biology › statistical genetics › gene-gene interaction
SNP interaction analysis
0.112010
MISS: a non-linear methodology based on mutual information for genetic association studies in both population and sib-pairs analysis · Bioinform. 2010
Bioinformatics and computational biology › gene regulation
transcription factor binding site prediction
0.112010
Computational detection of transcription factor binding sites through differential Rényi entropy · IEEE Trans. Inf. Theory 2010
Information theory › information measures › entropy › generalized entropy
rényi entropy
0.012010
Computational detection of transcription factor binding sites through differential Rényi entropy · IEEE Trans. Inf. Theory 2010

Methods — techniques the papers use, named apart from their topics

rényi entropy · 0.2receiver operating characteristic analysis · 0.2mutual information · 0.1multiple linear regression · 0.1maximum entropy conditional probability modelling · 0.1information theory · 0.1
YearPublicationVenuePosition
2013 Predictability of gene ontology slim-terms from primary structure information in Embryophyta plant proteins
abstract
BACKGROUND: Proteins are the key elements on the path from genetic information to the development of life. The roles played by the different proteins are difficult to uncover experimentally as this process involves complex procedures such as genetic modifications, injection of fluorescent proteins, gene knock-out methods and others. The knowledge learned from each protein is usually annotated in databases through different methods such as the proposed by The Gene Ontology (GO) consortium. Different methods have been proposed in order to predict GO terms from primary structure information, but very few are available for large-scale functional annotation of plants, and reported success rates are much less than the reported by other non-plant predictors. This paper explores the predictability of GO annotations on proteins belonging to the Embryophyta group from a set of features extracted solely from their primary amino acid sequence. RESULTS: High predictability of several GO terms was found for Molecular Function and Cellular Component. As expected, a lower degree of predictability was found on Biological Process ontology annotations, although a few biological processes were easily predicted. Proteins related to transport and transcription were particularly well predicted from primary structure information. The most discriminant features for prediction were those related to electric charges of the amino-acid sequence and hydropathicity derived features. CONCLUSIONS: An analysis of GO-slim terms predictability in plants was carried out, in order to determine single categories or groups of functions that are most related with primary structure information. For each highly predictable GO term, the responsible features of such successfulness were identified and discussed. In addition to most published studies, focused on few categories or single ontologies, results in this paper comprise a complete landscape of GO predictability from primary structure encompassing 75 GO terms at molecular, cellular and phenotypical level. Thus, it provides a valuable guide for researchers interested on further advances in protein function prediction on Embryophyta plants.
Jorge Alberto Jaramillo-Garzón, Joan-Josep Gallardo-Chacón, Germán Castellanos-Domínguez, Alexandre Perera-Lluna
BMC Bioinform.2
2010 MISS: a non-linear methodology based on mutual information for genetic association studies in both population and sib-pairs analysis
abstract
MOTIVATION: Finding association between genetic variants and phenotypes related to disease has become an important vehicle for the study of complex disorders. In this context, multi-loci genetic association might unravel additional information when compared with single loci search. The main goal of this work is to propose a non-linear methodology based on information theory for finding combinatorial association between multi-SNPs and a given phenotype. RESULTS: The proposed methodology, called MISS (mutual information statistical significance), has been integrated jointly with a feature selection algorithm and has been tested on a synthetic dataset with a controlled phenotype and in the particular case of the F7 gene. The MISS methodology has been contrasted with a multiple linear regression (MLR) method used for genetic association in both, a population-based study and a sib-pairs analysis and with the maximum entropy conditional probability modelling (MECPM) method, which searches for predictive multi-locus interactions. Several sets of SNPs within the F7 gene region have been found to show a significant correlation with the FVII levels in blood. The proposed multi-site approach unveils combinations of SNPs that explain more significant information of the phenotype than their individual polymorphisms. MISS is able to find more correlations between SNPs and the phenotype than MLR and MECPM. Most of the marked SNPs appear in the literature as functional variants with real effect on the protein FVII levels in blood. AVAILABILITY: The code is available at http://sisbio.recerca.upc.edu/R/MISS_0.2.tar.gz
Helena Brunel, Joan-Josep Gallardo-Chacón, Alfonso Buil, Montserrat Vallverdú, José Manuel Soria, Pere Caminal, Alexandre Perera-Lluna
Bioinform.2
2010 Computational detection of transcription factor binding sites through differential Rényi entropy
abstract
Regulatory sequence detection is a critical facet for understanding the cell mechanisms in order to coordinate the response to stimuli. Protein synthesis involves the binding of a transcription factor to specific sequences in a process related to the gene expression initiation. A characteristic of this binding process is that the same factor binds with different sequences placed along all genome. Thus, any computational approach shows many difficulties related with this variability observed from the binding sequences. This paper proposes the detection of transcription factor binding sites based on a parametric uncertainty measurement (Rényi entropy). This detection algorithm evaluates the variation on the total Rényi entropy of a set of sequences when a candidate sequence is assumed to be a true binding site belonging to the set. The efficiency of the method is measured in form of receiver operating characteristic (ROC) curves on different transcription factors fromSaccharomyces cerevisiaeorganism. The results are compared with other known motif detection algorithms such as Motif Discovery scan (MDscan) and multiple expectation–maximization (EM) for motif elicitation (MEME).
Joan Maynou, Joan-Josep Gallardo-Chacón, Montserrat Vallverdú, Pere Caminal, Alexandre Perera-Lluna
IEEE Trans. Inf. Theory2