Evidence map›Paper›PMID 27134638›Full record

ArticlePlant methods2016

ExactSearch: a web-based plant motif search tool.

Chathura Gunasekara, Avinash Subramanian, Janaki Venkata Ram Kumar Avvari, Bin Li, Su Chen, Hairong Wei

Abstract read
In one paragraph

Article in Plant methods, 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing 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

3 citing papers in PubMed.

  1. Frontiers in plant science · 2022
    Article
  2. Characterization of a High Hierarchical Regulator,Frontiers in plant science · 2021
    Article
  3. 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

6 authors.

Chathura GunasekaraSchool of Forest Resources and Environmental Science, Michigan Technological University, Houghton, MI 49931 USA.
Avinash SubramanianDepartment of Computer Science, Michigan Technological University, Houghton, MI USA.
Janaki Venkata Ram Kumar AvvariDepartment of Computer Science, Michigan Technological University, Houghton, MI USA.
Bin LiDepartment of Computer Science, Michigan Technological University, Houghton, MI USA.
Su ChenState Key Laboratory of Forest Genetics and Tree Breeding, Northeast Forestry University, Harbin, Heilongjiang 150040 People's Republic of China.
Hairong WeiSchool of Forest Resources and Environmental Science, Michigan Technological University, Houghton, MI 49931 USA ; Department of Computer Science, Michigan Technological University, Houghton, MI USA ; Life Science and Technology Institute, Michigan Technological University Houghton, Michigan, MI 49931 USA.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundPlant biologists frequently need to examine if a sequence motif bound by a specific transcription or translation factor is present in the proximal promoters or 3' untranslated regions (3' UTR) of a set of plant genes of interest. To achieve such a task, plant biologists have to not only identify an appropriate algorithm for motif searching, but also manipulate the large volume of sequence data, making it burdensome to carry out or fulfill.

resultIn this study, we developed a web portal that enables plant molecular biologists to search for DNA motifs especially degenerate ones in custom sequences or the flanking regions of all genes in the 50 plant species whose genomes have been sequenced. A web tool like this is demanded to meet a variety of needs of plant biologists for identifying the potential gene regulatory relationships. We implemented a suffix tree algorithm to accelerate the searching process of a group of motifs in a multitude of target genes. The motifs to be searched can be in the degenerate bases in addition to adenine (A), cytosine (C), guanine (G), and thymine (T). The target sequences to be searched can be custom sequences or the selected proximal gene sequences from any one of the 50 sequenced plant species. The web portal also contains the functionality to facilitate the search of motifs that are represented by position probability matrix in above-mentioned species. Currently, the algorithm can accomplish an exhaust search of 100 motifs in 35,000 target sequences of 2 kb long in 4.2 min. However, the runtime may change in the future depending on the space availability, number of running jobs, network traffic, data loading, and output packing and delivery through electronic mailing.

conclusionA web portal was developed to facilitate searching of motifs presents in custom sequences or the proximal promoters or 3' UTR of 50 plant species with the sequenced genomes. This web tool is accessible by using this URL: http://sys.bio.mtu.edu/motif/index.php.

Identifiers

PMID27134638
PMCPMC4850730

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.