{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:17:55Z","timestamp":1743099475793,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319155784"},{"type":"electronic","value":"9783319155791"}],"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-15579-1_10","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T08:36:13Z","timestamp":1424680573000},"page":"133-144","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk"],"prefix":"10.1007","author":[{"given":"H. K.","family":"Dai","sequence":"first","affiliation":[]},{"given":"Z.","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1142\/S0129053391000140","volume":"3","author":"SG Akl","year":"1991","unstructured":"Akl, S.G., Guenther, G.R.: Applications of Broadcasting with Selective Reduction to the Maximal Sum Subsegment Problem. International Journal of High Speed Computing 3(2), 107\u2013119 (1991)","journal-title":"International Journal of High Speed Computing"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1109\/TPDS.2012.149","volume":"24","author":"CER Alves","year":"2013","unstructured":"Alves, C.E.R., C\u00e1ceres, E.N., Song, S.W.: Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in $$O (1)$$ Communication Rounds. IEEE Transactions on Parallel and Distributed Systems 24(3), 724\u2013733 (2013)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/11682462_33","volume-title":"LATIN 2006: Theoretical Informatics","author":"H-K Dai","year":"2006","unstructured":"Dai, H.-K., Su, H.-C.: A parallel algorithm for finding all successive minimal maximum subsequences. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 337\u2013348. Springer, Heidelberg (2006)"},{"issue":"10","key":"10_CR4","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1006\/jpdc.2001.1741","volume":"61","author":"X He","year":"2001","unstructured":"He, X., Huang, C.-H.: Communication Efficient BSP Algorithm for All Nearest Smaller Values Problem. Journal of Parallel and Distributed Computing 61(10), 1425\u20131438 (2001)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10_CR5","unstructured":"J\u00e1J\u00e1, J.: An Introduction to Parallel Algorithms. Addison-Wesley (1992)"},{"issue":"5066","key":"10_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1126\/science.1621093","volume":"257","author":"S Karlin","year":"1992","unstructured":"Karlin, S., Brendel, V.: Chance and Statistical Significance in Protein and DNA Sequence Analysis. Science 257(5066), 39\u201349 (1992)","journal-title":"Science"},{"issue":"1\u20133","key":"10_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.tcs.2007.02.027","volume":"377","author":"T-C Lin","year":"2007","unstructured":"Lin, T.-C., Lee, D.T.: Randomized Algorithm for the Sum Selection Problem. Theoretical Computer Science 377(1\u20133), 151\u2013156 (2007)","journal-title":"Theoretical Computer Science"},{"key":"10_CR8","unstructured":"Ruzzo, W.L., Tompa, M.: A linear time algorithm for finding all maximal scoring subsequences. In: The Seventh International Conference on Intelligent Systems for Molecular Biology, pp. 234\u2013241. International Society for Computational Biology (1999)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15579-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T22:37:22Z","timestamp":1676932642000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15579-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155784","9783319155791"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15579-1_10","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":"24 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}