{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:56:58Z","timestamp":1725749818996},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642410154"},{"type":"electronic","value":"9783642410161"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41016-1_2","type":"book-chapter","created":{"date-parts":[[2013,9,24]],"date-time":"2013-09-24T22:03:49Z","timestamp":1380060229000},"page":"11-19","source":"Crossref","is-referenced-by-count":0,"title":["Identification of All Exact and Approximate Inverted Repeats in Regular and Weighted Sequences"],"prefix":"10.1007","author":[{"given":"Carl","family":"Barton","sequence":"first","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Mulder","sequence":"additional","affiliation":[]},{"given":"Bruce","family":"Watson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0166-218X(00)00186-4","volume":"104","author":"T. Akutsu","year":"2000","unstructured":"Akutsu, T.: Dynamic programming algorithms for rna secondary structure prediction with pseudoknots. Discrete Applied Mathematics\u00a0104, 45\u201362 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR2","unstructured":"Brown, M., Wilson, C.: Rna pseudoknot modeling using intersections of stochastic context free grammars with applications to database search. In: Pacific Symposium on Biocomputing, pp. 109\u2013125 (1995)"},{"key":"2_CR3","unstructured":"Barton, S.P.P.C., Iliopoulos, C.S., Smyth, W.F.: Prefix tables & border arrays with k-mismatches & applications (2013) (submitted for publication)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Chen, J.-L., Greider, C.W.: Functional analysis of the pseudoknot structure in human telomerase rna. Proceedings of the National Academy of Sciences of the United States of America 102(23), 8080\u20138085 (2005)","DOI":"10.1073\/pnas.0502259102"},{"issue":"5","key":"2_CR5","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M. Crochemore","year":"1981","unstructured":"Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Information Processing Letters\u00a012(5), 244\u2013250 (1981)","journal-title":"Information Processing Letters"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-22300-6_32","volume-title":"Algorithms and Data Structures","author":"J. Fischer","year":"2011","unstructured":"Fischer, J.: Inducing the lcp-array. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol.\u00a06844, pp. 374\u2013385. Springer, Heidelberg (2011)"},{"key":"2_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences: computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, New York (1997)"},{"issue":"4","key":"2_CR8","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.jcss.2004.03.004","volume":"69","author":"D. Gusfield","year":"2004","unstructured":"Gusfield, D., Stoye, J.: Linear time algorithms for finding and representing all the tandem repeats in a string. Journal of Computer and System Sciences\u00a069(4), 525\u2013546 (2004)","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1007\/978-3-642-10631-6_109","volume-title":"Algorithms and Computation","author":"P.-H. Hsu","year":"2009","unstructured":"Hsu, P.-H., Chen, K.-Y., Chao, K.-M.: Finding all approximate gapped palindromes. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 1084\u20131093. Springer, Heidelberg (2009)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Ilie, L., Navarro, G., Tinta, L.: The longest common extension problem revisited and applications to approximate string searching (2010)","DOI":"10.1016\/j.jda.2010.08.004"},{"issue":"2,3","key":"2_CR11","first-page":"259","volume":"71","author":"C.S. Iliopoulos","year":"2006","unstructured":"Iliopoulos, C.S., Makris, C., Panagis, Y., Perdikuri, K.: Evangelos Theodoridis, and Athanasios Tsakalidis. The weighted suffix tree: An efficient data structure for handling molecular weighted sequences and its applications. Fundam. Inf.\u00a071(2,3), 259\u2013277 (2006)","journal-title":"Fundam. Inf."},{"issue":"suppl. 6","key":"2_CR12","first-page":"1","volume":"11","author":"C. Kandoth","year":"2010","unstructured":"Kandoth, C., Ercal, F., Frank, R.: A framework for automated enrichment of functionally significant inverted repeats in whole genomes. BMC Bioinformatics\u00a011(suppl. 6), 1\u201310 (2010)","journal-title":"BMC Bioinformatics"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Kato, Y., Seki, H., Kasami, T.: Stochastic multiple context-free grammar for rna pseudoknot modeling. In: Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms, TAGRF 2006, Stroudsburg, PA, USA, pp. 57\u201364. Association for Computational Linguistics (2006)","DOI":"10.3115\/1654690.1654698"},{"key":"2_CR14","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proceedings of the 1999 Symposium on Foundations of Computer Science, pp. 596\u2013604. IEEE Computer Society (1999)"},{"issue":"3-4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1089\/106652700750050862","volume":"7","author":"R.B. Lyngso","year":"2000","unstructured":"Lyngso, R.B., Pedersen, C.N.S.: RNA Pseudoknot Prediction in Energy-Based Models. Journal of Computational Biology\u00a07(3-4), 409\u2013427 (2000)","journal-title":"Journal of Computational Biology"},{"issue":"3","key":"2_CR16","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","volume":"5","author":"M.G. Main","year":"1984","unstructured":"Main, M.G., Lorentz, R.J.: An o(n log n) algorithm for finding all repetitions in a string. Journal of Algorithms\u00a05(3), 422\u2013432 (1984)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"2_CR17","doi-asserted-by":"publisher","first-page":"346351","DOI":"10.1145\/321892.321896","volume":"22","author":"G. Manacher","year":"1975","unstructured":"Manacher, G.: A new linear-time \u201con-line\u201d algorithm for finding the smallest initial palindrome of a string. J. ACM\u00a022(3), 346351 (1975)","journal-title":"J. ACM"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Nong, G., Zhang, S., Chan, W.H.: Linear Suffix Array Construction by Almost Pure Induced-Sorting. In: Data Compression Conference, pp. 193\u2013202 (2009)","DOI":"10.1109\/DCC.2009.42"},{"issue":"5","key":"2_CR19","doi-asserted-by":"publisher","first-page":"1717","DOI":"10.1093\/nar\/13.5.1717","volume":"13","author":"C.W.A. Pleij","year":"1985","unstructured":"Pleij, C.W.A., Rietveld, K., Bosch, L.: A new principle of rna folding based on pseudoknotting. Nucleic. Acids Research\u00a013(5), 1717\u20131731 (1985) C.W.A. Pleij, K. Rietveld, L. Bosch","journal-title":"Nucleic. Acids Research"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Porto, A.H.L., Barbosa, V.C.: Finding approximate palindromes in strings (2002)","DOI":"10.1016\/S0031-3203(01)00179-0"},{"issue":"12","key":"2_CR21","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1016\/S0304-3975(01)00121-9","volume":"270","author":"J. Stoye","year":"2002","unstructured":"Stoye, J., Gusfield, D.: Simple and exible detection of contiguous repeats using a suffix tree. Theoretical Computer Science\u00a0270(12), 843\u2013856 (2002)","journal-title":"Theoretical Computer Science"}],"container-title":["Communications in Computer and Information Science","Engineering Applications of Neural Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41016-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T11:00:06Z","timestamp":1558090806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41016-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642410154","9783642410161"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41016-1_2","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2013]]}}}