{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T13:16:54Z","timestamp":1792156614942,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540260431","type":"print"},{"value":"9783540321149","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11428848_108","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T17:44:33Z","timestamp":1279129473000},"page":"845-850","source":"Crossref","is-referenced-by-count":8,"title":["Disjoint Segments with Maximum Density"],"prefix":"10.1007","author":[{"given":"Yen Hung","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hsueh-I","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chuan Yi","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"108_CR1","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1089\/cmb.2004.11.766","volume":"11","author":"P. Berman","year":"2004","unstructured":"Berman, P., Bertone, P., DasGupta, B., Gerstein, M., Kao, M.-Y., Snyder, M.: Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. Journal of Computational Biology\u00a011, 766\u2013785 (2004)","journal-title":"Journal of Computational Biology"},{"key":"108_CR2","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":"108_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511790492","volume-title":"Biological Sequence Analysis","author":"R. Durbin","year":"1998","unstructured":"Durbin, R., Eddy, S., Krogh, A., Mitchison, G.: Biological Sequence Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"108_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. In: Ibarra, O.H., Dang, Z. (eds.) CIAA 2003. LNCS, vol.\u00a02759, pp. 251\u2013257. Springer, Heidelberg (2003)"},{"key":"108_CR5","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0022-2836(87)90689-9","volume":"196","author":"M. Gardiner-Garden","year":"1987","unstructured":"Gardiner-Garden, M., Frommer, M.: CpG Islands in Vertebrate Genomes. Journal of Molecular Biology\u00a0196, 261\u2013282 (1987)","journal-title":"Journal of Molecular Biology"},{"key":"108_CR6","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, 128\u2013144 (2005)","journal-title":"Journal of Computer and System Sciences"},{"key":"108_CR7","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1002\/net.3230120410","volume":"12","author":"U.I. Gupta","year":"1982","unstructured":"Gupta, U.I., Lee, D.T., Leung, J.Y.-T.: Efficient Algorithms for Interval Graphs and Circular-Arc Graphs. Networks\u00a012, 459\u2013467 (1982)","journal-title":"Networks"},{"issue":"5","key":"108_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(92)90216-I","volume":"43","author":"J.Y. Hsiao","year":"1992","unstructured":"Hsiao, J.Y., Tang, C.Y., Chang, R.S.: An Efficient Algorithm for Finding a Maximum Weight 2-Independent Set on Interval Graphs. Information Processing Letters\u00a043(5), 229\u2013235 (1992)","journal-title":"Information Processing Letters"},{"key":"108_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, 219\u2013225 (1994)","journal-title":"Computer Applications in the Biosciences"},{"key":"108_CR10","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":"108_CR11","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1016\/0888-7543(92)90024-M","volume":"13","author":"F. Larsen","year":"1992","unstructured":"Larsen, F., Gundersen, R., Lopez, R., Prydz, H.: CpG Islands as Gene Marker in the Human Genome. Genomics\u00a013, 1095\u20131107 (1992)","journal-title":"Genomics"},{"key":"108_CR12","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":"108_CR13","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":"108_CR14","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 Research\u00a010, 1986\u20131995 (2000)","journal-title":"Genome Research"},{"key":"108_CR15","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/S0168-9525(00)02024-2","volume":"16","author":"P. Rice","year":"2000","unstructured":"Rice, P., Longden, I., Bleasby, A.: EMBOSS: The European Molecular Biology Open Software Suite. Trends in Genetics\u00a016, 276\u2013277 (2000)","journal-title":"Trends in Genetics"},{"key":"108_CR16","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/BF02459499","volume":"46","author":"P.H. Sellers","year":"1984","unstructured":"Sellers, P.H.: Pattern Recognition in Genetic Sequences by Mismatch Density. Bulletin of Mathematical Biology\u00a046, 501\u2013514 (1984)","journal-title":"Bulletin of Mathematical Biology"},{"key":"108_CR17","doi-asserted-by":"publisher","first-page":"3899","DOI":"10.1093\/nar\/27.19.3899","volume":"27","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. Nucleic Acids Research\u00a027, 3899\u20133910 (1999)","journal-title":"Nucleic Acids Research"},{"key":"108_CR18","doi-asserted-by":"publisher","first-page":"3740","DOI":"10.1073\/pnas.052410099","volume":"99","author":"D. Takai","year":"2002","unstructured":"Takai, D., Jones, P.A.: Comprehensive Analysis of CpG Islands in Human Chromosomes 21 and 22. Proceedings of the National Academy of Sciences\u00a099, 3740\u20133745 (2002)","journal-title":"Proceedings of the National Academy of Sciences"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11428848_108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,16]],"date-time":"2019-03-16T20:26:49Z","timestamp":1552768009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11428848_108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260431","9783540321149"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11428848_108","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}