DSARna: RNA Secondary Structure Alignment Based on Digital Sequence Representation

With increasing applications and development of high-throughput sequencing, knowledge of the primary structure of RNA has expanded exponentially. Moreover, the function of RNA is determined by the secondary or higher RNA structure, and similar structures are related to similar functions, such as the...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Combinatorial chemistry & high throughput screening Ročník 24; číslo 7; s. 1042
Hlavní autori: Gao, Longjian, Xu, Chengzhen, Song, Wangan, Xiao, Feng, Wu, Xiaomin, Shi, Li, Sun, Yuxuan, Li, Jun
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: United Arab Emirates 01.01.2021
Predmet:
Algorithms
Computational Biology
Nucleic Acid Conformation
RNA - chemistry
Sequence Alignment
Sequence Analysis, RNA
Dynamic programming
structural alignment
RNA secondary structure
path matrix
ISSN:1875-5402, 1875-5402
On-line prístup:Zistit podrobnosti o prístupe
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:With increasing applications and development of high-throughput sequencing, knowledge of the primary structure of RNA has expanded exponentially. Moreover, the function of RNA is determined by the secondary or higher RNA structure, and similar structures are related to similar functions, such as the secondary clover structure of tRNA. Therefore, RNA structure alignment is an important subject in computational biology and bioinformatics to predict function accurately. However, the traditional RNA structure alignment algorithms have some drawbacks such as high complexity and easy loss of secondary structure information. To study R,,NA secondary structure alignment according to the shortcomings of existing secondary structure alignment algorithms and the characteristics of RNA secondary structure. We propose a new digital sequence RNA structure representation algorithm named "DSARna". Then based on a dynamic programming algorithm, the scoring matrix and binary path matrix are simultaneously constructed. The backtracking path is identified in the path matrix, and the optimal result is predicted according to the path length. Upon comparison with the existing SimTree algorithm through experimental analysis, the proposed method showed higher accuracy and could ensure that the structural information is not easily lost in terms of improved specificity, sensitivity, and the Matthews correlation coefficient.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1875-5402
1875-5402
DOI:10.2174/1386207323666200811100338