{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:36:07Z","timestamp":1725561367599},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206958"},{"type":"electronic","value":"9783540245872"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24587-2_10","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:59:19Z","timestamp":1280393959000},"page":"78-87","source":"Crossref","is-referenced-by-count":0,"title":["Finding a Length-Constrained Maximum-Density Path in a Tree"],"prefix":"10.1007","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":"10_CR1","doi-asserted-by":"publisher","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 new approach to sequence comparison: normalized sequence alignment. Bioinformatics\u00a017, 327\u2013337 (2001)","journal-title":"Bioinformatics"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1089\/cmb.1994.1.271","volume":"1","author":"K.-M. Chao","year":"1994","unstructured":"Chao, K.-M., Hardison, R.C., Miller, W.: Recent Developments in Linear-Space Alignment Methods: a Survey. Journal of Computational Biology\u00a01, 271\u2013291 (1994)","journal-title":"Journal of Computational Biology"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0020-0255(97)10032-9","volume":"105","author":"K.-M. Chao","year":"1998","unstructured":"Chao, K.-M.: On Computing all Suboptimal Alignments. Information Sciences\u00a0105, 189\u2013207 (1998)","journal-title":"Information Sciences"},{"key":"10_CR4","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. J. Mol. Biol.\u00a0196, 261\u2013282 (1987)","journal-title":"J. Mol. Biol."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Goldwasser, M.H., Kao, M.-Y., Lu, H.-I.: Fast algorithms for finding maximumdensity segments of a sequence with applications to bioinformatics. In: Proceedings of the 2nd Workshop on Algorithms in Bioinformatics (WABI), pp. 157\u2013171 (2002)","DOI":"10.1007\/3-540-45784-4_12"},{"key":"10_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. CABIOS\u00a010, 219\u2013225 (1994)","journal-title":"CABIOS"},{"key":"10_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":"10_CR8","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 lengthconstrained heaviest segments. Journal of Computer and System Sciences\u00a065, 570\u2013586 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR9","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":"10_CR10","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.C.: Comparison of five methods for finding conserved sequences in multiple alignments of gene regulatory regions. Nucleic Acids Res.\u00a027, 3899\u20133910 (1999)","journal-title":"Nucleic Acids Res."},{"key":"10_CR11","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. PNAS\u00a099, 3740\u20133745 (2002)","journal-title":"PNAS"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0020-0190(98)00194-X","volume":"69","author":"B.Y. Wu","year":"1999","unstructured":"Wu, B.Y., Chao, K.-M., Tang, C.Y.: An efficient algorithm for the lengthconstrained heaviest path problem on a tree. Information Processing Letters\u00a069, 63\u201367 (1999)","journal-title":"Information Processing Letters"}],"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-24587-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T15:27:59Z","timestamp":1552836479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24587-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206958","9783540245872"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24587-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}