Evidence map›Paper›PMID 27843946›Full record

ArticleBioMed research international2016

PairMotifChIP: A Fast Algorithm for Discovery of Patterns Conserved in Large ChIP-seq Data Sets.

Qiang Yu, Hongwei Huo, Dazheng Feng

Abstract read
In one paragraph

Article in BioMed research international, 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
–field-weighted citation impact
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

2 citing papers in PubMed.

  1. Article
  2. Review
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.

Qiang YuSchool of Computer Science and Technology, Xidian University, Xi'an 710071, China.ORCID 0000-0002-8725-6687
Hongwei HuoSchool of Computer Science and Technology, Xidian University, Xi'an 710071, China.
Dazheng FengSchool of Electronic Engineering, Xidian University, Xi'an 710071, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Identifying conserved patterns in DNA sequences, namely, motif discovery, is an important and challenging computational task. With hundreds or more sequences contained, the high-throughput sequencing data set is helpful to improve the identification accuracy of motif discovery but requires an even higher computing performance. To efficiently identify motifs in large DNA data sets, a new algorithm called PairMotifChIP is proposed by extracting and combining pairs of

Indexed as

AlgorithmsChromatin ImmunoprecipitationDatabases, GeneticSequence Analysis, DNAAnimalsBase SequenceComputer SimulationMiceMouse Embryonic Stem CellsNucleotide MotifsProbabilityTime Factors

Identifiers

PMID27843946
PMCPMC5098105

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.