Evidence map›Paper›PMID 17274683›Full record

ArticlePLoS computational biology2007

Automatic extraction of protein point mutations using a graph bigram association.

Lawrence C Lee, Florence Horn, Fred E Cohen

Open access · goldAbstract read
In one paragraph

Article in PLoS computational biology, 2007. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 24 papers.

0numbers the graph read from it
0cells of the map it votes in
24citing papers in PubMed
2.9field-weighted citation impact, top 9% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

24 citing papers in PubMed, 46 citations in OpenAlex.

  1. Article
  2. Review
  3. Article
  4. Article
  5. Article
  6. Review
  7. Article
  8. Review
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. GATMD: γ-aminobutyric acid transporter mutagenesis database.Database : the journal of biological databases and curation · 2010
    Article
  18. Article
  19. Article
  20. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors at 2 institutions in 2 countries.

Lawrence C LeeDepartment of Cellular and Molecular Pharmacology, University of California San Francisco, San Francisco, California, United States of America.
Florence Horn
Fred E Cohen
University of California, San Francisco · USCommissariat à l'Énergie Atomique et aux Énergies Alternatives · FR

Funding

Text Mining Point Mutations for Genetic Diagnosis ArrayF37LM008883 · NLM · UNIVERSITY OF CALIFORNIA, SAN FRANCISCO · PI LEE, LAWRENCE C · 2005 to 2007
$92k
NIGMS NIH HHS GM039900-15NLM NIH HHS F37 LM008883NLM NIH HHS LM008883-01
6 · The paper itself

Abstract

Protein point mutations are an essential component of the evolutionary and experimental analysis of protein structure and function. While many manually curated databases attempt to index point mutations, most experimentally generated point mutations and the biological impacts of the changes are described in the peer-reviewed published literature. We describe an application, Mutation GraB (Graph Bigram), that identifies, extracts, and verifies point mutations from biomedical literature. The principal problem of point mutation extraction is to link the point mutation with its associated protein and organism of origin. Our algorithm uses a graph-based bigram traversal to identify these relevant associations and exploits the Swiss-Prot protein database to verify this information. The graph bigram method is different from other models for point mutation extraction in that it incorporates frequency and positional data of all terms in an article to drive the point mutation-protein association. Our method was tested on 589 articles describing point mutations from the G protein-coupled receptor (GPCR), tyrosine kinase, and ion channel protein families. We evaluated our graph bigram metric against a word-proximity metric for term association on datasets of full-text literature in these three different protein families. Our testing shows that the graph bigram metric achieves a higher F-measure for the GPCRs (0.79 versus 0.76), protein tyrosine kinases (0.72 versus 0.69), and ion channel transporters (0.76 versus 0.74). Importantly, in situations where more than one protein can be assigned to a point mutation and disambiguation is required, the graph bigram metric achieves a precision of 0.84 compared with the word distance metric precision of 0.73. We believe the graph bigram search metric to be a significant improvement over previous search metrics for point mutation extraction and to be applicable to text-mining application requiring the association of words.

Indexed as

AlgorithmsArtificial IntelligenceDatabases, ProteinMutationInformation Storage and RetrievalPattern Recognition, AutomatedProteinsSequence AlignmentSequence Analysis, ProteinSequence Homology, Amino AcidProteins

Identifiers

PMID17274683
PMCPMC1794323
OpenAlexW2018740767

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.