2018
DOI: 10.1186/s12859-018-2018-4
|View full text |Cite
|
Sign up to set email alerts
|

Capturing alternative secondary structures of RNA by decomposition of base-pairing probabilities

Abstract: BackgroundIt is known that functional RNAs often switch their functions by forming different secondary structures. Popular tools for RNA secondary structures prediction, however, predict the single ‘best’ structures, and do not produce alternative structures. There are bioinformatics tools to predict suboptimal structures, but it is difficult to detect which alternative secondary structures are essential.ResultsWe proposed a new computational method to detect essential alternative secondary structures from RNA… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 8 publications
(17 citation statements)
references
References 17 publications
0
16
0
Order By: Relevance
“…RintW + maximum-span. At first, we introduced maximum-span constraint in base pairs to the baseline algorithm of RintW (6). Detailed descriptions of RintW and the proposed method are in the accompanying supplementary file.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…RintW + maximum-span. At first, we introduced maximum-span constraint in base pairs to the baseline algorithm of RintW (6). Detailed descriptions of RintW and the proposed method are in the accompanying supplementary file.…”
Section: Methodsmentioning
confidence: 99%
“…The computational costs of basic algorithms used by previous methods are high, but the Fourier transform has been shown to reduce the time complexity of analysis. (4), (5), (6) Those previous methods, however, cannot be used to analyze long ncRNAs (e.g., > 1000 nucleotides) because the computational complexities are still too high. In this paper, we show that further reduction of computational complexity is possible by introducing maximum-span constraint on basepairs (7).…”
Section: Introductionmentioning
confidence: 99%
“…We measured the computation time in the case where the maximum-span constraint W = 100 is introduced and in the case where no restriction is applied (equivalent to RintW [7]) ( Fig. 1).…”
Section: Computation Timementioning
confidence: 99%
“…Initially, we introduced a maximum-span constraint in base-pairs to the baseline algorithm of RintW [7]. Detailed descriptions of RintW and the proposed method are described below.…”
Section: Rintw + Maximum-spanmentioning
confidence: 99%
See 1 more Smart Citation