{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:35:41Z","timestamp":1725521741995},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921813"},{"type":"electronic","value":"9783540921820"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92182-0_42","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T02:38:06Z","timestamp":1228876686000},"page":"460-471","source":"Crossref","is-referenced-by-count":1,"title":["Minkowski Sum Selection and Finding"],"prefix":"10.1007","author":[{"given":"Cheng-Wei","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsiao-Fei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng-An","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun-Mao","family":"Chao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"10","key":"42_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 Application Note\u00a019(10), 1294\u20131295 (2003)","journal-title":"Bioinformatics Application Note"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Lower Bounds for Algebraic Computation Trees. In: Proc. STOC, pp. 80\u201386 (1983)","DOI":"10.1145\/800061.808735"},{"issue":"1","key":"42_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00453-006-0076-x","volume":"46","author":"F. Bengtsson","year":"2006","unstructured":"Bengtsson, F., Chen, J.: Efficient Algorithms for k Maximum Sums. Algorithmica\u00a046(1), 27\u201341 (2006)","journal-title":"Algorithmica"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Bernholt, T., Eisenbrand, F., Hofmeister, T.: A Geometric Framework for Solving Subsequence Problems in Computational Biology Efficiently. In: SoCG, pp. 310\u2013318 (2007)","DOI":"10.1145\/1247069.1247125"},{"issue":"6","key":"42_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.ipl.2005.08.006","volume":"96","author":"K.-Y. Chen","year":"2005","unstructured":"Chen, K.-Y., Chao, K.-M.: Optimal Algorithms for Locating the Longest and Shortest Segments Satisfying a Sum or an Average Constraint. Information Processing Letter\u00a096(6), 197\u2013201 (2005)","journal-title":"Information Processing Letter"},{"issue":"4","key":"42_CR6","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1137\/0218055","volume":"18","author":"R. Cole","year":"1989","unstructured":"Cole, R., Salowe, J.S., Steiger, W.L., Szemeredi, E.: An Optimal-Time Algorithm for Slope Selection. SIAM Journal on Computing\u00a018(4), 792\u2013810 (1989)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"42_CR7","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1137\/0213002","volume":"13","author":"G.N. Frederickson","year":"1984","unstructured":"Frederickson, G.N., Johnson, D.B.: Generalized Selection and Ranking: Sorted Matrices. SIAM Journal on Computing\u00a013(1), 14\u201330 (1984)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"42_CR8","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. Journal of Computer and System Sciences\u00a070(2), 128\u2013144 (2005)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"42_CR9","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. Computer Applications in the Biosciences\u00a010(3), 219\u2013225 (1994)","journal-title":"Computer Applications in the Biosciences"},{"issue":"1","key":"42_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1038\/79189","volume":"26","author":"I. Ioshikhes","year":"2000","unstructured":"Ioshikhes, I., Zhang, M.Q.: Large-Scale Human Promoter Mapping Using CpG Islands. Nature Genetics\u00a026(1), 61\u201363 (2000)","journal-title":"Nature Genetics"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Lee, D.T., Lin, T.-C., Lu, H.-I.: Fast Algorithms for the Density Finding Problem. Algorithmica (2007), doi:10.1007\/s00453-007-9023-8","DOI":"10.1007\/s00453-007-9023-8"},{"key":"42_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/11940128_47","volume-title":"Algorithms and Computation","author":"T.-C. Lin","year":"2006","unstructured":"Lin, T.-C., Lee, D.T.: Efficient Algorithm for the Sum Selection Problem and k Maximum Sums Problem. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 460\u2013473. Springer, Heidelberg (2006)"},{"issue":"1-3","key":"42_CR13","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\u00a0377(1-3), 151\u2013156 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"42_CR14","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(3), 570\u2013586 (2002)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"42_CR15","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(1), 151\u2013152 (2003)","journal-title":"Bioinformatics"},{"issue":"2","key":"42_CR16","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1089\/cmb.2006.13.215","volume":"13","author":"D. Lipson","year":"2006","unstructured":"Lipson, D., Aumann, Y., Ben-Dor, A., Linial, N., Yakhini, Z.: Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. Journal of Computational Biology\u00a013(2), 215\u2013228 (2006)","journal-title":"Journal of Computational Biology"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Luo, C.-W., Liu, H.-F., Chen, P.-A., Chao, K.-M.: Minkowski Sum Selection and Finding. CoRR abs\/0809.1171 (2008)","DOI":"10.1007\/978-3-540-92182-0_42"},{"issue":"4","key":"42_CR18","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(91)90177-J","volume":"39","author":"J. Matou\u0161ek","year":"1991","unstructured":"Matou\u0161ek, J.: Randomized optimal algorithm for slope selection. Information Processing Letters\u00a039(4), 183\u2013187 (1991)","journal-title":"Information Processing Letters"},{"key":"42_CR19","doi-asserted-by":"crossref","unstructured":"Ohler, U., Niemann, H., Liao, G.-C., Rubin, G.M.: Joint Modeling of DNA Sequence and Physical Properties to Improve Eukaryotic Promoter Recognition. Bioinformatics, 199\u2013206 (2001)","DOI":"10.1093\/bioinformatics\/17.suppl_1.S199"},{"issue":"2","key":"42_CR20","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(2), 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-92182-0_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T03:44:37Z","timestamp":1557978277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92182-0_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921813","9783540921820"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92182-0_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}