{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:36:45Z","timestamp":1725550605216},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297406"},{"type":"electronic","value":"9783540322412"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11575832_21","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T14:12:50Z","timestamp":1129212770000},"page":"191-201","source":"Crossref","is-referenced-by-count":3,"title":["Linear Time Algorithm for the Generalised Longest Common Repeat Problem"],"prefix":"10.1007","author":[{"given":"Inbok","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoan Jos\u00e9 Pinz\u00f3n","family":"Ardila","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/3-540-45784-4_35","volume-title":"Algorithms in Bioinformatics","author":"M.I. Abouelhoda","year":"2002","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: The enhanced suffix array and its application to genome analysis. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 449\u2013463. Springer, Heidelberg (2002)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Proceedings of the Fourth Latin American Symposium, pp. 88\u201394 (2000)","DOI":"10.1007\/10719839_9"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1038\/nbt1090-930","volume":"8","author":"J. Beckman","year":"1990","unstructured":"Beckman, J., Soller, M.: Toward a unified approach to genetic mapping of eukaryotes based on sequence tagged microsatellite sites. Biotechnology\u00a08, 930\u2013932 (1990)","journal-title":"Biotechnology"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.1126\/science.1546326","volume":"255","author":"C.T. Caskey","year":"1992","unstructured":"Caskey, C.T., et al.: An unstable triplet repeat in a gene related to Myotonic Dystrophy. Science\u00a0255, 1256\u20131258 (1992)","journal-title":"Science"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11496656_15","volume-title":"Combinatorial Pattern Matching","author":"S. Dori","year":"2005","unstructured":"Dori, S., Landau, G.M.: Construction of aho-corasick automaton in linear time for integer alphabets. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 168\u2013177. Springer, Heidelberg (2005)"},{"issue":"6","key":"21_CR6","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1145\/355541.355547","volume":"47","author":"M. Farach-Colton","year":"2000","unstructured":"Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. Journal of the ACM\u00a047(6), 987\u20131011 (2000)","journal-title":"Journal of the ACM"},{"key":"21_CR7","volume-title":"An introduction to forensic DNA analysis","author":"K. Inman","year":"1997","unstructured":"Inman, K., Rudin, N.: An introduction to forensic DNA analysis. CRC press, Boca Raton (1997)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Jeffreys, A., Monckton, D., Tamaki, K., Neil, D., Armour, J., MacLeod, A., Collick, A., Allen, M., Jobling, M.: Minisatellite variant repeat mapping: application to DNA typing and mutation analysis. In: DNA Fingerprinting: State of the Science, Basel, pp. 125\u2013139 (1993)","DOI":"10.1007\/978-3-0348-8583-6_12"},{"key":"21_CR9","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.: Simpler 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\u2013945. Springer, Heidelberg (2003)"},{"key":"21_CR10","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":"21_CR11","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., 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)"},{"issue":"3","key":"21_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.ipl.2004.03.017","volume":"91","author":"S.-R. Kim","year":"2004","unstructured":"Kim, S.-R., Lee, I., Park, K.: A fast algorithm for the generalised k-keyword proximity problem given keyword offsets. Information Processing Letters\u00a091(3), 115\u2013120 (2004)","journal-title":"Information Processing Letters"},{"key":"21_CR13","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":"21_CR14","doi-asserted-by":"crossref","unstructured":"Landau, G.M., Schmidt, J.P.: An algorithm for approximate tandem repeats. In: Proceedings of the Fourth Combinatorial Pattern Matching, pp. 120\u2013133 (1993)","DOI":"10.1007\/BFb0029801"},{"issue":"1","key":"21_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/106652701300099038","volume":"8","author":"G.M. Landau","year":"2001","unstructured":"Landau, G.M., Schmidt, J.P., Sokol, D.: An algorithm for approximate tandem repeats. Journal of Computational Biology\u00a08(1), 1\u201318 (2001)","journal-title":"Journal of Computational Biology"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-540-30213-1_2","volume-title":"String Processing and Information Retrieval","author":"I. Lee","year":"2004","unstructured":"Lee, I., Iliopoulos, C.S., Park, K.: Linear time algorithm for the longest common repeat problem. In: Apostolico, A., Melucci, M. (eds.) SPIRE 2004. LNCS, vol.\u00a03246, pp. 10\u201317. Springer, Heidelberg (2004)"},{"issue":"2","key":"21_CR17","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. Journal of the ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"issue":"4","key":"21_CR18","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1137\/S0097539795288489","volume":"27","author":"J.P. Schmidt","year":"1998","unstructured":"Schmidt, J.P.: All highest scoring paths in weighted grid graphs and its application to finding all approximate repeats in strings. SIAM Journal on Computing\u00a027(4), 972\u2013992 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"5364","key":"21_CR19","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1126\/science.280.5364.696","volume":"280","author":"R.H. Singer","year":"1998","unstructured":"Singer, R.H.: Triplet-repeat transcripts: A role for RNA in disease. Science\u00a0280(5364), 696\u2013697 (1998)","journal-title":"Science"},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica\u00a014, 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Woo, K.J., Sang-Ho, K., Jae-Kwan, C.: Association of the dopamine transporter gene with Parkinson\u2019s disease in Korean patients. Journal of Korean Medical Science\u00a015(4) (2000)","DOI":"10.3346\/jkms.2000.15.4.449"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11575832_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:58:01Z","timestamp":1605643081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575832_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297406","9783540322412"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11575832_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}