{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T10:03:56Z","timestamp":1766311436135,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T00:00:00Z","timestamp":1556064000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1186\/s12859-019-2785-6","type":"journal-article","created":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T05:38:13Z","timestamp":1556084293000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Tiling Nussinov\u2019s RNA folding loop nest with a space-time approach"],"prefix":"10.1186","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5932-4523","authenticated-orcid":false,"given":"Marek","family":"Palkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wlodzimierz","family":"Bielecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,24]]},"reference":[{"issue":"1","key":"2785_CR1","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0135006","volume":"35","author":"R Nussinov","year":"1978","unstructured":"Nussinov R, Pieczenik G, Griggs JR, Kleitman DJ. Algorithms for Loop Matchings. SIAM J Appl Math. 1978; 35(1):68\u201382.","journal-title":"SIAM J Appl Math"},{"key":"2785_CR2","volume-title":"Proceedings of the 2009 ACM Symposium on Applied Computing. SAC \u201909","author":"A Mathuriya","year":"2009","unstructured":"Mathuriya A, Bader DA, Heitsch CE, Harvey SC. Gtfold: A scalable multicore code for rna secondary structure prediction. In: Proceedings of the 2009 ACM Symposium on Applied Computing. SAC \u201909. New York: ACM: 2009. p. 981\u20138."},{"volume-title":"UNAFold","year":"2008","key":"2785_CR3","unstructured":"Markham NR, Zuker M. In: Keith JM, (ed).UNAFold. Totowa: Humana Press; 2008. pp. 3\u201331."},{"issue":"10","key":"2785_CR4","doi-asserted-by":"publisher","first-page":"1172","DOI":"10.1093\/bioinformatics\/btl023","volume":"22","author":"IF Hofacker","year":"2006","unstructured":"Hofacker IF, Stadler PF. Memory efficient folding algorithms for circular RNA secondary structures. Bioinformatics. 2006; 22(10):1172\u20136. \n                    https:\/\/academic.oup.com\/bioinformatics\/article\/22\/10\/1172\/236586\n                    \n                  .","journal-title":"Bioinformatics"},{"issue":"8","key":"2785_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-15-S8-S1","volume":"15","author":"J Li","year":"2014","unstructured":"Li J, Ranka S, Sahni S. Multicore and GPU algorithms for Nussinov RNA folding. BMC Bioinformatics. 2014; 15(8):1. \n                    https:\/\/doi.org\/10.1186\/1471-2105-15-S8-S1\n                    \n                  .","journal-title":"BMC Bioinformatics"},{"issue":"15","key":"2785_CR6","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1186\/s12859-017-1917-0","volume":"18","author":"C Zhao","year":"2017","unstructured":"Zhao C, Sahni S. Cache and energy efficient algorithms for nussinov\u2019s rna folding. BMC Bioinformatics. 2017; 18(15):518.","journal-title":"BMC Bioinformatics"},{"key":"2785_CR7","volume-title":"IPDPS Workshops","author":"L Liu","year":"2011","unstructured":"Liu L, Wang M, Jiang J, Li R, Yang G. Efficient nonserial polyadic dynamic programming on the cell processor. In: IPDPS Workshops. Anchorage: IEEE: 2011. p. 460\u201371."},{"key":"2785_CR8","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564901","volume-title":"Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures. SPAA \u201902","author":"F Almeida","year":"2002","unstructured":"Almeida F, et al.Optimal tiling for the rna base pairing problem. In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures. SPAA \u201902. New York: ACM: 2002. p. 173\u201382. \n                    https:\/\/doi.org\/10.1145\/564870.564901\n                    \n                  ."},{"key":"2785_CR9","volume-title":"SC 2006 Conference, Proceedings of the ACM\/IEEE","author":"G Tan","year":"2006","unstructured":"Tan G, Feng S, Sun N. Locality and parallelism optimization for dynamic programming algorithm in bioinformatics. In: SC 2006 Conference, Proceedings of the ACM\/IEEE. Tampa: IEEE: 2006. p. 41."},{"key":"2785_CR10","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.2008.4580177","volume-title":"Proceedings of the 2008 International Conference on Application-Specific Systems, Architectures and Processors. ASAP \u201908","author":"A Jacob","year":"2008","unstructured":"Jacob A, Buhler J, Chamberlain RD. Accelerating Nussinov RNA secondary structure prediction with systolic arrays on FPGAs. In: Proceedings of the 2008 International Conference on Application-Specific Systems, Architectures and Processors. ASAP \u201908. Washington: IEEE Computer Society: 2008. p. 191\u20136. \n                    https:\/\/doi.org\/10.1109\/ASAP.2008.4580177\n                    \n                  ."},{"key":"2785_CR11","unstructured":"Mullapudi RT, Bondhugula U. Tiling for dynamic scheduling In: Rajopadhye S, Verdoolaege S, editors. Proceedings of the 4th International Workshop on Polyhedral Compilation Techniques. Vienna: 2014. \n                    http:\/\/impact.gforge.inria.fr\/impact2014\/papers\/impact2014-mullapudi.pdf\n                    \n                  . Accessed 15 Apr 2019."},{"key":"2785_CR12","doi-asserted-by":"publisher","unstructured":"Hammami E, Slama Y. An overview on loop tiling techniques for code generation. In: 2017 IEEE\/ACS 14th International Conference on Computer Systems and Applications (AICCSA): 2017. p. 280\u20137. \n                    https:\/\/doi.org\/10.1109\/AICCSA.2017.168\n                    \n                  .","DOI":"10.1109\/AICCSA.2017.168"},{"key":"2785_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4337-4","volume-title":"Loop Tiling for Parallelism","author":"J Xue","year":"2000","unstructured":"Xue J. Loop Tiling for Parallelism. Norwell: Kluwer Academic Publishers; 2000."},{"issue":"6","key":"2785_CR14","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/1379022.1375595","volume":"43","author":"U Bondhugula","year":"2008","unstructured":"Bondhugula U, Hartono A, Ramanujam J, Sadayappan P. A practical automatic polyhedral parallelizer and locality optimizer. SIGPLAN Not. 2008; 43(6):101\u201313.","journal-title":"SIGPLAN Not"},{"issue":"1","key":"2785_CR15","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1186\/s12859-017-1707-8","volume":"18","author":"M Palkowski","year":"2017","unstructured":"Palkowski M, Bielecki W. Parallel tiled Nussinov rna folding loop nest generated using both dependence graph transitive closure and loop skewing. BMC Bioinformatics. 2017; 18(1):290. \n                    https:\/\/doi.org\/10.1186\/s12859-017-1707-8\n                    \n                  .","journal-title":"BMC Bioinformatics"},{"key":"2785_CR16","unstructured":"Wonnacott D, Jin T, Lake A. Automatic tiling of \u2018mostly-tileable\u201d loop nests. In: IMPACT 2015: 5th, At Amsterdam, The Netherlands: 2015. \n                    http:\/\/impact.gforge.inria.fr\/impact2015\/papers\/impact2015-wonnacott.pdf\n                    \n                  . Accessed 15 Apr 2019."},{"issue":"1","key":"2785_CR17","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1186\/s12859-018-2008-6","volume":"19","author":"M Palkowski","year":"2018","unstructured":"Palkowski M, Bielecki W. Tuning iteration space slicing based tiled multi-core code implementing nussinov\u2019s rna folding. BMC Bioinformatics. 2018; 19(1):12.","journal-title":"BMC Bioinformatics"},{"key":"2785_CR18","unstructured":"Verdoolaege S, Grosser T. Polyhedral extraction tool. In: In Proceedings of the 2nd International Workshop on Polyhedral Compilation Techniques. Paris: 2012. \n                    http:\/\/impact.gforge.inria.fr\/impact2012\/workshop_IMPACT\/verdoolaege.pdf\n                    \n                  . Accessed 15 Apr 2019."},{"key":"2785_CR19","unstructured":"Verdoolaege S. Counting affine calculator and applications. In: First International Workshop on Polyhedral Compilation Techniques (IMPACT\u201911), Charmonix, France: 2011. \n                    http:\/\/perso.ens-lyon.fr\/christophe.alias\/impact2011\/impact-05.pdf\n                    \n                  . Accessed 15 Apr 2019."},{"key":"2785_CR20","unstructured":"Verdoolaege S. Integer set library - manual, \n                    http:\/\/isl.gforge.inria.fr\/manual.pdf\n                    \n                  . Technical report. 2011."},{"key":"2785_CR21","unstructured":"Verdoolaege S. barvinok: User guide 0.41: 2018. \n                    http:\/\/barvinok.gforge.inria.fr\/barvinok.pdf\n                    \n                  . Accessed 15 Apr 2019."},{"issue":"4","key":"2785_CR22","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF01407876","volume":"15","author":"M Wolfe","year":"1986","unstructured":"Wolfe M. Loops skewing: The wavefront method revisited. Int J Parallel Prog. 1986; 15(4):279\u201393.","journal-title":"Int J Parallel Prog"},{"issue":"4","key":"2785_CR23","first-page":"54","volume":"9","author":"S Verdoolaege","year":"2013","unstructured":"Verdoolaege S, Carlos Juega J, Cohen A, Ignacio Gomez J, Tenllado C, Catthoor F. Polyhedral parallel code generation for cuda. ACM Trans Archit Code Optim (TACO). 2013; 9(4):54.","journal-title":"ACM Trans Archit Code Optim (TACO)"},{"key":"2785_CR24","unstructured":"OpenMP Architecture Review Board. OpenMP Application Program Interface Version 4.5. 2015. \n                    https:\/\/www.openmp.org\/wp-content\/uploads\/openmp-4.5.pdf\n                    \n                  . Accessed 15 Apr 2019."}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-019-2785-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s12859-019-2785-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-019-2785-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T23:06:48Z","timestamp":1587596808000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-019-2785-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,24]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["2785"],"URL":"https:\/\/doi.org\/10.1186\/s12859-019-2785-6","relation":{},"ISSN":["1471-2105"],"issn-type":[{"type":"electronic","value":"1471-2105"}],"subject":[],"published":{"date-parts":[[2019,4,24]]},"assertion":[{"value":"25 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Not applicable.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publisher\u2019s Note"}}],"article-number":"208"}}