{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:42Z","timestamp":1750306962766,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,22]],"date-time":"2013-09-22T00:00:00Z","timestamp":1379808000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,9,22]]},"DOI":"10.1145\/2506583.2506638","type":"proceedings-article","created":{"date-parts":[[2013,10,29]],"date-time":"2013-10-29T14:11:56Z","timestamp":1383055916000},"page":"575-584","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The Forward Stem Matrix"],"prefix":"10.1145","author":[{"given":"Richard","family":"Beal","sequence":"first","affiliation":[{"name":"West Virginia University, Morgantown, WV 26506"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donald","family":"Adjeroh","sequence":"additional","affiliation":[{"name":"West Virginia University, Morgantown, WV 26506"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Abbasi","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA 22903"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,9,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Mukherjee","author":"Adjeroh D.","year":"2008","unstructured":"Adjeroh , D. , Bell , T. , Mukherjee , A. : The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching. Springer , New York ( 2008 ) Adjeroh, D., Bell, T., Mukherjee, A.: The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching. Springer, New York (2008)"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0003"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1521-3773(19990816)38:16<2326::AID-ANIE2326>3.0.CO;2-3"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35926-2_22"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.02.004"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2012.05.004"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2174\/157489308783329823"},{"key":"e_1_3_2_1_8_1","volume-title":"Stein","author":"Cormen T.","year":"2002","unstructured":"Cormen , T. , Leiserson , C. , Rivest , R. , Stein , C. : Introduction to Algorithms. McGraw-Hill , Boston ( 2002 ) Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. McGraw-Hill, Boston (2002)"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.10.006"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2008.36"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2011.02.002"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.12.005"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkg006"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"Gusfield D.","year":"1997","unstructured":"Gusfield , D. : Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology . Cambridge University Press , Cambridge, UK ( 1997 ) Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge, UK (1997)"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2007.0214"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00073-0"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbi.2011.03.015"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.12.015"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-12-214"},{"volume-title":"Sanbonmatsu","author":"Novikova I.","key":"e_1_3_2_1_21_1","unstructured":"Novikova , I. , Hennelly , S. , Tung , C. , Sanbonmatsu , K. : Rise of the RNA machines: Exploring the structure of long non-coding RNAs. Journal of Molecular Biology. (In Press) Novikova, I., Hennelly, S., Tung, C., Sanbonmatsu, K.: Rise of the RNA machines: Exploring the structure of long non-coding RNAs. Journal of Molecular Biology. (In Press)"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.0020033"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/aima.1993.1039"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0803169105"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btr090"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-biochem-051410-092902"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/jmbi.1998.2436"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1067-9"},{"key":"e_1_3_2_1_29_1","unstructured":"Smyth W.: Computing Patterns in Strings. Pearson New York (2003)  Smyth W.: Computing Patterns in Strings. Pearson New York (2003)"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.09.029"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00018-005-5558-5"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-60761-811-9_19"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSPEC.2010.5583460"}],"event":{"name":"BCB'13: ACM-BCB2013","sponsor":["SIGBio ACM Special Interest Group on Bioinformatics"],"location":"Wshington DC USA","acronym":"BCB'13"},"container-title":["Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2506583.2506638","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2506583.2506638","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:15Z","timestamp":1750235955000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2506583.2506638"}},"subtitle":["An Efficient Data Structure for Finding Hairpins in RNA Secondary Structures"],"short-title":[],"issued":{"date-parts":[[2013,9,22]]},"references-count":33,"alternative-id":["10.1145\/2506583.2506638","10.1145\/2506583"],"URL":"https:\/\/doi.org\/10.1145\/2506583.2506638","relation":{},"subject":[],"published":{"date-parts":[[2013,9,22]]},"assertion":[{"value":"2013-09-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}