{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:30Z","timestamp":1725544770086},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11682462_33","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T06:50:30Z","timestamp":1140159030000},"page":"337-348","source":"Crossref","is-referenced-by-count":4,"title":["A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences"],"prefix":"10.1007","author":[{"given":"Ho-Kwok","family":"Dai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hung-Chi","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"33_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1142\/S0129053391000140","volume":"3","author":"S.G. 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\u00a03(2), 107\u2013119 (1991)","journal-title":"International Journal of High Speed Computing"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Berkman, O., Breslauer, D., Galil, Z., Schieber, B., Vishkin, U.: Highlyparallelizable problems. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 309\u2013319. Association for Computing Machinery (1989)","DOI":"10.1145\/73007.73036"},{"issue":"6","key":"33_CR3","doi-asserted-by":"publisher","first-page":"2002","DOI":"10.1073\/pnas.89.6.2002","volume":"89","author":"V. Brendel","year":"1992","unstructured":"Brendel, V., Bucher, P., Nourbakhsh, I.R., Blaisdell, B.E., Karlin, S.: Methods and algorithms for statistical analysis of protein sequences. Proceedings of the National Academy of Sciences U.S.A.\u00a089(6), 2002\u20132006 (1992)","journal-title":"Proceedings of the National Academy of Sciences U.S.A."},{"issue":"1","key":"33_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/71.363412","volume":"6","author":"D.Z. Chen","year":"1995","unstructured":"Chen, D.Z.: Efficient geometric algorithms on the EREW PRAM. IEEE Transactions on Parallel and Distributed Systems\u00a06(1), 41\u201347 (1995)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"33_CR5","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)"},{"key":"33_CR6","volume-title":"An Introduction to Parallel Algorithms","author":"J. J\u00e1J\u00e1","year":"1992","unstructured":"J\u00e1J\u00e1, J.: An Introduction to Parallel Algorithms. Addison-Wesley, Reading (1992)"},{"issue":"6","key":"33_CR7","doi-asserted-by":"publisher","first-page":"2264","DOI":"10.1073\/pnas.87.6.2264","volume":"87","author":"S. Karlin","year":"1990","unstructured":"Karlin, S., Altschul, S.F.: Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes. Proceedings of the National Academy of Sciences U.S.A.\u00a087(6), 2264\u20132268 (1990)","journal-title":"Proceedings of the National Academy of Sciences U.S.A."},{"issue":"12","key":"33_CR8","doi-asserted-by":"publisher","first-page":"5873","DOI":"10.1073\/pnas.90.12.5873","volume":"90","author":"S. Karlin","year":"1993","unstructured":"Karlin, S., Altschul, S.F.: Applications and statistics for multiple high-scoring segments in molecular sequences. Proceedings of the National Academy of Sciences U.S.A.\u00a090(12), 5873\u20135877 (1993)","journal-title":"Proceedings of the National Academy of Sciences U.S.A."},{"issue":"5066","key":"33_CR9","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\u00a0257(5066), 39\u201349 (1992)","journal-title":"Science"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1017\/S0001867800024198","volume":"24","author":"S. Karlin","year":"1992","unstructured":"Karlin, S., Dembo, A.: Limit distributions of maximal segmental score among Markov-dependent partial sums. Advances in Applied Probability\u00a024, 113\u2013140 (1992)","journal-title":"Advances in Applied Probability"},{"issue":"4","key":"33_CR11","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R.E. Ladner","year":"1980","unstructured":"Ladner, R.E., Fischer, M.J.: Parallel prefix computation. Journal of the Association for Computing Machinery\u00a027(4), 831\u2013838 (1980)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"33_CR12","unstructured":"Ruzzo, W.L., Tompa, M.: A linear time algorithm for finding all maximal scoring subsequences. In: Proceedings of 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","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T20:18:45Z","timestamp":1555445925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11682462_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}