{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:50:03Z","timestamp":1754157003005,"version":"3.41.2"},"reference-count":11,"publisher":"Emerald","issue":"6","license":[{"start":{"date-parts":[[2010,6,15]],"date-time":"2010-06-15T00:00:00Z","timestamp":1276560000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6,15]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>The purpose of this paper is to design an algorithm to predict RNA secondary structure, compared with other relevant algorithm, its time complexity and space complexity are reduced.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>The dynamic programming algorithm need more time and space; it is very difficult to predict the RNA secondary structure which have more 1,000 bases. The nested RNA secondary structure algorithms cannot predict the RNA secondary structure containing pseudoknots, so the fast algorithm is needed to predict the RNA secondary structure containing pseudoknots urgently. Based on the greedy principle, a model is designed to solve the problem.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>A greedy algorithm is presented to predict RNA secondary structure.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Research limitations\/implications<\/jats:title><jats:p>The problem for predicting RNA secondary structure including pseudoknots is NP\u2010complete.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Practical implications<\/jats:title><jats:p>The paper presents a valuable and useful method for predicting the RNA secondary structure.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>The new algorithm needs O(n<jats:sup>3<\/jats:sup>) time and O(n) space; the experimental results indicate that the algorithm has good accuracy and sensitivity.<\/jats:p><\/jats:sec>","DOI":"10.1108\/03684921011046825","type":"journal-article","created":{"date-parts":[[2010,7,11]],"date-time":"2010-07-11T21:14:29Z","timestamp":1278882869000},"page":"1050-1057","source":"Crossref","is-referenced-by-count":19,"title":["A predicting algorithm of RNA secondary structure based on stems"],"prefix":"10.1108","volume":"39","author":[{"given":"Zhendong","family":"Liu","sequence":"first","affiliation":[]},{"given":"Hengwu","family":"Li","sequence":"additional","affiliation":[]},{"given":"Daming","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"key":"key2022013020445852200_b6","doi-asserted-by":"crossref","unstructured":"Abrahams, J.P., Van Derberg, M., Batenburg, E. and Pleij, C. (1990), \u201cPrediction of RNA secondary structure including pseudoknotting, by computer simulation\u201d, Nucleic Acids Research, Vol. 18 No. 10, pp. 3035\u201044.","DOI":"10.1093\/nar\/18.10.3035"},{"key":"key2022013020445852200_b10","doi-asserted-by":"crossref","unstructured":"Jaeger, J.A., Turner, D.H. and Zuker, M. (1989), \u201cImproved predictions of secondary structures for RNA\u201d, Proc. Natl. Acad. Sci., Vol. 86 No. 20, pp. 7706\u201010.","DOI":"10.1073\/pnas.86.20.7706"},{"key":"key2022013020445852200_b8","unstructured":"Kang, Z., Zhen, H.G. and Jin, X. (2005), \u201cAn algorithm of DNA computing on 0\u20101 planning problem\u201d, Advances in Systems Science and Applications, Vol. 5 No. 4, pp. 587\u201093."},{"key":"key2022013020445852200_b7","unstructured":"Liu, X., Li, Y. and Xu, J. (2003), \u201cDNA computing for minimum spanning tree problem\u201d, Advances in Systems Science and Applications, Vol. 3 No. 2, pp. 226\u201031."},{"key":"key2022013020445852200_b1","unstructured":"Lyngs, R.B. and Christian, N.S. (2000), \u201cPseudoknots in RNA secondary structure\u201d, Proceedings of Recomb, Tokyo, Japan, USA."},{"key":"key2022013020445852200_b5","doi-asserted-by":"crossref","unstructured":"Nussinov, R. and Jacobson, A.B. (1980), \u201cFast algorithm for predicting the secondary structure of singe\u2010stranded RNA\u201d, Proc. Natl. Acad. Sct., Vol. 77 No. 11, pp. 6309\u201013.","DOI":"10.1073\/pnas.77.11.6309"},{"key":"key2022013020445852200_b11","unstructured":"PseudoBase:Theoretical Biology (1998), available at: www.bio.leidenuniv.nl\/\u223cBatenburg\/PKBGet.html (accessed 2007)."},{"key":"key2022013020445852200_b3","doi-asserted-by":"crossref","unstructured":"Reeder, J. and Giegerich, R. (2004), \u201cDesign, implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics\u201d, BMC Bioinformatics, Vol. 5, p. 104.","DOI":"10.1186\/1471-2105-5-104"},{"key":"key2022013020445852200_b2","doi-asserted-by":"crossref","unstructured":"Rivals, E. and Eddy, S. (1999), \u201cA Dynamic programming algorithm for RNA structure prediction including pseudoknots\u201d, Journal of Molecular Biology, Vol. 285, pp. 2053\u201068.","DOI":"10.1006\/jmbi.1998.2436"},{"key":"key2022013020445852200_b9","doi-asserted-by":"crossref","unstructured":"Turner, D.H., Sugimoto, N. and Freier, S.M. (1988), \u201cRNA structure prediction\u201d, Annual Rewiew of Biophysics Chemistry, Vol. 17, pp. 167\u201092.","DOI":"10.1146\/annurev.bb.17.060188.001123"},{"key":"key2022013020445852200_b4","unstructured":"Zhang, G. and Zhang, Y. (2003), \u201cHydrothermal generation scheduling with a stochastic dual dynamic programming algorithm\u201d, Advances in Systems Science and Applications, Vol. 3 No. 3, pp. 383\u20109."}],"container-title":["Kybernetes"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/03684921011046825","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/03684921011046825\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/03684921011046825\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:27:00Z","timestamp":1753399620000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/k\/article\/39\/6\/1050-1057\/271115"}},"subtitle":[],"editor":[{"given":"Hejing","family":"Xiong","sequence":"first","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2010,6,15]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2010,6,15]]}},"alternative-id":["10.1108\/03684921011046825"],"URL":"https:\/\/doi.org\/10.1108\/03684921011046825","relation":{},"ISSN":["0368-492X"],"issn-type":[{"type":"print","value":"0368-492X"}],"subject":[],"published":{"date-parts":[[2010,6,15]]}}}