{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:43:58Z","timestamp":1743151438898,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181196"},{"type":"electronic","value":"9783319181202"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18120-2_19","type":"book-chapter","created":{"date-parts":[[2015,4,8]],"date-time":"2015-04-08T08:08:06Z","timestamp":1428480486000},"page":"316-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On Longest Repeat Queries Using GPU"],"prefix":"10.1007","author":[{"given":"Yun","family":"Tian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bojian","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,9]]},"reference":[{"issue":"14","key":"19_CR1","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1093\/bioinformatics\/btp321","volume":"25","author":"V Becher","year":"2009","unstructured":"Becher, V., Deymonnaz, A., Heiber, P.A.: Efficient computation of all perfect repeats in genomic sequences of up to half a gigabyte, with a case study on the human genome. Bioinformatics 25(14), 1746\u20131753 (2009)","journal-title":"Bioinformatics"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/11496656_17","volume-title":"Combinatorial Pattern Matching","author":"B Behzadi","year":"2005","unstructured":"Behzadi, B., Le Fessant, F.: DNA compression challenge revisited: a dynamic programming approach. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 190\u2013200. Springer, Heidelberg (2005)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-34109-0_11","volume-title":"String Processing and Information Retrieval","author":"T Beller","year":"2012","unstructured":"Beller, T., Berger, K., Ohlebusch, E.: Space-efficient computation of maximal and supermaximal repeats in genome sequences. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol. 7608, pp. 99\u2013110. Springer, Heidelberg (2012)"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1093\/nar\/27.2.573","volume":"27","author":"G Benson","year":"1999","unstructured":"Benson, G.: Tandem repeats finder: a program to analyze dna sequences. Nucleic Acids Research 27(2), 573\u2013580 (1999)","journal-title":"Nucleic Acids Research"},{"key":"19_CR5","unstructured":"Blelloch, G.E.: Prefix sums and their applications. Technical Report CMU-CS-90-190, Carnegie Mellon University (1990)"},{"issue":"10","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1370","DOI":"10.1016\/j.jpdc.2008.05.014","volume":"68","author":"S Che","year":"2008","unstructured":"Che, S., Boyer, M., Meng, J., Tarjan, D., Sheaffer, J., Skadron, K.: A performance study of general-purpose applications on graphics processors using cuda. Journal of Parallel and Distributed Computing 68(10), 1370\u20131380 (2008)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Deo, M., Keely, S.: Parallel suffix array and least common prefix for the gpu. In: Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), pp. 197\u2013206 (2013)","DOI":"10.1145\/2442516.2442536"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"key":"19_CR9","unstructured":"\u0130leri, A.M., K\u00fclekci, M.O., Xu, B.: On longest repeat queries. http:\/\/arxiv.org\/abs\/1501.06259"},{"key":"19_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.H., 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. 2089, pp. 181\u2013192. Springer, Heidelberg (2001)"},{"issue":"2\u20134","key":"19_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.jda.2004.08.002","volume":"3","author":"P Ko","year":"2005","unstructured":"Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. Journal of Discrete Algorithms 3(2\u20134), 143\u2013156 (2005)","journal-title":"Journal of Discrete Algorithms"},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1109\/TCBB.2011.127","volume":"9","author":"MO Kulekci","year":"2012","unstructured":"Kulekci, M.O., Vitter, J.S., Xu, B.: Efficient maximal repeat finding using the burrows-wheeler transform and wavelet tree. IEEE Transactions on Computational Biology and Bioinformatics (TCBB) 9(2), 421\u2013429 (2012)","journal-title":"IEEE Transactions on Computational Biology and Bioinformatics (TCBB)"},{"issue":"5","key":"19_CR13","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1093\/bioinformatics\/15.5.426","volume":"15","author":"S Kurtz","year":"1999","unstructured":"Kurtz, S., Schleiermacher, C.: Reputer: fast computation of maximal repeats in complete genomes. Bioinformatics 15(5), 426\u2013427 (1999)","journal-title":"Bioinformatics"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/1748-7188-1-2","volume":"1","author":"X Liu","year":"2006","unstructured":"Liu, X., Wang, L.: Finding the region of pseudo-periodic tandem repeats in biological sequences. Algorithms for Molecular Biology 1(1), 2 (2006)","journal-title":"Algorithms for Molecular Biology"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"1397","DOI":"10.1002\/spe.619","volume":"34","author":"G Manzini","year":"2004","unstructured":"Manzini, G., Rastero, M.: A simple and fast dna compressor. Software-Practice and Experience 34, 1397\u20131411 (2004)","journal-title":"Software-Practice and Experience"},{"issue":"13","key":"19_CR16","doi-asserted-by":"publisher","first-page":"4629","DOI":"10.1093\/nar\/11.13.4629","volume":"11","author":"HM Martinez","year":"1983","unstructured":"Martinez, H.M.: An efficient method for finding repeats in molecular sequences. Nucleic Acids Research 11(13), 4629\u20134634 (1983)","journal-title":"Nucleic Acids Research"},{"key":"19_CR17","volume-title":"Human Genetics: The Molecular Revolution","author":"EH McConkey","year":"1993","unstructured":"McConkey, E.H.: Human Genetics: The Molecular Revolution. Jones and Bartlett, Boston (1993)"},{"issue":"2","key":"19_CR18","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/MM.2010.41","volume":"30","author":"J Nickolls","year":"2010","unstructured":"Nickolls, J., Dally, W.J.: The gpu computing era. IEEE Micro 30(2), 56\u201369 (2010)","journal-title":"IEEE Micro"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-642-34109-0_40","volume-title":"String Processing and Information Retrieval","author":"V Osipov","year":"2012","unstructured":"Osipov, V.: Parallel suffix array construction for shared memory architectures. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol. 7608, pp. 379\u2013384. Springer, Heidelberg (2012)"},{"issue":"1","key":"19_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s12042-007-9007-5","volume":"1","author":"S Saha","year":"2008","unstructured":"Saha, S., Bridges, S., Magbanua, Z.V., Peterson, D.G.: Computational approaches and tools used in identification of dispersed repetitive dna sequences. Tropical Plant Biology 1(1), 85\u201396 (2008)","journal-title":"Tropical Plant Biology"},{"issue":"7","key":"19_CR21","doi-asserted-by":"publisher","first-page":"2284","DOI":"10.1093\/nar\/gkn064","volume":"36","author":"S Saha","year":"2008","unstructured":"Saha, S., Bridges, S., Magbanua, Z.V., Peterson, D.G.: Empirical comparison of ab initio repeat finding programs. Nucleic Acids Research 36(7), 2284\u20132294 (2008)","journal-title":"Nucleic Acids Research"},{"issue":"1","key":"19_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ejc.2012.07.010","volume":"34","author":"WF Smyth","year":"2013","unstructured":"Smyth, W.F.: Computing regularities in strings: A survey. European Journal of Combinatorics 34(1), 3\u201314 (2013)","journal-title":"European Journal of Combinatorics"},{"key":"19_CR23","unstructured":"Tian, Y., Xu, B.: On longest repeat queries using gpu. http:\/\/arxiv.org\/abs\/1501.06663"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18120-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T23:34:16Z","timestamp":1676676856000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18120-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181196","9783319181202"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18120-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}