In a previous paper, an algorithm was presented for analyzing multiple RNA secondary structures utilizing a multiple string alignment algorithm. In this paper we present another approach to the problem of comparing many secondary structures by utilizing a very efficient tree-matching algorithm that will compare two trees in O([T1] X [T2] X L1 X L2) in the worst case and very close to O([T1] X [T2]) for average trees representing secondary structures. The result of the pairwise comparison algorithm is then used with a cluster algorithm to produce a multiple structure clustering which can be displayed in a taxonomy tree to show related structures.
No. 2 Wenbo Road, Zhangqiu District, Jinan, Shandong
Qilu Normal University · Genelibs Bioinformatics Lab
750 Shunhua Rd, Jinan
2F, Bldg F, University Science Park
Tel: 0531-88819269
Follow our WeChat subscription account for real-time updates and the latest in medical and biological research.
Business Email
E-mail: [email protected]