2021
DOI: 10.1093/bib/bbab198
|View full text |Cite
|
Sign up to set email alerts
|

TSSFinder—fast and accurateab initioprediction of the core promoter in eukaryotic genomes

Abstract: Promoter annotation is an important task in the analysis of a genome. One of the main challenges for this task is locating the border between the promoter region and the transcribing region of the gene, the transcription start site (TSS). The TSS is the reference point to delimit the DNA sequence responsible for the assembly of the transcribing complex. As the same gene can have more than one TSS, so to delimit the promoter region, it is important to locate the closest TSS to the site of the beginning of the t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 13 publications
(9 citation statements)
references
References 58 publications
0
9
0
Order By: Relevance
“…A new algorithm and software package for TSS search, TSSFinder, has recently been developed based on the linear chain conditional random fields (LCCRFs) method [ 24 ]. Compared with the other algorithms, TSSFinder shows high accuracy in detecting TSSs of coding genes, whereas for the genes with a dispersed TSS signal, it determines the TSS closest to the start codon.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…A new algorithm and software package for TSS search, TSSFinder, has recently been developed based on the linear chain conditional random fields (LCCRFs) method [ 24 ]. Compared with the other algorithms, TSSFinder shows high accuracy in detecting TSSs of coding genes, whereas for the genes with a dispersed TSS signal, it determines the TSS closest to the start codon.…”
Section: Resultsmentioning
confidence: 99%
“…Therefore, a problem that cannot be solved by the currently developed mathematical methods is the generation of a large number of false positives. Thus, even the best promoter search programs produce one false positive result per 20,000 bp [ 19 , 20 , 21 , 22 , 23 , 24 , 25 ], which, if extrapolated to a whole genome of about 3 × 10 9 bp, yields more than 300,000 false positives. Given that such a genome contains over 10 4 genes, it means that the number of false positives exceeds that of gene promoters by several times.…”
Section: Introductionmentioning
confidence: 99%
“…Potato peroxidases were identified with protein sequence BLAST against the RedoxiBase database 56 and the secretory signal peptides were predicted with SignalP 5.0 57 (Supplementary Table 5). Predictions of transcription factor binding motifs in promoter sequences were performed with TRANSFAC 58 and predictions of transcription start sites with TSSFinder 59 .…”
Section: Methodsmentioning
confidence: 99%
“…Several computational approaches have been developed to provide fast and accurate ways to predict the location of TSSs and regulatory motifs on the whole-genome scale. These include Bayesian classification based on positional densities of oligonucleotides for detecting TSS in human genomic sequences [19], neural networks for predicting TSS in plant promoters [20,21], and conditional random fields for identifying TSS in eukaryotic promoters [22]. Strategies for genome-wide discovery of novel cis-regulatory motifs using position weight matrices (PWMs) and expression data were successfully implemented for rice and Arabidopsis [6,23], hop [24], and grapevine [25].…”
Section: Introductionmentioning
confidence: 99%