{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:53:26Z","timestamp":1740135206392,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1186\/s12859-018-2008-6","type":"journal-article","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T07:36:49Z","timestamp":1516001809000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Tuning iteration space slicing based tiled multi-core code implementing Nussinov\u2019s RNA folding"],"prefix":"10.1186","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5932-4523","authenticated-orcid":false,"given":"Marek","family":"Palkowski","sequence":"first","affiliation":[]},{"given":"Wlodzimierz","family":"Bielecki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,15]]},"reference":[{"issue":"1","key":"2008_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":"2008_CR2","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 (IMPACT\u201914). Vienna:2014. http:\/\/impact.gforge.inria.fr\/impact2014\/papers\/impact2014-mullapudi.pdf ."},{"key":"2008_CR3","unstructured":"Iooss G, Rajopadhye S, Alias C, Zou Y. Mono-parametric Tiling is a Polyhedral Transformation. [Research Report] RR-8802, INRIA Grenoble - Rh\u00f4ne-Alpes; CNRS;2015. p. 40. https:\/\/hal.inria.fr\/hal-01219452\/document ."},{"issue":"1","key":"2008_CR4","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. https:\/\/doi.org\/10.1186\/s12859-017-1707-8 .","journal-title":"BMC Bioinformatics"},{"key":"2008_CR5","volume-title":"LCPC. Lecture Notes in Computer Science, vol. 1863","author":"W Pugh","year":"1999","unstructured":"Pugh W, Rosser E. Iteration space slicing for locality In: Gao GR, Pollock LL, Cavazos J, Xiaoming L, editors. LCPC. Lecture Notes in Computer Science, vol. 1863. La Jolla: Springer;1999. p. 164\u201384."},{"issue":"6","key":"2008_CR6","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. https:\/\/doi.org\/10.1145\/1379022.1375595 .","journal-title":"SIGPLAN Not"},{"key":"2008_CR7","unstructured":"Griebl M. Automatic Parallelization of Loop Programs for Distributed Memory Architectures: University of Passau; 2004. Habilitation thesis."},{"key":"2008_CR8","volume-title":"The Springer International Series in Engineering and Computer Science, vol. 575","author":"J Xue","year":"2000","unstructured":"Xue J. Loop Tiling for Parallelism. In: The Springer International Series in Engineering and Computer Science, vol. 575. US: Springer;2000. https:\/\/books.google.pl\/books?id=DPJNwR2SBF0C ."},{"key":"2008_CR9","doi-asserted-by":"crossref","unstructured":"Hartono A, et al. PrimeTile: A Parametric Multi-Level Tiler for Imperfect Loop Nests. In: ACM International Conference on Supercomputing (ICS). New York:2009.","DOI":"10.1145\/1542275.1542301"},{"key":"2008_CR10","doi-asserted-by":"publisher","unstructured":"Hartono A, Baskaran MM, Ramanujam J, Sadayappan P. Dyntile: Parametric tiled loop generation for parallel execution on multicore processors. In: 2010 IEEE International Symposium on Parallel Distributed Processing (IPDPS): 2010. p. 1\u201312. https:\/\/doi.org\/10.1109\/IPDPS.2010.5470459 .","DOI":"10.1109\/IPDPS.2010.5470459"},{"key":"2008_CR11","volume-title":"Proceedings of the 8th Annual IEEE\/ACM International Symposium on Code Generation and Optimization, CGO \u201910","author":"MM Baskaran","year":"2010","unstructured":"Baskaran MM, Hartono A, Tavarageri S, Henretty T, Ramanujam J, Sadayappan P. Parameterized tiling revisited. In: Proceedings of the 8th Annual IEEE\/ACM International Symposium on Code Generation and Optimization, CGO \u201910. New York: ACM;2010. p. 200\u20139."},{"key":"2008_CR12","unstructured":"Wonnacott D, Jin T, Lake A. Automatic tiling of \u201cmostly-tileable\u201d loop nests. In: IMPACT 2015: 5th International Workshop on Polyhedral Compilation Techniques. Amsterdam:2015. http:\/\/impact.gforge.inria.fr\/impact2015\/papers\/impact2015-wonnacott.pdf ."},{"volume-title":"An exact method for analysis of value-based array data dependences","year":"1994","key":"2008_CR13","unstructured":"Pugh W, Wonnacott D. In: Banerjee U, Gelernter D, Nicolau A, Padua D, (eds).An exact method for analysis of value-based array data dependences. Berlin, Heidelberg: Springer; 1994. p. 546\u201366."},{"issue":"4","key":"2008_CR14","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1515\/amcs-2016-0065","volume":"26","author":"W Bielecki","year":"2016","unstructured":"Bielecki W, Palkowski M. Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs. Int J Appl Math Comput Sci (AMCS). 2016; 26(4):919\u201339.","journal-title":"Int J Appl Math Comput Sci (AMCS)"},{"issue":"2","key":"2008_CR15","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10878-014-9740-2","volume":"30","author":"W Bielecki","year":"2015","unstructured":"Bielecki W, Kraska K, Klimek T. Using basis dependence distance vectors in the modified floyd\u2013warshall algorithm. J Comb Optim. 2015; 30(2):253\u201375.","journal-title":"J Comb Optim"},{"issue":"4","key":"2008_CR16","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/2743016","volume":"37","author":"T Grosser","year":"2015","unstructured":"Grosser T, Verdoolaege S, Cohen A. Polyhedral ast generation is more than scanning polyhedra. ACM Trans Program Lang Syst. 2015; 37(4):12\u201311250.","journal-title":"ACM Trans Program Lang Syst"},{"key":"2008_CR17","doi-asserted-by":"publisher","DOI":"10.1145\/1772954.1772982","volume-title":"Proceedings of the 8th Annual IEEE\/ACM International Symposium on Code Generation and Optimization, CGO \u201910","author":"T Yuki","year":"2010","unstructured":"Yuki T, Renganarayanan L, Rajopadhye S, Anderson C, Eichenberger AE, O\u2019Brien K. Automatic creation of tile size selection models. In: Proceedings of the 8th Annual IEEE\/ACM International Symposium on Code Generation and Optimization, CGO \u201910. New York: ACM;2010. p. 190\u20139. https:\/\/doi.org\/10.1145\/1772954.1772982 ."},{"issue":"6","key":"2008_CR18","first-page":"1277","volume":"35","author":"M Palkowski","year":"2016","unstructured":"Palkowski M, Bielecki W. TRACO: source-to-source parallelizing compiler. Comput Inform. 2016; 35(6):1277\u2013306.","journal-title":"Comput Inform"},{"key":"2008_CR19","unstructured":"Verdoolaege S. Counting affine calculator and applications. In: First International Workshop on Polyhedral Compilation Techniques (IMPACT\u201911). Charmonix: 2011. http:\/\/perso.ens-lyon.fr\/christophe.alias\/impact2011\/impact-05.pdf ."},{"key":"2008_CR20","unstructured":"OpenMP Architecture Review Board. OpenMP Application Program Interface Version 4.5. 2015. http:\/\/www.openmp.org\/wp-content\/uploads\/openmp-4.5.pdf . Accessed 10 Jan 2018."},{"key":"2008_CR21","doi-asserted-by":"publisher","unstructured":"Chang DJ, Kimmer C, Ouyang M. Accelerating the Nussinov RNA folding algorithm with CUDA\/GPU. In: The 10th IEEE International Symposium on Signal Processing and Information Technology: 2010. p. 120\u20135. https:\/\/doi.org\/10.1109\/ISSPIT.2010.5711746 .","DOI":"10.1109\/ISSPIT.2010.5711746"},{"issue":"8","key":"2008_CR22","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. https:\/\/doi.org\/10.1186\/1471-2105-15-S8-S1 .","journal-title":"BMC Bioinformatics"},{"issue":"1","key":"2008_CR23","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1093\/nar\/9.1.133","volume":"9","author":"M Zuker","year":"1981","unstructured":"Zuker M, Stiegler P. Optimal computer folding of large rna sequences using thermodynamics and auxiliary information. Nucleic Acids Res. 1981; 9(1):133\u201348.","journal-title":"Nucleic Acids Res"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-018-2008-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T06:43:20Z","timestamp":1570603400000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-018-2008-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,15]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["2008"],"URL":"https:\/\/doi.org\/10.1186\/s12859-018-2008-6","relation":{},"ISSN":["1471-2105"],"issn-type":[{"type":"electronic","value":"1471-2105"}],"subject":[],"published":{"date-parts":[[2018,1,15]]},"assertion":[{"value":"1 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2018","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":"12"}}