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

Antonio J. Pérez-Pulido

dblp:90/9422 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
2since 2021 · last 2022
0000-0003-3343-2822ORCID · verified

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

Applied, interdisciplinary, general and emerging computing · 9 · 3 first-author · 2 since 2021

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
5 papers
Bioinformatics and computational biology · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 10 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis
genomic sequence analysis
0.412020
Using AnABlast for intergenic sORF prediction in the Caenorhabditis elegans genome · Bioinform. 2020
Bioinformatics and computational biology › genome annotation
intergenic region analysis
0.112020
Using AnABlast for intergenic sORF prediction in the Caenorhabditis elegans genome · Bioinform. 2020
Bioinformatics and computational biology › gene expression analysis
biclustering
0.112011
A biclustering algorithm for extracting bit-patterns from binary datasets · Bioinform. 2011
Bioinformatics and computational biology
gene expression analysis
0.112011
A biclustering algorithm for extracting bit-patterns from binary datasets · Bioinform. 2011
Bioinformatics and computational biology
biomedical text mining
0.012004
Gene annotation from scientific literature using mappings between keyword systems · Bioinform. 2004
Bioinformatics and computational biology › genome annotation
gene annotation
0.012004
Gene annotation from scientific literature using mappings between keyword systems · Bioinform. 2004
Bioinformatics and computational biology › biomedical text mining
literature-based gene annotation
0.012004
Gene annotation from scientific literature using mappings between keyword systems · Bioinform. 2004
Bioinformatics and computational biology
protein function prediction
0.012004
AnaGram: protein function assignment · Bioinform. 2004
Distributed systems
service-oriented architecture
0.012006
Intelligent client for integrating bioinformatics services · Bioinform. 2006
Bioinformatics and computational biology
protein sequence analysis
0.012004
AnaGram: protein function assignment · Bioinform. 2004

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

