{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:58:43Z","timestamp":1725559123446},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_27","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T14:15:37Z","timestamp":1279030537000},"page":"294-305","source":"Crossref","is-referenced-by-count":13,"title":["On the Range Maximum-Sum Segment Query Problem"],"prefix":"10.1007","author":[{"given":"Kuan-Yu","family":"Chen","sequence":"first","affiliation":[]},{"given":"Kun-Mao","family":"Chao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA Problem Revisited. In: Proceedings of the 4th Latin American Symposium on Theoretical Informatics, vol.\u00a017, pp. 88\u201394 (2000)","DOI":"10.1007\/10719839_9"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Bentley, J.: Programming Pearls - Algorithm Design Techniques. In: CACM, pp. 865\u2013871 (1984)","DOI":"10.1145\/358234.381162"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-39658-1_15","volume-title":"Algorithms - ESA 2003","author":"K. Chung","year":"2003","unstructured":"Chung, K., Lu, H.-I.: An optimal algorithm for the maximum-density segment problem. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 136\u2013147. Springer, Heidelberg (2003)"},{"key":"27_CR4","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)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Gabow, H., Bentley, J., Tarjan, R.:Scaling and Related Techniques for Geometry Problems. In: Proc. Symp Theory of Computing(STOC), pp. 135\u2013143 (1984)","DOI":"10.1145\/800057.808675"},{"key":"27_CR6","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1999","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1999)"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast Algorithms for Finding Nearest Common Ancestors. SIAM J Comput.\u00a013, 338\u2013355 (1984)","journal-title":"SIAM J Comput."},{"key":"27_CR8","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. CABIOS\u00a010, 219\u2013225 (1994)","journal-title":"CABIOS"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1093\/bioinformatics\/19.1.151","volume":"19","author":"Y.-L. Lin","year":"2003","unstructured":"Lin, Y.-L., Huang, X., Jiang, T., Chao, K.-M.: MAVG: Locating Non-Overlapping Maximum Average Segments in a Given Sequence. Bioinformatics\u00a019, 151\u2013152 (2003)","journal-title":"Bioinformatics"},{"key":"27_CR10","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. Journal of Computer and System Sciences\u00a065, 570\u2013586 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"27_CR11","unstructured":"Ruzzo, W.L., Tompa, M.: A Linear Time Algorithm for Finding All Maximal Scoring Subsequences. In: 7th Intl. Conf. Intelligent Systems for Molecular Biology, Heidelberg, Germany, pp. 234\u2013241 (1999)"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On Finding Lowest Common Ancestors: Simplification and Parallelization. SIAM J. Comput.\u00a017, 1253\u20131262 (1988)","journal-title":"SIAM J. Comput."},{"key":"27_CR13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J. Vuillemin","year":"1980","unstructured":"Vuillemin, J.: A Unifying Look at Data Structures. CACM\u00a023, 229\u2013239 (1980)","journal-title":"CACM"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/bioinformatics\/19.2.297","volume":"19","author":"L. Wang","year":"2003","unstructured":"Wang, L., Xu, Y.: SEGID:Identifying Interesting Segments in (Multiple) Sequence Alignments. Bioinformatics\u00a019, 297\u2013298 (2003)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:21:23Z","timestamp":1605741683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}