{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:07Z","timestamp":1725544747868},"publisher-location":"Berlin, Heidelberg","reference-count":10,"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_20","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T11:50:30Z","timestamp":1140177030000},"page":"178-189","source":"Crossref","is-referenced-by-count":5,"title":["An Algorithm for a Generalized Maximum Subsequence Problem"],"prefix":"10.1007","author":[{"given":"Thorsten","family":"Bernholt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Hofmeister","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"10","key":"20_CR1","doi-asserted-by":"publisher","first-page":"1294","DOI":"10.1093\/bioinformatics\/btg135","volume":"19","author":"L. Allison","year":"2003","unstructured":"Allison, L.: Longest biased interval and longest non-negative sum interval. Bioinformatics\u00a019(10), 1294\u20131295 (2003)","journal-title":"Bioinformatics"},{"key":"20_CR2","volume-title":"Programming Pearls","author":"J. Bentley","year":"1984","unstructured":"Bentley, J.: Programming Pearls. Addison-Wesley, Reading (1984)"},{"key":"20_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S. Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-30551-4_27","volume-title":"Algorithms and Computation","author":"K.-Y. Chen","year":"2004","unstructured":"Chen, K.-Y., Chao, K.-M.: On the Range Maximum-Sum Segment Query Problem. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 294\u2013305. Springer, Heidelberg (2004)"},{"key":"20_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry \u2013 Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry \u2013 Algorithms and Applications, 2nd edn. Springer, Heidelberg (2000)","edition":"2"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/aos\/996986501","volume":"29","author":"P.L. Davies","year":"2001","unstructured":"Davies, P.L., Kovac, A.: Local Extremes, Runs, Strings and Multiresolution (with discussion). Annals of Statistics\u00a029, 1\u201365 (2001)","journal-title":"Annals of Statistics"},{"key":"20_CR7","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. In: Ibarra, O.H., Dang, Z. (eds.) CIAA 2003. LNCS, vol.\u00a02759, pp. 251\u2013257. Springer, Heidelberg (2003)"},{"key":"20_CR8","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":"20_CR9","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/11415770_6","volume-title":"Research in Computational Molecular Biology","author":"D. Lipson","year":"2005","unstructured":"Lipson, D., Aumann, Y., Ben-Dor, A., Linial, N., Yakhini, Z.: Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a03500, pp. 83\u2013100. Springer, Heidelberg (2005)"},{"key":"20_CR10","volume-title":"Computational geometry: An introduction through randomized algorithms","author":"K. Mulmuley","year":"1994","unstructured":"Mulmuley, K.: Computational geometry: An introduction through randomized algorithms. Prentice-Hall, Englewood Cliffs (1994)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,12]],"date-time":"2020-04-12T19:48:45Z","timestamp":1586720925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11682462_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}