{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:09:15Z","timestamp":1725530955756},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642015502"},{"type":"electronic","value":"9783642015519"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01551-9_14","type":"book-chapter","created":{"date-parts":[[2009,4,28]],"date-time":"2009-04-28T10:29:20Z","timestamp":1240914560000},"page":"135-147","source":"Crossref","is-referenced-by-count":1,"title":["Improved Algorithms for Parsing ESLTAGs: A Grammatical Model Suitable for RNA Pseudoknots"],"prefix":"10.1007","author":[{"given":"Sanguthevar","family":"Rajasekaran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sahar","family":"Al Seesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reda","family":"Ammar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-88436-1_12","volume-title":"Pattern Recognition in Bioinformatics, PRIB 2008","author":"S. Al Seesi","year":"2008","unstructured":"Al Seesi, S., Rajasekaran, S., Ammar, R.: Pseudoknot identification through learning TAG RNA s. In: Chetty, M., Ngom, A., Ahmad, S. (eds.) PRIB 2008. LNCS (LNBI), vol.\u00a05265, pp. 132\u2013143. Springer, Heidelberg (2008)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Al Seesi, S., Rajasekaran, S., Ammar, R.: RNA pseudoknot folding through inference and identification using TAG RNA s. In: International Conference on Bioinformatics and Computational Biology, BiCob 2009 (2009) (to appear)","DOI":"10.1007\/978-3-642-00727-9_11"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1093\/nar\/28.1.201","volume":"28","author":"F.H.D. Batenburg van","year":"2000","unstructured":"van Batenburg, F.H.D., Gultyaev, A.P., Pleij, C.W.A., Ng, J., Oliehoek, J.: Pseudobase: a database with RNA pseudoknots. Nucl. Acids Res.\u00a028(1), 201\u2013204 (2000)","journal-title":"Nucl. Acids Res."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation\u00a09, 251\u2013280 (1990); Also in: Proc. 19th Annual ACM Symposium on Theory of Computing, pp. 1-6 (1987)","journal-title":"Journal of Symbolic Computation"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1093\/nar\/gki081","volume":"33","author":"S. Griffiths-Jones","year":"2005","unstructured":"Griffiths-Jones, S., Moxon, S., Marshall, M., Khanna, A., Eddy, S.R., Bateman, A.: Rfam: Annotating non-coding RNAs in complete genomes. Nucl. Acids Res.\u00a033, D121-D124 (2005)","journal-title":"Nucl. Acids Res."},{"key":"14_CR6","volume-title":"Proc. TAG+ Workshop","author":"Y. Guan","year":"1992","unstructured":"Guan, Y., Hotz, G.: An O(n 5) recognition algorithm for coupled parenthesis rewriting systems. In: Proc. TAG+ Workshop. University of Pennsylvania, Philadelphia (1992)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Harbusch, K.: An efficient parsing algorithm for tree adjoining grammars. In: Proc. 28th Meeting of the Association for Computational Linguistics, Pittsburgh, pp. 284\u2013291 (1990)","DOI":"10.3115\/981823.981859"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/S0022-0000(75)80019-5","volume":"10","author":"A.K. Joshi","year":"1975","unstructured":"Joshi, A.K., Levy, L.S., Takahashi, M.: Tree adjunct. grammars. Journal of Computer and System Sciences\u00a010(1), 136\u2013163 (1975)","journal-title":"Journal of Computer and System Sciences"},{"issue":"11","key":"14_CR9","doi-asserted-by":"publisher","first-page":"2611","DOI":"10.1093\/bioinformatics\/bti385","volume":"21","author":"H. Matsui","year":"2005","unstructured":"Matsui, H., Sato, K., Sakakibara, Y.: Pair stochastic tree adjoining grammars for aligning and predicting pseudoknot RNA structures. Bioinformatics\u00a021(11), 2611\u20132617 (2005)","journal-title":"Bioinformatics"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Nurkkala, T., Kumar, V.: A parallel parsing algorithm for natural language using tree adjoining grammar. In: Proc. 8th International Parallel Processing Symposium (1994)","DOI":"10.1109\/IPPS.1994.288210"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"5995","DOI":"10.1074\/jbc.M108972200","volume":"277","author":"J.C. Paillart","year":"2002","unstructured":"Paillart, J.C., Skripkin, E., Ehresmann, B., Ehresmann, C., Marquet, R.: In vitro evidence for a long range pseudoknot in the 5-untranslated and matrix coding regions of HIV-1 genomic RNA. J. Biol. Chem.\u00a0277, 5995\u20136004 (2002)","journal-title":"J. Biol. Chem."},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0219001","volume":"19","author":"M. Palis","year":"1990","unstructured":"Palis, M., Shende, S., Wei, D.S.L.: An optimal linear time parallel parser for tree adjoining languages. SIAM Journal on Computing\u00a019(1), 1\u201331 (1990)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR13","volume-title":"Studies in Linguistics and Philosophy","author":"B.H. Partee","year":"1990","unstructured":"Partee, B.H., Ter Meulen, A., Wall, R.E.: Studies in Linguistics and Philosophy, vol.\u00a030. Kluwer Academic Publishers, Dordrecht (1990)"},{"issue":"4","key":"14_CR14","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1137\/S009753979326009X","volume":"25","author":"S. Rajasekaran","year":"1996","unstructured":"Rajasekaran, S.: TAL parsing in o(n 6) time. SIAM Journal on Computing\u00a025(4), 862\u2013873 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"14_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1006\/jcss.1997.1537","volume":"56","author":"S. Rajasekaran","year":"1998","unstructured":"Rajasekaran, S., Yooseph, S.: TAL parsing in O(M(n 2)) time. Journal of Computer and System Sciences\u00a056(1), 83\u201389 (1998)","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"5112","DOI":"10.1093\/nar\/22.23.5112","volume":"22","author":"Y. Sakakibara","year":"1994","unstructured":"Sakakibara, Y., Brown, M., Hughey, R., Mian, I.S., Sjolander, K., Underwood, R.C., Haussler, D.: Stochastic context-free grammars for tRNA modeling. Nucl. Acids Res.\u00a022, 5112\u20135120 (1994)","journal-title":"Nucl. Acids Res."},{"key":"14_CR17","unstructured":"Satta, G.: Tree adjoining grammar parsing and Boolean matrix multiplication. In: Proc. 32nd Meeting of the Association for Computational Linguistics (1994)"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Schabes, Y., Joshi, A.K.: An Earley-type parsing algorithm for tree adjoining grammars. In: Proc. 26th Meeting of the Association for Computational Linguistics, pp. 258\u2013269 (1988)","DOI":"10.3115\/982023.982055"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0304-3975(98)00090-5","volume":"210","author":"Y. Uemura","year":"1999","unstructured":"Uemura, Y., Hasegawa, A., Kobayashi, S., Yokomori, T.: Tree adjoining grammars for RNA structure prediction. Theoretical Computer Science\u00a0210, 277\u2013303 (1999)","journal-title":"Theoretical Computer Science"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Vijayashanker, K., Joshi, A.K.: Some computational properties of tree adjoining grammars. In: Proc. 23rd Meeting of the Association for Computational Linguistics, pp. 82\u201393 (1985)","DOI":"10.3115\/981210.981221"},{"issue":"1","key":"14_CR21","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1093\/nar\/30.1.179","volume":"30","author":"K.P. Williams","year":"2002","unstructured":"Williams, K.P.: The tmRNA website: Invasion by an intron. Nucl. Acids Res.\u00a030(1), 179\u2013182 (2002)","journal-title":"Nucl. Acids Res."}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01551-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:44:30Z","timestamp":1558291470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01551-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642015502","9783642015519"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01551-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}