{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:06:33Z","timestamp":1743062793360,"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_226","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:35:29Z","timestamp":1214505329000},"page":"506-507","source":"Crossref","is-referenced-by-count":0,"title":["Maximum-scoring Segment with Length Restrictions"],"prefix":"10.1007","author":[{"given":"Kun-Mao","family":"Chao","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"226_CR1_226","doi-asserted-by":"crossref","unstructured":"Bae, S.E., Takaoka, T.: Algorithms for the problem of k maximum sums and a\u00a0VLSI algorithm for the k maximum subarrays problem. Proceedings of the 7th International Symposium on Parallel Architectures, Algorithms and Networks, pp. 247\u2013253 (2004)","DOI":"10.1109\/ISPAN.2004.1300488"},{"key":"226_CR2_226","volume-title":"Programming Pearls","author":"J. Bentley","year":"1986","unstructured":"Bentley, J.: Programming Pearls. Addison-Wesley, Reading (1986)"},{"key":"226_CR3_226","doi-asserted-by":"crossref","unstructured":"Chen, K.-Y., Chao, K.-M.: On the range maximum-sum segment query problem. Proceedings of the 15th International Symposium on Algorithms And Computation. LNCS 3341, 294\u2013305 (2004)","DOI":"10.1007\/978-3-540-30551-4_27"},{"key":"226_CR4_226","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.ipl.2005.08.006","volume":"96","author":"K.-Y. Chen","year":"2005","unstructured":"Chen, K.-Y., Chao, K.-M.: Optimal algorithms for locating the longest and shortest segments satisfying a\u00a0sum or an average constraint. Inf. Process. Lett. 96, 197\u2013201 (2005)","journal-title":"Inf. Process. Lett."},{"key":"226_CR5_226","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.tcs.2006.06.007","volume":"362","author":"C.-H. Cheng","year":"2006","unstructured":"Cheng, C.-H., Chen, K.-Y., Tien, W.-C., Chao, K.-M.: Improved algorithms for the k maximum-sum problems. Proceedings of the 16th International Symposium on Algorithms And Computation. Theoret. Comput. Sci. 362: 162\u2013170 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"226_CR6_226","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/TCBB.2004.43","volume":"1","author":"M. Cs\u0171r\u00f6s","year":"2004","unstructured":"Cs\u0171r\u00f6s, M.: Maximum-scoring segment sets. IEEE\/ACM Trans. Comput. Biol. Bioinform. 1, 139\u2013150 (2004)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"226_CR7_226","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D. Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the k Shortest Paths. SIAM J. Comput. 28, 652\u2013673 (1998)","journal-title":"SIAM J. Comput."},{"key":"226_CR8_226","doi-asserted-by":"crossref","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. Proceedings of the Eighth International Conference on Implementation and Application of Automata. LNCS 2759, 251\u2013257 (2003)","DOI":"10.1007\/3-540-45089-0_23"},{"key":"226_CR9_226","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":"226_CR10_226","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":"226_CR11_226","doi-asserted-by":"crossref","unstructured":"Liu, H.-F., Chao, K.-M.: Algorithms for Finding the Weight-Constrained k Longest Paths in a\u00a0Tree and the Length-Constrained k Maximum-Sum Segments of a\u00a0Sequence. Theoret. Comput. Sci. in revision (2008)","DOI":"10.1016\/j.tcs.2008.06.052"},{"key":"226_CR12_226","unstructured":"Ruzzo, W.L., Tompa, M.: A\u00a0linear time algorithm for finding all maximal scoring subsequences. Proceedings of the 7th International Conference on Intelligent Systems for Molecular Biology, pp. 234\u2013241 (1999)"},{"key":"226_CR13_226","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. Nucleic Acids Res. 19, 3899\u20133910 (1999)","journal-title":"Nucleic Acids Res."},{"key":"226_CR14_226","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":"226_CR15_226","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_226","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:32:27Z","timestamp":1738272747000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_226"}},"subtitle":["2002; Lin, Jiang, Chao"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_226","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}