sequence similarity · 0.4RNA interference · 0.4AnABlast · 0.4divide-and-conquer · 0.1bit-pattern processing · 0.1service description catalogue · 0.1BioMOBY · 0.1identity detection of protomotifs · 0.0fuzzy association model · 0.0
YearPublicationVenuePosition
2022 Assessment of selection pressure exerted on genes from complete pangenomes helps to improve the accuracy in the prediction of new genes
abstract
Bacterial genomes are massively sequenced, and they provide valuable data to better know the complete set of genes of a species. The analysis of thousands of bacterial strains can identify both shared genes and those appearing only in the pathogenic ones. Current computational gene finders facilitate this task but often miss some existing genes. However, the present availability of different genomes from the same species is useful to estimate the selective pressure applied on genes of complete pangenomes. It may assist in evaluating gene predictions either by checking the certainty of a new gene or annotating it as a gene under positive selection. Here, we estimated the selective pressure of 19 271 genes that are part of the pangenome of the human opportunistic pathogen Acinetobacter baumannii and found that most genes in this bacterium are subject to negative selection. However, 23% of them showed values compatible with positive selection. These latter were mainly uncharacterized proteins or genes required to evade the host defence system including genes related to resistance and virulence whose changes may be favoured to acquire new functions. Finally, we evaluated the utility of measuring selection pressure in the detection of sequencing errors and the validation of gene prediction.
Alejandro Rubio, Juan Jiménez, Antonio J. Pérez-Pulido
Briefings Bioinform.3
2021 Serial co-expression analysis of host factors from SARS-CoV viruses highly converges with former high-throughput screenings and proposes key regulators
abstract
The current genomics era is bringing an unprecedented growth in the amount of gene expression data, only comparable to the exponential growth of sequences in databases during the last decades. This data allow the design of secondary analyses that take advantage of this information to create new knowledge. One of these feasible analyses is the evaluation of the expression level for a gene through a series of different conditions or cell types. Based on this idea, we have developed Automatic and Serial Analysis of CO-expression, which performs expression profiles for a given gene along hundreds of heterogeneous and normalized transcriptomics experiments and discover other genes that show either a similar or an inverse behavior. It might help to discover co-regulated genes, and common transcriptional regulators in any biological model. The present severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) pandemic is an opportunity to test this novel approach due to the wealth of data that are being generated, which could be used for validating results. Thus, we have identified 35 host factors in the literature putatively involved in the infectious cycle of SARS-CoV viruses and searched for genes tightly co-expressed with them. We have found 1899 co-expressed genes whose assigned functions are strongly related to viral cycles. Moreover, this set of genes heavily overlaps with those identified by former laboratory high-throughput screenings (with P-value near 0). Our results reveal a series of common regulators, involved in immune and inflammatory responses that might be key virus targets to induce the coordinated expression of SARS-CoV-2 host factors.
Antonio J. Pérez-Pulido, Gualberto Asencio-Cortés, Ana M. Brokate-Llanos, Gloria Brea-Calvo, Rosario Rodríguez-Griñolo, Andrés Garzón, Manuel J. Muñoz
Briefings Bioinform.1
2020 Using AnABlast for intergenic sORF prediction in the Caenorhabditis elegans genome
abstract
MOTIVATION: Short bioactive peptides encoded by small open reading frames (sORFs) play important roles in eukaryotes. Bioinformatics prediction of ORFs is an early step in a genome sequence analysis, but sORFs encoding short peptides, often using non-AUG initiation codons, are not easily discriminated from false ORFs occurring by chance. RESULTS: AnABlast is a computational tool designed to highlight putative protein-coding regions in genomic DNA sequences. This protein-coding finder is independent of ORF length and reading frame shifts, thus making of AnABlast a potentially useful tool to predict sORFs. Using this algorithm, here, we report the identification of 82 putative new intergenic sORFs in the Caenorhabditis elegans genome. Sequence similarity, motif presence, expression data and RNA interference experiments support that the underlined sORFs likely encode functional peptides, encouraging the use of AnABlast as a new approach for the accurate prediction of intergenic sORFs in annotated eukaryotic genomes. AVAILABILITY AND IMPLEMENTATION: AnABlast is freely available at http://www.bioinfocabd.upo.es/ab/. The C.elegans genome browser with AnABlast results, annotated genes and all data used in this study is available at http://www.bioinfocabd.upo.es/celegans. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
C. S. Casimiro-Soriguer, M. M. Rigual, Ana M. Brokate-Llanos, Manuel J. Muñoz, Andrés Garzón, Antonio J. Pérez-Pulido, Juan Jiménez
Bioinform.6
2018 Automated selection of homologs to track the evolutionary history of proteins
abstract
BACKGROUND: The selection of distant homologs of a query protein under study is a usual and useful application of protein sequence databases. Such sets of homologs are often applied to investigate the function of a protein and the degree to which experimental results can be transferred from one organism to another. In particular, a variety of databases facilitates static browsing for orthologs. However, these resources have a limited power when identifying orthologs between taxonomically distant species. In addition, in some situations, for a given query protein, it is advantageous to compare the sets of orthologs from different specific organisms: this recursive step-wise search might give an idea of the evolutionary path of the protein as a series of consecutive steps, for example gaining or losing domains. However, a step-wise orthology search is a time-consuming task if the number of steps is high. RESULTS: To illustrate a solution for this problem, we present the web tool ProteinPathTracker, which allows to track the evolutionary history of a query protein by locating homologs in selected proteomes along several evolutionary paths. Additional functionalities include locking a region of interest to follow its evolution in the discovered homologous sequences and the study of the protein function evolution by analysis of the annotations of the homologs. CONCLUSIONS: ProteinPathTracker is an easy-to-use web tool that automatises the practice of looking for selected homologs in distant species in a straightforward way for non-expert users.
Pablo Mier, Antonio J. Pérez-Pulido, Miguel A. Andrade-Navarro
BMC Bioinform.2
2013 Classification of protein motifs based on subcellular localization uncovers evolutionary relationships at both sequence and functional levels
abstract
BACKGROUND: Most proteins have evolved in specific cellular compartments that limit their functions and potential interactions. On the other hand, motifs define amino acid arrangements conserved between protein family members and represent powerful tools for assigning function to protein sequences. The ideal motif would identify all members of a protein family but in practice many motifs identify both family members and unrelated proteins, referred to as True Positive (TP) and False Positive (FP) sequences, respectively. RESULTS: To address the relationship between protein motifs, protein function and cellular localization, we systematically assigned subcellular localization data to motif sequences from the comprehensive PROSITE sequence motif database. Using this data we analyzed relationships between localization and function. We find that TPs and FPs have a strong tendency to localize in different compartments. When multiple localizations are considered, TPs are usually distributed between related cellular compartments. We also identified cases where FPs are concentrated in particular subcellular regions, indicating possible functional or evolutionary relationships with TP sequences of the same motif. CONCLUSIONS: Our findings suggest that the systematic examination of subcellular localization has the potential to uncover evolutionary and functional relationships between motif-containing sequences. We believe that this type of analysis complements existing motif annotations and could aid in their interpretation. Our results shed light on the evolution of cellular organelles and potentially establish the basis for new subcellular localization and function prediction algorithms.
Marcos Parras-Moltó, Francisco J. Campos-Laborie, Juan García-Diéguez, M. R. Rodríguez-Griñolo, Antonio J. Pérez-Pulido
BMC Bioinform.5
2011 A biclustering algorithm for extracting bit-patterns from binary datasets
abstract
MOTIVATION: Binary datasets represent a compact and simple way to store data about the relationships between a group of objects and their possible properties. In the last few years, different biclustering algorithms have been specially developed to be applied to binary datasets. Several approaches based on matrix factorization, suffix trees or divide-and-conquer techniques have been proposed to extract useful biclusters from binary data, and these approaches provide information about the distribution of patterns and intrinsic correlations. RESULTS: A novel approach to extracting biclusters from binary datasets, BiBit, is introduced here. The results obtained from different experiments with synthetic data reveal the excellent performance and the robustness of BiBit to density and size of input data. Also, BiBit is applied to a central nervous system embryonic tumor gene expression dataset to test the quality of the results. A novel gene expression preprocessing methodology, based on expression level layers, and the selective search performed by BiBit, based on a very fast bit-pattern processing technique, provide very satisfactory results in quality and computational cost. The power of biclustering in finding genes involved simultaneously in different cancer processes is also shown. Finally, a comparison with Bimax, one of the most cited binary biclustering algorithms, shows that BiBit is faster while providing essentially the same results. AVAILABILITY: The source and binary codes, the datasets used in the experiments and the results can be found at: http://www.upo.es/eps/bigs/BiBit.html CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Domingo S. Rodríguez-Baena, Antonio J. Pérez-Pulido, Jesús S. Aguilar-Ruiz
Bioinform.2
2006 Intelligent client for integrating bioinformatics services
abstract
MOTIVATION: In addition to existing bioinformatics software, a lot of new tools are being developed world wide to supply services for an ever growing, widely dispersed and heterogeneous collection of biological data. The integration of these resources under a common platform is a challenging task. To this end, several groups are developing integration technologies, in which services are usually registered in some sort of catalogue to allow novel discovering and accessing mechanisms to be implemented. However, each service demands specific interfaces to accommodate their parameters and it is a complicated task linking the different service inputs and outputs to solve a biological problem. RESULTS: In this work we address the design and implementation of a versatile web client to access BioMOBY compatible services (a system by which a client can interact with multiple sources of biological data regardless of the underlying format or schema) using the service description stored in the BioMOBY catalogue. The automatic interface generator significantly reduces developing time and produces uniform service access mechanisms. The design and proof of concept (for such a client) including the generic interface generator have been developed and implemented in the National Institute for Bioinformatics in Spain. AVAILABILITY: The INB (National Institute for Bioinformatics, Spain) platform is available at www.inab.org/MOWServ
Ismael Navas-Delgado, Maria del Mar Rojano-Muñoz, Sergio Ramírez, Antonio J. Pérez-Pulido, Eduardo Andrés León, José Francisco Aldana-Montes, Oswaldo Trelles
Bioinform.4
2004 Gene annotation from scientific literature using mappings between keyword systems
abstract
MOTIVATION: The description of genes in databases by keywords helps the non-specialist to quickly grasp the properties of a gene and increases the efficiency of computational tools that are applied to gene data (e.g. searching a gene database for sequences related to a particular biological process). However, the association of keywords to genes or protein sequences is a difficult process that ultimately implies examination of the literature related to a gene. RESULTS: To support this task, we present a procedure to derive keywords from the set of scientific abstracts related to a gene. Our system is based on the automated extraction of mappings between related terms from different databases using a model of fuzzy associations that can be applied with all generality to any pair of linked databases. We tested the system by annotating genes of the SWISS-PROT database with keywords derived from the abstracts linked to their entries (stored in the MEDLINE database of scientific references). The performance of the annotation procedure was much better for SWISS-PROT keywords (recall of 47%, precision of 68%) than for Gene Ontology terms (recall of 8%, precision of 67%). AVAILABILITY: The algorithm can be publicly accessed and used for the annotation of sequences through a web server at http://www.bork.embl.de/kat
Antonio J. Pérez-Pulido, Carolina Perez-Iratxeta, Peer Bork, Guillermo Thode, Miguel A. Andrade-Navarro
Bioinform.1
2004 AnaGram: protein function assignment
abstract
SUMMARY: AnaGram is a web service for protein function assignment based on identity detection of small significant fragments (protomotifs) that can act as modular pieces in peptide construction. The system is able to assign function by finding correlations between protomotifs and functional annotations contained in SWISS-PROT and Medline databases. In addition, function ontologies are used for hierarchical organization of the predicted functions. Extensive tests have been carried out to evaluate the accuracy and performance of the system. AVAILABILITY: http://jaguar.genetica.uma.es/anagram.htm
Antonio J. Pérez-Pulido, Guillermo Thode, Oswaldo Trelles
Bioinform.1