PIMiner: A web tool for extraction of protein interactions from biomedical literature
| dc.contributor.author | Chowdhary, Rajesh | |
| dc.contributor.author | Zhang, Jinfeng | |
| dc.contributor.author | Tan, Sin Lam | |
| dc.contributor.author | Osborne, Daniel E. | |
| dc.contributor.author | Bajic, Vladimir B. | |
| dc.contributor.author | Liu, Jun S. | |
| dc.date.accessioned | 2015-08-03T10:40:47Z | |
| dc.date.available | 2015-08-03T10:40:47Z | |
| dc.date.issued | 2013 | |
| dc.identifier.citation | Chowdhary, R., Zhang, J., Tan, S. L., Osborne, D. E., Bajic, V. B., & Liu, J. S. (2013). PIMiner: a web tool for extraction of protein interactions from biomedical literature. International Journal of Data Mining and Bioinformatics, 7(4), 450. doi:10.1504/ijdmb.2013.054232 | |
| dc.identifier.issn | 1748-5673 | |
| dc.identifier.issn | 1748-5681 | |
| dc.identifier.pmid | 23798227 | |
| dc.identifier.doi | 10.1504/IJDMB.2013.054232 | |
| dc.identifier.uri | http://hdl.handle.net/10754/562510 | |
| dc.description.abstract | Information on Protein Interactions (PIs) is valuable for biomedical research, but often lies buried in the scientific literature and cannot be readily retrieved. While much progress has been made over the years in extracting PIs from the literature using computational methods, there is a lack of free, public, user-friendly tools for the discovery of PIs. We developed an online tool for the extraction of PI relationships from PubMed-abstracts, which we name PIMiner. Protein pairs and the words that describe their interactions are reported by PIMiner so that new interactions can be easily detected within text. The interaction likelihood levels are reported too. The option to extract only specific types of interactions is also provided. The PIMiner server can be accessed through a web browser or remotely through a client's command line. PIMiner can process 50,000 PubMed abstracts in approximately 7 min and thus appears suitable for large-scale processing of biological/biomedical literature. Copyright © 2013 Inderscience Enterprises Ltd. | |
| dc.description.sponsorship | This study was supported in part by grant 1UL1RR025011 from the Clinical and Translational Science Award (CTSA) program of the National Center for Research Resources, National Institutes of Health. We thank Ryan Frahm for providing server support. We also sincerely thank Rachel V. Stankowski for proof-reading the manuscript and for her comments. | |
| dc.publisher | Inderscience Publishers | |
| dc.relation.url | http://www.inderscience.com/link.php?id=54232 | |
| dc.relation.url | http://europepmc.org/articles/pmc4303605?pdf=render | |
| dc.rights | Archived with thanks to Inderscience Publishers | |
| dc.rights | This file is an open access version redistributed from: http://europepmc.org/articles/pmc4303605?pdf=render | |
| dc.subject | Bioinformatics | |
| dc.subject | Biological text-mining | |
| dc.subject | Complex biological networks | |
| dc.subject | Data mining | |
| dc.subject | Gene-protein networks | |
| dc.subject | Interactome mining | |
| dc.subject | Literature mining | |
| dc.subject | PI | |
| dc.subject | Protein interactions | |
| dc.subject | Protein-protein interactions | |
| dc.subject | Systems biology | |
| dc.title | PIMiner: A web tool for extraction of protein interactions from biomedical literature | |
| dc.type | Article | |
| dc.contributor.department | Computational Bioscience Research Center (CBRC) | |
| dc.contributor.department | Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division | |
| dc.contributor.department | Applied Mathematics and Computational Science Program | |
| dc.identifier.journal | International Journal of Data Mining and Bioinformatics | |
| dc.identifier.pmcid | PMC4303605 | |
| dc.identifier.wosut | WOS:000319870800007 | |
| dc.eprint.version | Post-print | |
| dc.contributor.institution | Biomedical Informatifcs Research Center, MCRF, Marshfield Clinic, 1000 North Oak Avenue, Marshfield, WI 54449, United States | |
| dc.contributor.institution | Department of Statistics, Florida State University, Tallahassee, FL 32306, United States | |
| dc.contributor.institution | Department of Statistics, Harvard University, Cambridge, MA 02138, United States | |
| dc.identifier.volume | 7 | |
| dc.identifier.issue | 4 | |
| dc.identifier.pages | 450 | |
| kaust.person | Bajic, Vladimir B. | |
| dc.identifier.eid | 2-s2.0-84878775644 | |
| refterms.dateFOA | 2021-04-28T06:18:33Z |
Files in this item
This item appears in the following Collection(s)
-
Articles
-
Applied Mathematics and Computational Science Program
For more information visit: https://cemse.kaust.edu.sa/amcs -
Computational Bioscience Research Center (CBRC)
-
Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division
For more information visit: https://cemse.kaust.edu.sa/
Related items
Showing items related by title, author, creator and subject.
-
ProDis-ContSHC: Learning protein dissimilarity measures and hierarchical context coherently for protein-protein comparison in protein database retrieval(BMC Bioinformatics, Springer Nature, 2012-05-08) [Article]Background: The need to retrieve or classify protein molecules using structure or sequence-based similarity measures underlies a wide range of biomedical applications. Traditional protein search methods rely on a pairwise dissimilarity/similarity measure for comparing a pair of proteins. This kind of pairwise measures suffer from the limitation of neglecting the distribution of other proteins and thus cannot satisfy the need for high accuracy of the retrieval systems. Recent work in the machine learning community has shown that exploiting the global structure of the database and learning the contextual dissimilarity/similarity measures can improve the retrieval performance significantly. However, most existing contextual dissimilarity/similarity learning algorithms work in an unsupervised manner, which does not utilize the information of the known class labels of proteins in the database.Results: In this paper, we propose a novel protein-protein dissimilarity learning algorithm, ProDis-ContSHC. ProDis-ContSHC regularizes an existing dissimilarity measure dij by considering the contextual information of the proteins. The context of a protein is defined by its neighboring proteins. The basic idea is, for a pair of proteins (i, j), if their context N (i) and N (j) is similar to each other, the two proteins should also have a high similarity. We implement this idea by regularizing dij by a factor learned from the context N (i) and N (j). Moreover, we divide the context to hierarchial sub-context and get the contextual dissimilarity vector for each protein pair. Using the class label information of the proteins, we select the relevant (a pair of proteins that has the same class labels) and irrelevant (with different labels) protein pairs, and train an SVM model to distinguish between their contextual dissimilarity vectors. The SVM model is further used to learn a supervised regularizing factor. Finally, with the new Supervised learned Dissimilarity measure, we update the Protein Hierarchial Context Coherently in an iterative algorithm--ProDis-ContSHC.We test the performance of ProDis-ContSHC on two benchmark sets, i.e., the ASTRAL 1.73 database and the FSSP/DALI database. Experimental results demonstrate that plugging our supervised contextual dissimilarity measures into the retrieval systems significantly outperforms the context-free dissimilarity/similarity measures and other unsupervised contextual dissimilarity measures that do not use the class label information.Conclusions: Using the contextual proteins with their class labels in the database, we can improve the accuracy of the pairwise dissimilarity/similarity measures dramatically for the protein retrieval tasks. In this work, for the first time, we propose the idea of supervised contextual dissimilarity learning, resulting in the ProDis-ContSHC algorithm. Among different contextual dissimilarity learning approaches that can be used to compare a pair of proteins, ProDis-ContSHC provides the highest accuracy. Finally, ProDis-ContSHC compares favorably with other methods reported in the recent literature. 2012 Wang et al.; licensee BioMed Central Ltd.
-
The human interactome knowledge base (hint-kb): An integrative human protein interaction database enriched with predicted protein–protein interaction scores using a novel hybrid technique(Artificial Intelligence Review, Springer Nature, 2013-07-12) [Article]Proteins are the functional components of many cellular processes and the identification of their physical protein–protein interactions (PPIs) is an area of mature academic research. Various databases have been developed containing information about experimentally and computationally detected human PPIs as well as their corresponding annotation data. However, these databases contain many false positive interactions, are partial and only a few of them incorporate data from various sources. To overcome these limitations, we have developed HINT-KB (http://biotools.ceid.upatras.gr/hint-kb/), a knowledge base that integrates data from various sources, provides a user-friendly interface for their retrieval, cal-culatesasetoffeaturesofinterest and computesaconfidence score for every candidate protein interaction. This confidence score is essential for filtering the false positive interactions which are present in existing databases, predicting new protein interactions and measuring the frequency of each true protein interaction. For this reason, a novel machine learning hybrid methodology, called (Evolutionary Kalman Mathematical Modelling—EvoKalMaModel), was used to achieve an accurate and interpretable scoring methodology. The experimental results indicated that the proposed scoring scheme outperforms existing computational methods for the prediction of PPIs.
-
CMsearch: simultaneous exploration of protein sequence space and structure space improves not only protein homology detection but also protein structure prediction(Bioinformatics, Oxford University Press (OUP), 2016-06-15) [Article]Motivation: Protein homology detection, a fundamental problem in computational biology, is an indispensable step toward predicting protein structures and understanding protein functions. Despite the advances in recent decades on sequence alignment, threading and alignment-free methods, protein homology detection remains a challenging open problem. Recently, network methods that try to find transitive paths in the protein structure space demonstrate the importance of incorporating network information of the structure space. Yet, current methods merge the sequence space and the structure space into a single space, and thus introduce inconsistency in combining different sources of information. Method: We present a novel network-based protein homology detection method, CMsearch, based on cross-modal learning. Instead of exploring a single network built from the mixture of sequence and structure space information, CMsearch builds two separate networks to represent the sequence space and the structure space. It then learns sequence–structure correlation by simultaneously taking sequence information, structure information, sequence space information and structure space information into consideration. Results: We tested CMsearch on two challenging tasks, protein homology detection and protein structure prediction, by querying all 8332 PDB40 proteins. Our results demonstrate that CMsearch is insensitive to the similarity metrics used to define the sequence and the structure spaces. By using HMM–HMM alignment as the sequence similarity metric, CMsearch clearly outperforms state-of-the-art homology detection methods and the CASP-winning template-based protein structure prediction methods.
