{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:04:02Z","timestamp":1725455042900},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642331213"},{"type":"electronic","value":"9783642331220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33122-0_35","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T06:43:09Z","timestamp":1346136189000},"page":"441-452","source":"Crossref","is-referenced-by-count":5,"title":["Distributed String Mining for High-Throughput Sequencing Data"],"prefix":"10.1007","author":[{"given":"Niko","family":"V\u00e4lim\u00e4ki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon J.","family":"Puglisi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"35_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 Algorithms\u00a02(1), 53\u201386 (2004)","journal-title":"J. Discrete Algorithms"},{"issue":"24","key":"35_CR2","doi-asserted-by":"publisher","first-page":"2628","DOI":"10.1093\/bioinformatics\/btl453","volume":"22","author":"F. Birzele","year":"2006","unstructured":"Birzele, F., Kramer, S.: A new representation for protein secondary structure prediction based on frequent patterns. Bioinformatics\u00a022(24), 2628\u20132634 (2006)","journal-title":"Bioinformatics"},{"doi-asserted-by":"crossref","unstructured":"Chan, S., Kao, B., Yip, C.L., Tang, M.: Mining emerging substrings. In: Proc. DASFAA, pp. 119\u2013126. IEEE (2003)","key":"35_CR3","DOI":"10.1109\/DASFAA.2003.1192375"},{"issue":"1","key":"35_CR4","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/0221005","volume":"21","author":"L. Devroye","year":"1992","unstructured":"Devroye, L., Szpankowski, W., Rais, B.: A note on the height of suffix trees. SIAM J. Comput.\u00a021(1), 48\u201353 (1992)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"35_CR5","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1109\/TKDE.2010.242","volume":"24","author":"J. Dhaliwal","year":"2012","unstructured":"Dhaliwal, J., Puglisi, S.J., Turpin, A.: Practical efficient string mining. IEEE Transactions on Knowledge and Data Engineering\u00a024(4), 735\u2013744 (2012)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"35_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/11871637_17","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"J. Fischer","year":"2006","unstructured":"Fischer, J., Heun, V., Kramer, S.: Optimal String Mining Under Frequency Constraints. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol.\u00a04213, pp. 139\u2013150. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Fischer, J., M\u00e4kinen, V., V\u00e4lim\u00e4ki, N.: Space-efficient string mining under frequency constraints. In: Proc. ICDM, pp. 193\u2013202. IEEE (2008)","key":"35_CR7","DOI":"10.1109\/ICDM.2008.32"},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-56024-6_19","volume-title":"Combinatorial Pattern Matching","author":"L.C.K. Hui","year":"1992","unstructured":"Hui, L.C.K.: Color Set Size Problem with Application to String Matching. In: Apostolico, A., Galil, Z., Manber, U., Crochemore, M. (eds.) CPM 1992. LNCS, vol.\u00a0644, pp. 230\u2013243. Springer, Heidelberg (1992)"},{"unstructured":"Amazon Inc. Amazon elastic compute cloud (Amazon EC2), \n                  \n                    http:\/\/aws.amazon.com\/ec2\/#pricing\n                  \n                  \n                 (accessed May 2012)","key":"35_CR9"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0097-3165(94)90065-5","volume":"66","author":"P. Jacquet","year":"1994","unstructured":"Jacquet, P., Szpankowski, W.: Autocorrelation on words and its applications - analysis of suffix trees. Journal of Combinatorial Theory A\u00a066, 237\u2013269 (1994)","journal-title":"Journal of Combinatorial Theory A"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-02441-2_17","volume-title":"Combinatorial Pattern Matching","author":"J. K\u00e4rkk\u00e4inen","year":"2009","unstructured":"K\u00e4rkk\u00e4inen, J., Manzini, G., Puglisi, S.J.: Permuted Longest-Common-Prefix Array. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol.\u00a05577, pp. 181\u2013192. Springer, Heidelberg (2009)"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J. K\u00e4rkk\u00e4inen","year":"2006","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. Journal of the ACM\u00a053, 918\u2013936 (2006)","journal-title":"Journal of the ACM"},{"key":"35_CR13","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":"35_CR14","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s10618-008-0110-5","volume":"17","author":"A. K\u00fcgel","year":"2008","unstructured":"K\u00fcgel, A., Ohlebusch, E.: A space efficient solution to the frequent string mining problem for many databases. Data Mining and Knowl. Discovery\u00a017, 24\u201338 (2008)","journal-title":"Data Mining and Knowl. Discovery"},{"issue":"5","key":"35_CR15","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, E.W.: Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM Journal on Computing"},{"issue":"7285","key":"35_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1038\/nature08821","volume":"464","author":"J. Qin","year":"2010","unstructured":"Qin, J., et al.: A human gut microbial gene catalogue established by metagenomic sequencing. Nature\u00a0464(7285), 59\u201365 (2010)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33122-0_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:56:04Z","timestamp":1620114964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33122-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331213","9783642331220"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33122-0_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}