{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T05:48:08Z","timestamp":1748929688927},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2005,3]]},"DOI":"10.1007\/s10878-005-6853-7","type":"journal-article","created":{"date-parts":[[2005,5,3]],"date-time":"2005-05-03T05:42:13Z","timestamp":1115098933000},"page":"147-156","source":"Crossref","is-referenced-by-count":12,"title":["Finding a Length-Constrained Maximum-Density Path in a Tree"],"prefix":"10.1007","volume":"9","author":[{"given":"Rung-Ren","family":"Lin","sequence":"first","affiliation":[]},{"given":"Wen-Hsiung","family":"Kuo","sequence":"additional","affiliation":[]},{"given":"Kun-Mao","family":"Chao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1093\/bioinformatics\/17.4.327","volume":"17","author":"A. Arslan","year":"2001","unstructured":"A. Arslan, \u00d6. E\u011fecio\u011flu, and P. Pevzner, \u201cA new approach to sequence comparison: normalized sequence alignment,\u201d Bioinformatics, vol. 17, pp. 327\u2013337, 2001.","journal-title":"Bioinformatics"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1089\/cmb.1994.1.271","volume":"1","author":"K.-M. Chao","year":"1994","unstructured":"K.-M. Chao, R.C. Hardison, and W. Miller, \u201cRecent developments in linear-space alignment methods: A survey,\u201d Journal of Computational Biology, vol. 1, pp. 271\u2013291, 1994.","journal-title":"Journal of Computational Biology"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0020-0255(97)10032-9","volume":"105","author":"K.-M. Chao","year":"1998","unstructured":"K.-M. Chao, \u201cOn computing all suboptimal alignments,\u201d Information Sciences, vol. 105, pp. 189\u2013207, 1998.","journal-title":"Information Sciences"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0022-2836(87)90689-9","volume":"196","author":"M. Gardiner-Garden","year":"1987","unstructured":"M. Gardiner-Garden and M. Frommer, \u201cCpG islands in vertebrate genomes,\u201d J. Mol. Biol., vol. 196, pp. 261\u2013282, 1987.","journal-title":"J. Mol. Biol."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"M.H. Goldwasser, M.-Y. Kao, and H.-I. Lu, \u201cFast algorithms for finding maximum-density segments of a sequence with applications to bioinformatics,\u201d in Proceedings of the 2nd Workshop on Algorithms in Bioinformatics (WABI), 2002, pp. 157\u2013171.","DOI":"10.1007\/3-540-45784-4_12"},{"key":"CR6","first-page":"219","volume":"10","author":"X. Huang","year":"1994","unstructured":"X. Huang, \u201cAn algorithm for identifying regions of a DNA sequence that satisfy a content requirement,\u201d CABIOS, vol. 10, pp. 219\u2013225, 1994.","journal-title":"CABIOS"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0020-0190(03)00225-4","volume":"86","author":"S.K. Kim","year":"2003","unstructured":"S.K. Kim., \u201cLinear-time algorithm for finding a maximum-density segment of a sequence,\u201d Information Processing Letters, vol. 86, pp. 339\u2013342, 2003.","journal-title":"Information Processing Letters"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1016\/S0022-0000(02)00010-7","volume":"65","author":"Y.-L. Lin","year":"2002","unstructured":"Y.-L. Lin, T. Jiang, and K.-M. Chao, \u201cEfficient algorithms for locating the length-constrained heaviest segments,\u201d Journal of Computer and System Sciences, vol. 65, pp. 570\u2013586, 2002.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1093\/bioinformatics\/19.1.151","volume":"19","author":"Y.-L. Lin","year":"2003","unstructured":"Y.-L. Lin, X. Huang, T. Jiang, and K.-M. Chao, \u201cMAVG, pp. Locating non-overlapping maximum average segments in a given sequence,\u201d Bioinformatics, vol. 19, pp. 151\u2013152, 2003.","journal-title":"Bioinformatics"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"3899","DOI":"10.1093\/nar\/27.19.3899","volume":"27","author":"N. Stojanovic","year":"1999","unstructured":"N. Stojanovic, L. Florea, C. Riemer, D. Gumucio, J. Slightom, M. Goodman, W. Miller, and R.C. Hardison, \u201cComparison of five methods for finding conserved sequences in multiple alignments of gene regulatory regions,\u201d Nucleic Acids Res., vol. 27, pp. 3899\u20133910, 1999.","journal-title":"Nucleic Acids Res."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"3740","DOI":"10.1073\/pnas.052410099","volume":"99","author":"D. Takai","year":"2002","unstructured":"D. Takai and P.A. Jones, \u201cComprehensive analysis of CpG islands in human chromosomes 21 and 22,\u201d PNAS, vol. 99, pp. 3740\u20133745, 2002.","journal-title":"PNAS"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0020-0190(98)00194-X","volume":"69","author":"B.Y. Wu","year":"1999","unstructured":"B.Y. Wu, K.-M. Chao and C.Y. Tang, \u201cAn efficient algorithm for the length-constrained heaviest path problem on a tree,\u201d Information Processing Letters, vol. 69, pp. 63\u201367, 1999.","journal-title":"Information Processing Letters"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-6853-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-6853-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-6853-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:09Z","timestamp":1559261889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-6853-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["6853"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-6853-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,3]]}}}