{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:17Z","timestamp":1725474977713},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_31","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T00:57:35Z","timestamp":1164761855000},"page":"300-307","source":"Crossref","is-referenced-by-count":3,"title":["On Locating Disjoint Segments with Maximum Sum of Densities"],"prefix":"10.1007","author":[{"given":"Hsiao-Fei","family":"Liu","sequence":"first","affiliation":[]},{"given":"Kun-Mao","family":"Chao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Bergkvist, A., Damaschke, P.: Fast Algorithms for Finding Disjoint Subsequences with Extremal Densities. In: Proceedings of the 16th Annual International Symposium on Algorithms and Computation, pp. 714\u2013723 (2005)","DOI":"10.1007\/11602613_72"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Chen, Y.H., Lu, H.-I., Tang, C.Y.: Disjoint Segments with Maximum Density. In: Proceedings of the 5th Annual International Conference on Computational Science, pp. 845\u2013850 (2005)","DOI":"10.1007\/11428848_108"},{"key":"31_CR3","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 Journal on Computing\u00a034, 373\u2013387 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR4","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. Journal of Computer and System Sciences\u00a058, 1\u201312 (1999)","journal-title":"Journal of Computer and System Sciences"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.jcss.2004.08.001","volume":"70","author":"M. Goldwasser","year":"2005","unstructured":"Goldwasser, M., 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, 128\u2013144 (2005)","journal-title":"Journal of Computer and System Sciences"},{"key":"31_CR6","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, 219\u2013225 (1994)","journal-title":"Computer Applications in the Biosciences"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/S0020-0190(03)00225-4","volume":"86","author":"S.K. Kim","year":"2003","unstructured":"Kim, S.K.: Linear-Time Algorithm for Finding a Maximum-Density Segment of a Sequence. Information Processing Letters\u00a086, 339\u2013342 (2003)","journal-title":"Information Processing Letters"},{"key":"31_CR8","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":"31_CR9","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":"31_CR10","unstructured":"Liu, H.-F., Chao, K.-M.: An Optimal Algorithm for Iteratively Locating Non-Overlapping Maximum Density Segments. Information Processing Letters (submitted)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:49:52Z","timestamp":1619495392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11940128_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}