{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T04:56:03Z","timestamp":1725684963605},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298219"},{"type":"electronic","value":"9783642298226"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29822-6_18","type":"book-chapter","created":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T13:21:09Z","timestamp":1337520069000},"page":"213-227","source":"Crossref","is-referenced-by-count":1,"title":["Calculational Developments of New Parallel Algorithms for Size-Constrained Maximum-Sum Segment Problems"],"prefix":"10.1007","author":[{"given":"Akimasa","family":"Morihata","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"18_CR1","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1145\/358234.381162","volume":"27","author":"J.L. Bentley","year":"1984","unstructured":"Bentley, J.L.: Algorithm design techniques. Commun. ACM\u00a027(9), 865\u2013871 (1984)","journal-title":"Commun. ACM"},{"issue":"11","key":"18_CR2","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1145\/1968.381154","volume":"27","author":"J.L. Bentley","year":"1984","unstructured":"Bentley, J.L.: Perspective on performance. Commun. ACM\u00a027(11), 1087\u20131092 (1984)","journal-title":"Commun. ACM"},{"issue":"2","key":"18_CR3","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1093\/comjnl\/32.2.122","volume":"32","author":"R.S. Bird","year":"1989","unstructured":"Bird, R.S.: Algebraic identities for program calculation. Comput. J.\u00a032(2), 122\u2013126 (1989)","journal-title":"Comput. J."},{"issue":"4","key":"18_CR4","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1017\/S0956796801004038","volume":"11","author":"R.S. Bird","year":"2001","unstructured":"Bird, R.S.: Maximum marking problems. J. Funct. Program.\u00a011(4), 411\u2013424 (2001)","journal-title":"J. Funct. Program."},{"issue":"2","key":"18_CR5","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/S0097539704440430","volume":"34","author":"K.M. Chung","year":"2004","unstructured":"Chung, K.M., Lu, H.I.: An optimal algorithm for the maximum-density segment problem. SIAM J. Comput.\u00a034(2), 373\u2013387 (2004)","journal-title":"SIAM J. Comput."},{"key":"18_CR6","first-page":"489","volume-title":"Proc. Parallel Computing: Trends and Applications, PARCO 1993","author":"M. Cole","year":"1994","unstructured":"Cole, M.: Parallel programming, list homomorphisms and the maximum segment sum problem. In: Proc. Parallel Computing: Trends and Applications, PARCO 1993, pp. 489\u2013492. Elsevier, Amsterdam (1994)"},{"key":"18_CR7","unstructured":"Emoto, K., Fischer, S., Hu, Z.: Generate, test, and aggregate\u2014a calculation-based framework for systematic parallel programming with MapReduce. Technical report METR 2011-34, Department of Mathematical Engineering and Information Physics, University of Tokyo (2011)"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-28869-2_13","volume-title":"Programming Languages and Systems","author":"K. Emoto","year":"2012","unstructured":"Emoto, K., Fischer, S., Hu, Z.: Generate, Test, and Aggregate\u2014a Calculation-Based Framework for Systematic Parallel Programming with MapReduce. In: Seidl, H. (ed.) ESOP 2012. LNCS, vol.\u00a07211, pp. 254\u2013273. Springer, Heidelberg (2012)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-642-15291-7_4","volume-title":"Euro-Par 2010 - Parallel Processing","author":"K. Emoto","year":"2010","unstructured":"Emoto, K., Hu, Z., Kakehi, K., Matsuzaki, K., Takeichi, M.: Generators-of-Generators Library with Optimization Capabilities in Fortress. In: D\u2019Ambra, P., Guarracino, M., Talia, D. (eds.) Euro-Par 2010. LNCS, vol.\u00a06272, pp. 26\u201337. Springer, Heidelberg (2010)"},{"issue":"6","key":"18_CR10","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s10766-007-0043-4","volume":"35","author":"K. Emoto","year":"2007","unstructured":"Emoto, K., Hu, Z., Kakehi, K., Takeichi, M.: A compositional framework for developing parallel programs on two-dimensional arrays. Int. J. Parallel Program.\u00a035(6), 615\u2013658 (2007)","journal-title":"Int. J. Parallel Program."},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-45089-0_23","volume-title":"Implementation and Application of Automata","author":"T.-H. Fan","year":"2003","unstructured":"Fan, T.-H., Lee, S., Lu, H.-I., Tsou, T.-S., Wang, T.-C., Yao, A.: An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics (Extended Abstract). In: Ibarra, O.H., Dang, Z. (eds.) CIAA 2003. LNCS, vol.\u00a02759, pp. 251\u2013257. Springer, Heidelberg (2003)"},{"issue":"1","key":"18_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jcss.1998.1595","volume":"58","author":"T. Fukuda","year":"1999","unstructured":"Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Mining optimized association rules for numeric attributes. J. Comput. Syst. Sci.\u00a058(1), 1\u201312 (1999)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"18_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1145\/383891.383893","volume":"26","author":"T. Fukuda","year":"2001","unstructured":"Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Data mining with optimized two-dimensional association rules. ACM Trans. Database Syst.\u00a026(2), 179\u2013213 (2001)","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"18_CR14","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.jcss.2004.08.001","volume":"70","author":"M.H. Goldwasser","year":"2005","unstructured":"Goldwasser, M.H., Kao, M.Y., Lu, H.I.: Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications. J. Comput. Syst. Sci.\u00a070(2), 128\u2013144 (2005)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"18_CR15","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/256167.256201","volume":"19","author":"Z. Hu","year":"1997","unstructured":"Hu, Z., Iwasaki, H., Takechi, M.: Formal derivation of efficient parallel programs by construction of list homomorphisms. ACM Trans. Program. Lang. Syst.\u00a019(3), 444\u2013461 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"3","key":"18_CR16","first-page":"219","volume":"10","author":"X. Huang","year":"1994","unstructured":"Huang, X.: An algorithm for identifying regions of a DNA sequence that satisfy a content requirement. Comput. Appl. Biosci.\u00a010(3), 219\u2013225 (1994)","journal-title":"Comput. Appl. Biosci."},{"issue":"4","key":"18_CR17","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.disopt.2006.06.002","volume":"3","author":"H.C. Lau","year":"2006","unstructured":"Lau, H.C., Ngo, T.H., Nguyen, B.N.: Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics. Discrete Optimization\u00a03(4), 385\u2013391 (2006)","journal-title":"Discrete Optimization"},{"issue":"3","key":"18_CR18","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/S0022-0000(02)00010-7","volume":"65","author":"Y.L. Lin","year":"2002","unstructured":"Lin, Y.L., Jiang, T., Chao, K.M.: Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. J. Comput. Syst. Sci.\u00a065(3), 570\u2013586 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1-3","key":"18_CR19","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.tcs.2008.06.052","volume":"407","author":"H.F. Liu","year":"2008","unstructured":"Liu, H.F., Chao, K.M.: Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence. Theor. Comput. Sci.\u00a0407(1-3), 349\u2013358 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR20","first-page":"16","volume":"49","author":"K. Matsuzaki","year":"2008","unstructured":"Matsuzaki, K., Hu, Z., Takeichi, M.: Derivation of parallel programs for maximum marking problems on lists. IPSJ Trans. Program.\u00a049, 16\u201327 (2008) (in Japanese)","journal-title":"IPSJ Trans. Program."},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1328408.1328414","volume-title":"Proc. 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, PEPM 2008","author":"S.C. Mu","year":"2008","unstructured":"Mu, S.C.: Maximum segment sum is back: deriving algorithms for two segment problems with bounded lengths. In: Proc. 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, PEPM 2008, pp. 31\u201339. ACM Press, New York (2008)"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/351240.351254","volume-title":"Proc. 5th ACM SIGPLAN International Conference on Functional Programming, ICFP 2000","author":"I. Sasano","year":"2000","unstructured":"Sasano, I., Hu, Z., Takeichi, M., Ogawa, M.: Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems. In: Proc. 5th ACM SIGPLAN International Conference on Functional Programming, ICFP 2000, pp. 137\u2013149. ACM Press, New York (2000)"},{"issue":"3","key":"18_CR23","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0167-6423(93)90014-G","volume":"20","author":"D.B. Skillicorn","year":"1993","unstructured":"Skillicorn, D.B.: Deriving parallel programs from specifications using cost information. Sci. Comput. Program.\u00a020(3), 205\u2013221 (1993)","journal-title":"Sci. Comput. Program."},{"issue":"3","key":"18_CR24","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0167-6423(87)90034-7","volume":"8","author":"D.R. Smith","year":"1987","unstructured":"Smith, D.R.: Applications of a strategy for designing divide-and-conquer algorithms. Sci. Comput. Program.\u00a08(3), 213\u2013229 (1987)","journal-title":"Sci. Comput. Program."},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S1571-0661(04)00313-5","volume":"61","author":"T. Takaoka","year":"2002","unstructured":"Takaoka, T.: Efficient algorithms for the maximum subarray problem by distance matrix multiplication. Electr. Notes Theor. Comput. Sci.\u00a061, 191\u2013200 (2002)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"18_CR26","unstructured":"Tamaki, H., Tokuyama, T.: Algorithms for the maxium subarray problem based on matrix multiplication. In: Proc. Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 446\u2013452 (1998)"},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1145\/99370.99404","volume-title":"Proc. FPCA 1989 Conference on Functional Programming Languages and Computer Architecture","author":"P. Wadler","year":"1989","unstructured":"Wadler, P.: Theorems for free! In: Proc. FPCA 1989 Conference on Functional Programming Languages and Computer Architecture, pp. 347\u2013359. ACM Press, New York (1989)"},{"issue":"3","key":"18_CR28","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/0167-8191(94)00063-G","volume":"21","author":"Z. Wen","year":"1995","unstructured":"Wen, Z.: Fast parallel algorithms for the maximum sum problem. Parallel Comput.\u00a021(3), 461\u2013466 (1995)","journal-title":"Parallel Comput."},{"issue":"1","key":"18_CR29","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0167-6423(92)90033-8","volume":"18","author":"H. Zantema","year":"1992","unstructured":"Zantema, H.: Longest segment problems. Sci. Comput. Program.\u00a018(1), 39\u201366 (1992)","journal-title":"Sci. Comput. Program."},{"key":"18_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/3-540-36182-0_42","volume-title":"Discovery Science","author":"H. Zhao","year":"2002","unstructured":"Zhao, H., Hu, Z., Takeichi, M.: A Compositional Framework for Mining Longest Ranges. In: Lange, S., Satoh, K., Smith, C.H. (eds.) DS 2002. LNCS, vol.\u00a02534, pp. 406\u2013413. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29822-6_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:17:28Z","timestamp":1620127048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29822-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298219","9783642298226"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29822-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}