{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T20:25:34Z","timestamp":1778099134671,"version":"3.51.4"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T00:00:00Z","timestamp":1508803200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Iran J Comput Sci"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s42044-017-0001-2","type":"journal-article","created":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T04:06:16Z","timestamp":1508817976000},"page":"11-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A parallel algorithm for generation of RNA secondary structures with length n and k base-pairs"],"prefix":"10.1007","volume":"1","author":[{"given":"Shahin","family":"Mohammadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4598-2645","authenticated-orcid":false,"given":"Abbas","family":"Nowzari-Dalini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,24]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1093\/jigpal\/jzp097","volume":"19","author":"A Ahmadi-Adl","year":"2011","unstructured":"Ahmadi-Adl, A., Ahrabian, H., Nowzari-Dalini, A.: Ranking and unranking algorithms for loopless generation of \n                        $$t$$\n                        \n                            \n                                t\n                            \n                        \n                    -ary trees. Log. J. IGPL 19, 33\u201343 (2011)","journal-title":"Log. J. IGPL"},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1093\/comjnl\/bxm027","volume":"50","author":"H Ahrabian","year":"2007","unstructured":"Ahrabian, H., Nowzari-Dalini, A.: Parallel generation of \n                        $$t$$\n                        \n                            \n                                t\n                            \n                        \n                    -ary trees in a-order. Comput. J. 50, 581\u2013588 (2007)","journal-title":"Comput. J."},{"key":"1_CR3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0020-0190(89)90192-0","volume":"33","author":"SG Akl","year":"1990","unstructured":"Akl, S.G., Gries, D., Stojmenovic, I.: An optimal parallel algorithm for generating combination. Inf. Process. Lett. 33, 135\u2013139 (1990)","journal-title":"Inf. Process. Lett."},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1006\/jpdc.1994.1008","volume":"20","author":"SG Akl","year":"1994","unstructured":"Akl, S.G., Meijer, H., Stojmenovic, I.: An optimal systolic algorithm for generating permutations in lexicographic order. J. Parallel Distrib. Comput. 20, 84\u201391 (1994)","journal-title":"J. Parallel Distrib. Comput."},{"key":"1_CR5","first-page":"63","volume":"3","author":"SG Akl","year":"1996","unstructured":"Akl, S.G., Stojmenovic, I.: Generating \n                        $$t$$\n                        \n                            \n                                t\n                            \n                        \n                    -ary trees in parallel. Nordic J. Comput. 3, 63\u201371 (1996)","journal-title":"Nordic J. Comput."},{"key":"1_CR6","doi-asserted-by":"crossref","first-page":"9635","DOI":"10.1073\/pnas.87.24.9635","volume":"87","author":"WY Chen","year":"1990","unstructured":"Chen, W.Y.: A general bijective algorithm for trees. PNAS 87, 9635\u20139639 (1990)","journal-title":"PNAS"},{"key":"1_CR7","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0012-365X(80)90168-5","volume":"31","author":"N Dershowitz","year":"1980","unstructured":"Dershowitz, N., Zaks, S.: Enumerations of ordered trees. Discrete Math. 31, 9\u201328 (1980)","journal-title":"Discrete Math."},{"key":"1_CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0020-0190(02)00481-7","volume":"86","author":"S Effler","year":"2003","unstructured":"Effler, S., Ruskey, F.: A CAT algorithm for generating permutations with a fixed number of inversions. Inf. Process. Lett. 86, 107\u2013112 (2003)","journal-title":"Inf. Process. Lett."},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1093\/comjnl\/35.3.306","volume":"35","author":"MC Er","year":"1992","unstructured":"Er, M.C.: Efficient generation of \n                        $$k$$\n                        \n                            \n                                k\n                            \n                        \n                    -ary trees in natural order. Comput. J. 35, 306\u2013308 (1992)","journal-title":"Comput. J."},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"5954","DOI":"10.1016\/j.disc.2007.11.012","volume":"308","author":"S Heubach","year":"2008","unstructured":"Heubach, S., Li, N., Mansour, T.: Staircase tilings and \n                        $$k$$\n                        \n                            \n                                k\n                            \n                        \n                    -catalan structures. Discrete Math. 308, 5954\u20135964 (2008)","journal-title":"Discrete Math."},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1006\/jpdc.1993.1030","volume":"17","author":"A Kapralski","year":"1992","unstructured":"Kapralski, A.: New methods for the generation of permutations, combinations and other combinatorial objects in parallel. J. Parallel Distrib. Comput. 17, 315\u2013329 (1992)","journal-title":"J. Parallel Distrib. Comput."},{"key":"1_CR12","unstructured":"Knuth, D.E.: The art of computer programming, volume 4 combinatorial algorithms. Addison-Wesley, Reading (2006)"},{"key":"1_CR13","first-page":"557","volume":"16","author":"JF Korsh","year":"1995","unstructured":"Korsh, J.F.: A-order generation of \n                        $$k$$\n                        \n                            \n                                k\n                            \n                        \n                    -ary trees with \n                        $$4k-4$$\n                        \n                            \n                                \n                                    4\n                                    k\n                                    -\n                                    4\n                                \n                            \n                        \n                     letter alphabet. J. Inf. Optim. Sci. 16, 557\u2013567 (1995)","journal-title":"J. Inf. Optim. Sci."},{"key":"1_CR14","volume-title":"Combinatorial Algorithms","author":"DL Kreher","year":"1999","unstructured":"Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms. CRC Press, New York (1999)"},{"key":"1_CR15","first-page":"1","volume":"12","author":"K Manes","year":"2009","unstructured":"Manes, K., Sapounakis, A., Tasoulas, I., Tsikouras, P.: Recursive generation of \n                        $$k$$\n                        \n                            \n                                k\n                            \n                        \n                    -ary trees. J. Integer Seq. 12, 1\u201318 (2009)","journal-title":"J. Integer Seq."},{"key":"1_CR16","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1080\/00207168708803562","volume":"21","author":"J Pallo","year":"1987","unstructured":"Pallo, J.: Generating trees with \n                        $$n$$\n                        \n                            \n                                n\n                            \n                        \n                     nodes and \n                        $$m$$\n                        \n                            \n                                m\n                            \n                        \n                     leaves. Int. J. Comput. Math. 21, 133\u2013144 (1987)","journal-title":"Int. J. Comput. Math."},{"key":"1_CR17","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0169-2607(90)90038-B","volume":"33","author":"J Pallo","year":"1990","unstructured":"Pallo, J.: A simple algorithm for generating neuronal dendritic trees. Comput. Methods Progr. Biomed. 33, 165\u2013169 (1990)","journal-title":"Comput. Methods Progr. Biomed."},{"key":"1_CR18","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/00207168508803477","volume":"18","author":"J Pallo","year":"1985","unstructured":"Pallo, J., Racca, R.: A note on generating binary tree in A-order and B-order. Int. J. Comput. Math. 18, 27\u201339 (1985)","journal-title":"Int. J. Comput. Math."},{"key":"1_CR19","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(83)90255-8","volume":"46","author":"H Prodinger","year":"1983","unstructured":"Prodinger, H.: A correspondence between orderd trees and nondecreasing partitions. Discrete Math. 46, 205\u2013206 (1983)","journal-title":"Discrete Math."},{"key":"1_CR20","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0020-0190(88)90027-0","volume":"27","author":"D Roelants van Baronaigien","year":"1988","unstructured":"Roelants van Baronaigien, D., Ruskey, F.: Generating \n                        $$t$$\n                        \n                            \n                                t\n                            \n                        \n                    -ary trees in A-order. Inf. Process. Lett. 27, 205\u2013213 (1988)","journal-title":"Inf. Process. Lett."},{"key":"1_CR21","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1137\/0206055","volume":"6","author":"F Ruskey","year":"1977","unstructured":"Ruskey, F., Hu, T.C.: Generating binary tree lexicographically. SIAM J. Comput. 6, 745\u2013758 (1977)","journal-title":"SIAM J. Comput."},{"key":"1_CR22","doi-asserted-by":"crossref","first-page":"5305","DOI":"10.1016\/j.disc.2007.11.048","volume":"309","author":"F Ruskey","year":"2006","unstructured":"Ruskey, F., Williams, A.: The coolest way to generate combinations. Discrete Math. 309, 5305\u20135320 (2006)","journal-title":"Discrete Math."},{"key":"1_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1125994.1125995","volume":"2","author":"J Sawada","year":"2006","unstructured":"Sawada, J.: Generating rooted and free plane trees. ACM Trans. Algorithms 2, 1\u201313 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"1_CR24","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0166-218X(92)00038-N","volume":"51","author":"WR Schmitt","year":"1994","unstructured":"Schmitt, W.R., Waterman, M.S.: Linear trees and RNA secondary structure. Discrete Appl. Math. 51, 317\u2013323 (1994)","journal-title":"Discrete Appl. Math."},{"key":"1_CR25","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0304-3975(88)90169-7","volume":"57","author":"W Skarbek","year":"1988","unstructured":"Skarbek, W.: Generating ordered trees. Theor. Comput. Sci. 57, 153\u2013159 (1988)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR26","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1080\/17445760500355777","volume":"21","author":"I Stojmenovic","year":"2006","unstructured":"Stojmenovic, I.: Listing combinatorial objects in parallel. Int. J. Parallel Emergent Distrib. Syst. 21, 127\u2013146 (2006)","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"key":"1_CR27","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1080\/00207160802140049","volume":"86","author":"S Tabari","year":"2010","unstructured":"Tabari, S., Ahrabian, H., Nowzari-Dalini, A.: A new algorithm for generation of different types of RNA with length \n                        $$n$$\n                        \n                            \n                                n\n                            \n                        \n                    . Int. J. Comput. Math. 86, 1197\u20131207 (2010)","journal-title":"Int. J. Comput. Math."},{"key":"1_CR28","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1093\/comjnl\/42.5.400","volume":"42","author":"T Takaoka","year":"1999","unstructured":"Takaoka, T.: \n                        $$O(1)$$\n                        \n                            \n                                \n                                    O\n                                    (\n                                    1\n                                    )\n                                \n                            \n                        \n                     time algorithms for combinatorial generation by tree traversal. Comput. J. 42, 400\u2013408 (1999)","journal-title":"Comput. J."},{"key":"1_CR29","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1142\/S0129626498000055","volume":"8","author":"V Vajnovszki","year":"1998","unstructured":"Vajnovszki, V., Pallo, J.: Parallel algorithms for listing well-formed parentheses strings. Parallel Process. Lett. 8, 19\u201328 (1998)","journal-title":"Parallel Process. Lett."},{"key":"1_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-6846-3","volume-title":"Introduction to Computational Biology","author":"MS Waterman","year":"1995","unstructured":"Waterman, M.S.: Introduction to Computational Biology. CRC Press, New York (1995)"},{"key":"1_CR31","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1137\/0215039","volume":"15","author":"RA Wright","year":"1986","unstructured":"Wright, R.A., Richmond, B., Odlyzko, A., McKey, B.D.: Constant time generation of free trees. SIAM J. Comput. 15, 540\u2013548 (1986)","journal-title":"SIAM J. Comput."},{"key":"1_CR32","doi-asserted-by":"crossref","first-page":"1331","DOI":"10.1016\/j.mcm.2010.12.019","volume":"53","author":"R Wu","year":"2011","unstructured":"Wu, R., Chang, J., Chang, C.: Ranking and unranking of non-regular trees with a prescribed branching sequence. Math. Comput. Model. 53, 1331\u20131335 (2011)","journal-title":"Math. Comput. Model."},{"key":"1_CR33","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1093\/comjnl\/bxp015","volume":"53","author":"R Wu","year":"2010","unstructured":"Wu, R., Chang, J., Wang, Y.: Loopless generation of non-regular trees with a prescribed branching sequence. Comput. J. 53, 661\u2013666 (2010)","journal-title":"Comput. J."},{"key":"1_CR34","doi-asserted-by":"crossref","first-page":"1388","DOI":"10.1093\/comjnl\/bxs143","volume":"56","author":"R Wu","year":"2013","unstructured":"Wu, R., Chang, J., Chen, A., Liu, C.: Ranking and unranking t-ary trees in a Gray-code order. Comput. J. 56, 1388\u20131395 (2013)","journal-title":"Comput. J."},{"key":"1_CR35","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1093\/comjnl\/43.4.290","volume":"43","author":"L Xiang","year":"2000","unstructured":"Xiang, L., Ushijima, K., Akl, S.: Generating regular \n                        $$k$$\n                        \n                            \n                                k\n                            \n                        \n                    -ary trees efficiently. Comput. J. 43, 290\u2013300 (2000)","journal-title":"Comput. J."},{"key":"1_CR36","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(80)90073-0","volume":"10","author":"S Zaks","year":"1980","unstructured":"Zaks, S.: Lexicographic generation of ordered tree. Theor. Comput. Sci. 10, 63\u201382 (1980)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR37","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/0020-0190(82)90140-5","volume":"14","author":"S Zaks","year":"1982","unstructured":"Zaks, S.: Generation and ranking of \n                        $$k$$\n                        \n                            \n                                k\n                            \n                        \n                    -ary trees. Inf. Process. Lett. 14, 44\u201348 (1982)","journal-title":"Inf. Process. Lett."},{"key":"1_CR38","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1137\/0208006","volume":"8","author":"S Zaks","year":"1979","unstructured":"Zaks, S., Richards, D.: Generating trees and other combinatorial objects lexicographically. SIAM J. Comput. 8, 73\u201381 (1979)","journal-title":"SIAM J. Comput."},{"key":"1_CR39","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1080\/00207169808804755","volume":"70","author":"A Zoghbi","year":"1998","unstructured":"Zoghbi, A., Stojmenovic, I.: Fast algorithms for generating integer partitions. Int. J. Comput. Math. 70, 319\u2013332 (1998)","journal-title":"Int. J. Comput. Math."}],"container-title":["Iran Journal of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s42044-017-0001-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42044-017-0001-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42044-017-0001-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,21]],"date-time":"2018-03-21T08:22:03Z","timestamp":1521620523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s42044-017-0001-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,24]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["1"],"URL":"https:\/\/doi.org\/10.1007\/s42044-017-0001-2","relation":{},"ISSN":["2520-8438","2520-8446"],"issn-type":[{"value":"2520-8438","type":"print"},{"value":"2520-8446","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,24]]}}}