{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:44:48Z","timestamp":1725464688549},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642308499"},{"type":"electronic","value":"9783642308505"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30850-5_4","type":"book-chapter","created":{"date-parts":[[2012,5,27]],"date-time":"2012-05-27T21:44:33Z","timestamp":1338155073000},"page":"27-38","source":"Crossref","is-referenced-by-count":1,"title":["Space Efficient Modifications to Structator\u2014 A Fast Index-Based Search Tool for RNA Sequence-Structure Patterns"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Albrecht","sequence":"first","affiliation":[]},{"given":"Volker","family":"Heun","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"M.I. Abouelhoda","year":"2004","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithm\u00a02, 53\u201386 (2004)","journal-title":"J. Discrete Algorithm"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1186\/1471-2105-7-389","volume":"7","author":"M. Beckstette","year":"2006","unstructured":"Beckstette, M., Homann, R., Giegerich, R., Kurtz, S.: Fast index based algorithms and software for matching position specific scoring matrices. BMC Bioinformatics\u00a07, 389 (2006)","journal-title":"BMC Bioinformatics"},{"issue":"22","key":"4_CR3","doi-asserted-by":"publisher","first-page":"2451","DOI":"10.1016\/j.tcs.2011.01.036","volume":"412","author":"J. Fischer","year":"2011","unstructured":"Fischer, J.: Combined Data Structure for Previous- and Next-Smaller-Values. Theor. Comput. Sci.\u00a0412(22), 2451\u20132456 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1137\/090779759","volume":"40","author":"J. Fischer","year":"2011","unstructured":"Fischer, J., Heun, V.: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays. SIAM J. Comput.\u00a040(2), 465\u2013492 (2011)","journal-title":"SIAM J. Comput."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"2433","DOI":"10.1093\/nar\/gki541","volume":"33","author":"P.P. Gardner","year":"2005","unstructured":"Gardner, P.P., Wilm, A., Washietl, S.: A benchmark of multiple sequence alignment programs upon structural RNAs. Nucleic Acids Res.\u00a033, 2433\u20132439 (2005)","journal-title":"Nucleic Acids Res."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Gardner, P.P., Daub, J., Tate, J., Moore, B.L., Osuch, I.H., Griffiths-Jones, S., Finn, R.D., Nawrocki, E.P., Kolbe, D.L., Eddy, S.R., Bateman, A.: Rfam: Wikipedia, clans and the \u201ddecimal\u201d release. Nucleic Acids Res.\u00a039, D141\u2013D145 (2011)","DOI":"10.1093\/nar\/gkq1129"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1007\/3-540-45061-0_73","volume-title":"Automata, Languages and Programming","author":"J. K\u00e4rkk\u00e4inen","year":"2003","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P.: Simple Linear Work Suffix Array Construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 943\u2013955. Springer, Heidelberg (2003)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Combinatorial Pattern Matching","author":"T. Kasai","year":"2001","unstructured":"Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 181\u2013192. Springer, Heidelberg (2001)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-44888-8_14","volume-title":"Combinatorial Pattern Matching","author":"D.-K. Kim","year":"2003","unstructured":"Kim, D.-K., Sim, J.S., Park, H.-J., Park, K.: Linear-Time Construction of Suffix Arrays. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 186\u2013199. Springer, Heidelberg (2003)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-44888-8_15","volume-title":"Combinatorial Pattern Matching","author":"P. Ko","year":"2003","unstructured":"Ko, P., Aluru, S.: Space Efficient Linear Time Construction of Suffix Arrays. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 200\u2013210. Springer, Heidelberg (2003)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1038\/nrg1321","volume":"5","author":"J.S. Mattick","year":"2004","unstructured":"Mattick, J.S.: RNA regulation: a new genetics? Nat. Rev. Genet.\u00a05, 316\u2013323 (2004)","journal-title":"Nat. Rev. Genet."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tig.2009.11.002","volume":"26","author":"J.S. Mattick","year":"2010","unstructured":"Mattick, J.S., Taft, R.J., Faulkner, G.J.: A global view of genomic information-moving beyond the gene and the master regulator. Trends Genet.\u00a026, 21\u201328 (2010)","journal-title":"Trends Genet."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1186\/1471-2105-12-214","volume":"12","author":"F. Meyer","year":"2011","unstructured":"Meyer, F., Kurtz, S., Backofen, R., Will, S., Beckstette, M.: Structator: fast index-based search for RNA sequence-structure patterns. BMC Bioinformatics\u00a012, 214 (2011)","journal-title":"BMC Bioinformatics"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Myers","year":"1993","unstructured":"Myers, U., Manber, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput.\u00a022, 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"issue":"1-2","key":"4_CR15","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.tcs.2007.09.029","volume":"389","author":"D. Strothmann","year":"2007","unstructured":"Strothmann, D.: The affix array data structure and its applications to RNA secondary structure analysis. Theor. Comput. Sci.\u00a0389(1-2), 278\u2013294 (2007)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30850-5_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:31:43Z","timestamp":1620113503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30850-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308499","9783642308505"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30850-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}