{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:29:48Z","timestamp":1743114588449,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_224","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:35:29Z","timestamp":1214505329000},"page":"502-504","source":"Crossref","is-referenced-by-count":0,"title":["Maximum-Density Segment"],"prefix":"10.1007","author":[{"given":"Kun-Mao","family":"Chao","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"224_CR1_224","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1093\/bioinformatics\/17.4.327","volume":"17","author":"A. Arslan","year":"2001","unstructured":"Arslan A., E\u011fecio\u011flu, \u00d6, Pevzner, P.: A\u00a0new approach to sequence comparison: normalized sequence alignment. Bioinformatics 17, 327\u2013337 (2001)","journal-title":"Bioinformatics"},{"key":"224_CR2_224","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. LNCS, vol.\u00a03827, pp.\u00a0714\u2013723 (2005)","DOI":"10.1007\/11602613_72"},{"key":"224_CR3_224","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.\u00a0845\u2013850 (2005)","DOI":"10.1007\/11428848_108"},{"key":"224_CR4_224","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.\u00a0Comput. 34, 373\u2013387 (2004)","journal-title":"SIAM. J. Comput."},{"key":"224_CR5_224","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.\u00a0Comput. Syst. Sci. 58, 1\u201312 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"224_CR6_224","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.\u00a0Comput. Syst. Sci. 70, 128\u2013144 (2005)","journal-title":"J. Comput. Syst. Sci."},{"key":"224_CR7_224","first-page":"219","volume":"10","author":"X. Huang","year":"1994","unstructured":"Huang, X.: An algorithm for identifying regions of a\u00a0DNA sequence that satisfy a\u00a0content requirement. Comput. Appl. Biosci. 10, 219\u2013225 (1994)","journal-title":"Comput. Appl. Biosci."},{"key":"224_CR8_224","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\u00a0maximum-density segment of a\u00a0sequence. Inf. Process. Lett. 86, 339\u2013342 (2003)","journal-title":"Inf. Process. Lett."},{"key":"224_CR9_224","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\u00a0given sequence. Bioinformatics 19, 151\u2013152 (2003)","journal-title":"Bioinformatics"},{"key":"224_CR10_224","doi-asserted-by":"crossref","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.\u00a0Comput. Syst. Sci. 65, 570\u2013586 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"224_CR11_224","doi-asserted-by":"crossref","unstructured":"Liu, H.-F., Chao, K.-M.: On locating disjoint segments with maximum sum of densities. In: Proceedings of the 17th Annual International Symposium on Algorithms and Computation. LNCS, vol. 4288, pp. 300\u2013307 (2006)","DOI":"10.1007\/11940128_31"},{"key":"224_CR12_224","doi-asserted-by":"publisher","first-page":"1986","DOI":"10.1101\/gr.10.12.1986","volume":"10","author":"A. Nekrutenko","year":"2000","unstructured":"Nekrutenko, A., Li, W.H.: Assessment of compositional heterogeneity within and between eukaryotic genomes. Genome Res. 10, 1986\u20131995 (2000)","journal-title":"Genome Res."},{"key":"224_CR13_224","doi-asserted-by":"publisher","first-page":"3899","DOI":"10.1093\/nar\/27.19.3899","volume":"19","author":"N. Stojanovic","year":"1999","unstructured":"Stojanovic, N., Florea, L., Riemer, C., Gumucio, D., Slightom, J., Goodman, M., Miller, W., Hardison, R.: Comparison of five methods for finding conserved sequences in multiple alignments of gene regulatory regions. Nucl. Acid. Res. 19, 3899\u20133910 (1999)","journal-title":"Nucl. Acid. Res."},{"key":"224_CR14_224","doi-asserted-by":"publisher","first-page":"2140","DOI":"10.1093\/bioinformatics\/bth196","volume":"20","author":"N. Stojanovic","year":"2005","unstructured":"Stojanovic, N., Dewar, K.: Identifying multiple alignment regions satisfying simple formulas and patterns. Bioinformatics 20, 2140\u20132142 (2005)","journal-title":"Bioinformatics"},{"key":"224_CR15_224","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1093\/bioinformatics\/15.12.1012","volume":"15","author":"Z. Zhang","year":"1999","unstructured":"Zhang, Z., Berman, P., Wiehe, T., Miller, W.: Post-processing long pairwise alignments. Bioinformatics 15, 1012\u20131019 (1999)","journal-title":"Bioinformatics"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_224","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T03:18:58Z","timestamp":1662175138000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_224"}},"subtitle":["1994; Huang"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_224","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}