Evidence map›Paper›PMID 24564945›Full record

ArticleBMC systems biology2013

SPIC: a novel similarity metric for comparing transcription factor binding site motifs based on information contents.

Shaoqiang Zhang, Xiguo Zhou, Chuanbin Du, Zhengchang Su

Open access · diamondAbstract read
In one paragraph

Article in BMC systems biology, 2013. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 10 papers.

0numbers the graph read from it
0cells of the map it votes in
10citing papers in PubMed
0.6field-weighted citation impact, top 32% 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

10 citing papers in PubMed, 16 citations in OpenAlex.

  1. Article
  2. Accurate prediction ofNAR genomics and bioinformatics · 2021
    Article
  3. FisherMP: fully parallel algorithm for detecting combinatorial motifs from large ChIP-seq datasets.DNA research : an international journal for rapid publication of reports on genes and genomes · 2019
    Article
  4. Article
  5. Performance evaluation for MOTIFSIM.Biological procedures online · 2018
    Article
  6. GSMC: Combining Parallel Gibbs Sampling with Maximal Cliques for Hunting DNA Motif.Journal of computational biology : a journal of computational molecular cell biology · 2017
    Article
  7. Article
  8. Article
  9. Article
  10. 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

4 authors at 2 institutions in 2 countries.

Shaoqiang Zhang
Xiguo Zhou
Chuanbin Du
Zhengchang Su
Tianjin Normal University · CNUniversity of North Carolina at Charlotte · US

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundDiscovering transcription factor binding sites (TFBS) is one of primary challenges to decipher complex gene regulatory networks encrypted in a genome. A set of short DNA sequences identified by a transcription factor (TF) is known as a motif, which can be expressed accurately in matrix form such as a position-specific scoring matrix (PSSM) and a position frequency matrix. Very frequently, we need to query a motif in a database of motifs by seeking its similar motifs, merge similar TFBS motifs possibly identified by the same TF, separate irrelevant motifs, or filter out spurious motifs. Therefore, a novel metric is required to seize slight differences between irrelevant motifs and highlight the similarity between motifs of the same group in all these applications. While there are already several metrics for motif similarity proposed before, their performance is still far from satisfactory for these applications.

methodsA novel metric has been proposed in this paper with name as SPIC (Similarity with Position Information Contents) for measuring the similarity between a column of a motif and a column of another motif. When defining this similarity score, we consider the likelihood that the column of the first motif's PFM can be produced by the column of the second motif's PSSM, and multiply the likelihood by the information content of the column of the second motif's PSSM, and vise versa. We evaluated the performance of SPIC combined with a local or a global alignment method having a function for affine gap penalty, for computing the similarity between two motifs. We also compared SPIC with seven existing state-of-the-arts metrics for their capability of clustering motifs from the same group and retrieving motifs from a database on three datasets.

resultsWhen used jointly with the Smith-Waterman local alignment method with an affine gap penalty function (gap open penalty is equal to 1, gap extension penalty is equal to 0.5), SPIC outperforms the seven existing state-of-the-art motif similarity metrics combined with their best alignments for matching motifs in database searches, and clustering the same TF's sub-motifs or distinguishing relevant ones from a miscellaneous group of motifs.

conclusionsWe have developed a novel motif similarity metric that can more accurately match motifs in database searches, and more effectively cluster similar motifs and differentiate irrelevant motifs than do the other seven metrics we are aware of.

Indexed as

AlgorithmsNucleotide MotifsBinding SitesCluster AnalysisComputational BiologyDatabases, GeneticTranscription FactorsTranscription Factors

Identifiers

PMID24564945
PMCPMC3866262
OpenAlexW2024435696

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.