skip to main content


Title: Text mining for modeling of protein complexes enhanced by machine learning
Abstract Motivation Procedures for structural modeling of protein–protein complexes (protein docking) produce a number of models which need to be further analyzed and scored. Scoring can be based on independently determined constraints on the structure of the complex, such as knowledge of amino acids essential for the protein interaction. Previously, we showed that text mining of residues in freely available PubMed abstracts of papers on studies of protein–protein interactions may generate such constraints. However, absence of post-processing of the spotted residues reduced usability of the constraints, as a significant number of the residues were not relevant for the binding of the specific proteins. Results We explored filtering of the irrelevant residues by two machine learning approaches, Deep Recursive Neural Network (DRNN) and Support Vector Machine (SVM) models with different training/testing schemes. The results showed that the DRNN model is superior to the SVM model when training is performed on the PMC-OA full-text articles and applied to classification (interface or non-interface) of the residues spotted in the PubMed abstracts. When both training and testing is performed on full-text articles or on abstracts, the performance of these models is similar. Thus, in such cases, there is no need to utilize computationally demanding DRNN approach, which is computationally expensive especially at the training stage. The reason is that SVM success is often determined by the similarity in data/text patterns in the training and the testing sets, whereas the sentence structures in the abstracts are, in general, different from those in the full text articles. Availabilityand implementation The code and the datasets generated in this study are available at https://gitlab.ku.edu/vakser-lab-public/text-mining/-/tree/2020-09-04. Supplementary information Supplementary data are available at Bioinformatics online.  more » « less
Award ID(s):
1917263
NSF-PAR ID:
10284897
Author(s) / Creator(s):
; ;
Editor(s):
Elofsson, Arne
Date Published:
Journal Name:
Bioinformatics
Volume:
37
Issue:
4
ISSN:
1367-4803
Page Range / eLocation ID:
497 to 505
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract Motivation

    Timetrees depict evolutionary relationships between species and the geological times of their divergence. Hundreds of research articles containing timetrees are published in scientific journals every year. The TimeTree (TT) project has been manually locating, curating and synthesizing timetrees from these articles for almost two decades into a TimeTree of Life, delivered through a unique, user-friendly web interface (timetree.org). The manual process of finding articles containing timetrees is becoming increasingly expensive and time-consuming. So, we have explored the effectiveness of text-mining approaches and developed optimizations to find research articles containing timetrees automatically.

    Results

    We have developed an optimized machine learning system to determine if a research article contains an evolutionary timetree appropriate for inclusion in the TT resource. We found that BERT classification fine-tuned on whole-text articles achieved an F1 score of 0.67, which we increased to 0.88 by text-mining article excerpts surrounding the mentioning of figures. The new method is implemented in the TimeTreeFinder (TTF) tool, which automatically processes millions of articles to discover timetree-containing articles. We estimate that the TTF tool would produce twice as many timetree-containing articles as those discovered manually, whose inclusion in the TT database would potentially double the knowledge accessible to a wider community. Manual inspection showed that the precision on out-of-distribution recently published articles is 87%. This automation will speed up the collection and curation of timetrees with much lower human and time costs.

    Availability and implementation

    https://github.com/marija-stanojevic/time-tree-classification.

    Supplementary information

    Supplementary data are available at Bioinformatics online.

     
    more » « less
  2. Motivation: Timetrees depict evolutionary relationships between species and the geological times of their divergence. Hundreds of research articles containing timetrees are published in scientific journals every year. The TimeTree project has been manually locating, curating, and synthesizing timetrees from these articles for almost two decades into a TimeTree of Life, delivered through a unique, userfriendly web interface (timetree.org). The manual process of finding articles containing timetrees is becoming increasingly expensive and time-consuming. So, we have explored the effectiveness of textmining approaches and developed optimizations to find research articles containing timetrees automatically. Results: We have developed an optimized machine learning (ML) system to determine if a research article contains an evolutionary timetree appropriate for inclusion in the TimeTree resource. We found that BERT classification fine-tuned on whole-text articles achieved an F1 score of 0.67, which we increased to 0.88 by text-mining article excerpts surrounding the mentioning of figures. The new method is implemented in the TimeTreeFinder tool, TTF, which automatically processes millions of articles to discover timetree-containing articles. We estimate that the TTF tool would produce twice as many timetree-containing articles as those discovered manually, whose inclusion in the TimeTree database would potentially double the knowledge accessible to a wider community. Manual inspection showed that the precision on out-of-distribution recently-published articles is 87%. This automation will speed up the collection and curation of timetrees with much lower human and time costs. Availability: https://github.com/marija-stanojevic/time-tree-classification Contact: {marija.stanojevic, s.kumar, zoran.obradovic}@temple.edu Supplementary information: Supplementary data are available at Bioinformatics online 
    more » « less
  3. Abstract

    Comparative docking is based on experimentally determined structures of protein‐protein complexes (templates), following the paradigm that proteins with similar sequences and/or structures form similar complexes. Modeling utilizing structure similarity of target monomers to template complexes significantly expands structural coverage of the interactome. Template‐based docking by structure alignment can be performed for the entire structures or by aligning targets to the bound interfaces of the experimentally determined complexes. Systematic benchmarking of docking protocols based on full and interface structure alignment showed that both protocols perform similarly, with top 1 docking success rate 26%. However, in terms of the models' quality, the interface‐based docking performed marginally better. The interface‐based docking is preferable when one would suspect a significant conformational change in the full protein structure upon binding, for example, a rearrangement of the domains in multidomain proteins. Importantly, if the same structure is selected as the top template by both full and interface alignment, the docking success rate increases 2‐fold for both top 1 and top 10 predictions. Matching structural annotations of the target and template proteins for template detection, as a computationally less expensive alternative to structural alignment, did not improve the docking performance. Sophisticated remote sequence homology detection added templates to the pool of those identified by structure‐based alignment, suggesting that for practical docking, the combination of the structure alignment protocols and the remote sequence homology detection may be useful in order to avoid potential flaws in generation of the structural templates library.

     
    more » « less
  4. null (Ed.)
    Abstract Objective This study aims at reviewing novel coronavirus disease (COVID-19) datasets extracted from PubMed Central articles, thus providing quantitative analysis to answer questions related to dataset contents, accessibility and citations. Methods We downloaded COVID-19-related full-text articles published until 31 May 2020 from PubMed Central. Dataset URL links mentioned in full-text articles were extracted, and each dataset was manually reviewed to provide information on 10 variables: (1) type of the dataset, (2) geographic region where the data were collected, (3) whether the dataset was immediately downloadable, (4) format of the dataset files, (5) where the dataset was hosted, (6) whether the dataset was updated regularly, (7) the type of license used, (8) whether the metadata were explicitly provided, (9) whether there was a PubMed Central paper describing the dataset and (10) the number of times the dataset was cited by PubMed Central articles. Descriptive statistics about these seven variables were reported for all extracted datasets. Results We found that 28.5% of 12 324 COVID-19 full-text articles in PubMed Central provided at least one dataset link. In total, 128 unique dataset links were mentioned in 12 324 COVID-19 full text articles in PubMed Central. Further analysis showed that epidemiological datasets accounted for the largest portion (53.9%) in the dataset collection, and most datasets (84.4%) were available for immediate download. GitHub was the most popular repository for hosting COVID-19 datasets. CSV, XLSX and JSON were the most popular data formats. Additionally, citation patterns of COVID-19 datasets varied depending on specific datasets. Conclusion PubMed Central articles are an important source of COVID-19 datasets, but there is significant heterogeneity in the way these datasets are mentioned, shared, updated and cited. 
    more » « less
  5. Abstract About 70% of people with osteogenesis imperfecta (OI) experience hearing loss. There is no cure for OI, and therapies to ameliorate hearing loss rely on conventional treatments for auditory impairments in the general population. The success rate of these treatments in the OI population with poor collagenous tissues is still unclear. Here, we conduct a systematic review and meta-analysis on the efficacy of treatments addressing hearing loss in OI. This study conforms to the reporting standards of the Preferred Reporting Items for Systematic Reviews and Meta-analyses (PRISMA). Data sources include published articles in Medline via PubMed, Web of Science, Scopus, and Embase, from their inception to November 2020. Studies included individuals with OI undergoing a hearing loss treatment, having pre- and postoperative objective assessment of hearing function at a specified follow-up length. Our search identified 1144 articles, of which 67 were reviewed at full-text screening. A random-effects meta-analysis was conducted on the selected articles (n = 12) of people with OI that underwent stapes surgery. Success was assessed as the proportion of ears with a postoperative Air–Bone Gap (ABG) ≤ 10 dB. A systematic review was conducted on the remaining articles (n = 13) reporting on other treatments. No meta-analysis was conducted on the latter due to the low number of articles on the topic and the nature of single case studies. The meta-analysis shows that stapes surgeries have a low success rate of 59.08 (95% CI 45.87 to 71.66) in the OI population. The systematic review revealed that cochlear implants, bone-anchored hearing aids, and other implantable hearing aids proved to be feasible, although challenging, in the OI population, with only 2 unsuccessful cases among the 16 reviewed single cases. This analysis of published data on OI shows poor clinical outcomes for the procedures addressing hearing loss. Further studies on hearing loss treatments for OI people are needed. Notably, the mechanisms of hearing loss in OI need to be determined to develop successful and possibly non-invasive treatment strategies. 
    more » « less