{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:57:31Z","timestamp":1725638251460},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25591-5_75","type":"book-chapter","created":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T19:32:34Z","timestamp":1322854354000},"page":"734-743","source":"Crossref","is-referenced-by-count":0,"title":["Finding Maximum Sum Segments in Sequences with Uncertainty"],"prefix":"10.1007","author":[{"given":"Hung-I","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tien-Ching","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. T.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"75_CR1","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S. Altschul","year":"1990","unstructured":"Altschul, S., Gish, W., Miller, W., Myers, E., Lipman, D.: Basic local alignment search tool. Journal of Molecular Biology\u00a0215, 403\u2013410 (1990)","journal-title":"Journal of Molecular Biology"},{"key":"75_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0378-1119(99)00485-0","volume":"241","author":"G. Barhardi","year":"2000","unstructured":"Barhardi, G.: Isochores and the evolutionary genomics of vertebrates. Gene\u00a0241, 3\u201317 (2000)","journal-title":"Gene"},{"issue":"9","key":"75_CR3","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1145\/358234.381162","volume":"27","author":"J. Bentley","year":"1984","unstructured":"Bentley, J.: Programming pearls: algorithm design techniques. Communications of the ACM\u00a027(9), 865\u2013873 (1984)","journal-title":"Communications of the ACM"},{"key":"75_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02099946","volume":"24","author":"G. Bernardi","year":"1986","unstructured":"Bernardi, G., Bernardi, G.: Compositional constraints and genome evolution. Journal of Molecular Evolution\u00a024, 1\u201311 (1986)","journal-title":"Journal of Molecular Evolution"},{"key":"75_CR5","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1038\/ng780","volume":"29","author":"R. Davuluri","year":"2001","unstructured":"Davuluri, R., Grosse, I., Zhang, M.: Computational identification of promoters and first exons in the human genome. Nature Genetics\u00a029, 412\u2013417 (2001)","journal-title":"Nature Genetics"},{"key":"75_CR6","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 Extended Abstract. In: Ibarra, O.H., Dang, Z. (eds.) CIAA 2003. LNCS, vol.\u00a02759, pp. 251\u2013257. Springer, Heidelberg (2003)"},{"key":"75_CR7","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1093\/bioinformatics\/btg023","volume":"19","author":"P. Fariselli","year":"2003","unstructured":"Fariselli, P., Finelli, M., Marchignoli, M., Martelli, P.L., Rossi, I., Casadio, R.: Maxsubseq: An algorithm for segment-length optimization. The case study of the transmembrane spanning segments. Bioinformatics\u00a019, 500\u2013505 (2003)","journal-title":"Bioinformatics"},{"key":"75_CR8","first-page":"135","volume-title":"16th Annual ACM Symposium on Theory of Computing","author":"H.N. Gabow","year":"1984","unstructured":"Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: 16th Annual ACM Symposium on Theory of Computing, pp. 135\u2013143. ACM Press, New York (1984)"},{"key":"75_CR9","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1093\/bioinformatics\/17.suppl_1.S90","volume":"17","author":"S. Hannenhalli","year":"2001","unstructured":"Hannenhalli, S., Levy, S.: Promoter prediction in the human genome. Bioinformatics\u00a017, S90\u2013S96 (2001)","journal-title":"Bioinformatics"},{"issue":"3","key":"75_CR10","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 Biosciences\u00a010(3), 219\u2013225 (1994)","journal-title":"Computer Applications in Biosciences"},{"issue":"3","key":"75_CR11","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(3), 570\u2013586 (2002)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"75_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/TCBB.2004.43","volume":"1","author":"C. Mikl\u00f3s","year":"2004","unstructured":"Mikl\u00f3s, C.: Maximum-scoring segment sets. IEEE\/ACM Transations on Computatonal Biology and Bioinformatics\u00a01(4), 139\u2013150 (2004)","journal-title":"IEEE\/ACM Transations on Computatonal Biology and Bioinformatics"},{"key":"75_CR13","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1007\/s003359900917","volume":"9","author":"R. Walder","year":"1998","unstructured":"Walder, R., Garrett, M., McClain, A., Beck, G., Brennan, T., Kramer, N., Kanis, A., Mark, A., Rapp, A., Sheffield, V.: Short tandem repeat polymorphic markers for the rat genome from marker-selected libraries associated with complex mammalian phenotypes. Mammallian Genome\u00a09, 1013\u20131021 (1998)","journal-title":"Mammallian Genome"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_75","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T23:51:38Z","timestamp":1555717898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}