Cited by 34Biomedical Text Mining and OntologiesProtein Structure and DynamicsComputational Drug Discovery Methods

Natural language processing in text mining for structural modeling of protein complexes

Open access
Badal, Varsha D., Kundrotas, Petras J., Vakser, Ilya A.·2018·BMC Bioinformatics

Abstract

BACKGROUND: Structural modeling of protein-protein interactions produces a large number of putative configurations of the protein complexes. Identification of the near-native models among them is a serious challenge. Publicly available results of biomedical research may provide constraints on the binding mode, which can be essential for the docking. Our text-mining (TM) tool, which extracts binding site residues from the PubMed abstracts, was successfully applied to protein docking (Badal et al., PLoS Comput Biol, 2015; 11: e1004630). Still, many extracted residues were not relevant to the docking. RESULTS: We present an extension of the TM tool, which utilizes natural language processing (NLP) for analyzing the context of the residue occurrence. The procedure was tested using generic and specialized dictionaries. The results showed that the keyword dictionaries designed for identification of protein interactions are not adequate for the TM prediction of the binding mode. However, our dictionary designed to distinguish keywords relevant to the protein binding sites led to considerable improvement in the TM performance. We investigated the utility of several methods of context analysis, based on dissection of the sentence parse trees. The machine learning-based NLP filtered the pool of the mined residues significantly more efficiently than the rule-based NLP. Constraints generated by NLP were tested in docking of unbound proteins from the DOCKGROUND X-ray benchmark set 4. The output of the global low-resolution docking scan was post-processed, separately, by constraints from the basic TM, constraints re-ranked by NLP, and the reference constraints. The quality of a match was assessed by the interface root-mean-square deviation. The results showed significant improvement of the docking output when using the constraints generated by the advanced TM with NLP. CONCLUSIONS: The basic TM procedure for extracting protein-protein binding site residues from the PubMed abstracts was significantly advanced by the deep parsing (NLP techniques for contextual analysis) in purging of the initial pool of the extracted residues. Benchmarking showed a substantial increase of the docking success rate based on the constraints generated by the advanced TM with NLP.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1186/s12859-018-2079-4

Cites

58 of 58 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Automated procedures like text mining of publicly available online publications face copyright restrictions and are hindered by still limited amount of open-access publications.

    “Such automated procedures, like text mining of publicly available online publications [47] face copyright restrictions and are hindered by still limited amount of open-access publications.”

    From Challenges in protein docking (2020) · cites this paper as [47]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 6

  1. [10]Liu H, Keselj V, Blouin C, Verspoor K. Subgraph matching-based literature mining for biomedical relations and events. In: 2012 AAAI fall Symp series Inf retrieval knowledge disc biomed text. Arlington; 2012. p. 32–7.
  2. [27]Peng Y, Arighi C, Wu CH, Vijay-Shanker K. Extended dependency graph for BioC-compatible protein-protein interaction (PPI) passage detection in full-text articles. In: Proc BioCreative V Challenge Workshop, vol. 30-5. Sevilla; 2015.
  3. [30]Erkan G, Ozgur A, Radev DR. Extracting interacting protein pairs and evidence sentences by using dependency parsing and machine learning techniques. In: Proc 2nd BioCreative Challenge Evaluation Workshop: 2007, Madrid, Spain Fundación CNIO Carlos III: 287–292.
  4. [42]Meng L Huang R Gu J A review of semantic similarity measures in wordnet Int JHybrid Inf Technol 2013 6 1 12
  5. [45]Fellbaum C WordNet: an electronic lexical database 1998 Cambridge MIT press
  6. [54]Pucher M. Performance evaluation of WordNet-based semantic relatedness measures for word prediction in conversational speech. In: Proc 6th Int Workshop Comput Semantics. Tilburg; 2005.

Cited by

Sorted by citations

Authors
Badal, V. D., Kundrotas, P. J., & Vakser, I. A.
Affiliations
University of Kansas (US)
Corresponding author
  • Kundrotas, Petras J.
  • Vakser, Ilya A.
Venue
BMC Bioinformatics
Published
2018-03-05
Volume
19
Issue
1
Pages
84-84
ISSN
1471-2105 (ISSN-L)
OpenAlex
W2794764013
Cited by
34
References
58
Citations by year
2025: 3 · 2024: 4 · 2023: 4 · 2022: 5 · 2021: 6 · 2020: 5 · 2019: 4 · 2018: 3
FWCI
1.60
Type
journal article
Language
en
Open access
Locations
  • BMC Bioinformatics (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • KU ScholarWorks (University of Kansas) (submittedVersion, cc-by)
Funders
  • National Institutes of Health (R01GM074255)
  • National Science Foundation (DBI1262621, DBI1565107)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Biomedical Text Mining and Ontologies
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Protein Structure and Dynamics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computational Drug Discovery Methods
Keywords
text mining, natural language processing, protein-protein interaction, protein docking, binding site residues, contextual analysis, parse trees, keyword dictionary, protein complexes, PubMed abstracts
MeSH terms
Machine Learning, Models, Molecular, Natural Language Processing, Protein Binding, Proteins, Semantics, Data Mining, Support Vector Machine

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review