{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:47:31Z","timestamp":1725497251719},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77120-3_72","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:31:09Z","timestamp":1196940669000},"page":"834-845","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis"],"prefix":"10.1007","author":[{"given":"Hsiao-Fei","family":"Liu","sequence":"first","affiliation":[]},{"given":"Peng-An","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Kun-Mao","family":"Chao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"72_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. Aho","year":"1974","unstructured":"Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"issue":"3","key":"72_CR2","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/0110042","volume":"10","author":"R. Bellman","year":"1962","unstructured":"Bellman, R., Karush, W.: Mathematical Programming and the Maximum Transform. Journal of the Society for Industrial and Applied Mathematics\u00a010(3), 550\u2013567 (1962)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"issue":"12","key":"72_CR3","doi-asserted-by":"publisher","first-page":"2281","DOI":"10.1016\/j.patcog.2006.01.008","volume":"39","author":"A. Bergkvist","year":"2006","unstructured":"Bergkvist, A., Damaschke, P.: Fast Algorithms for Finding Disjoint Subsequences with Extremal Densities. Pattern Recognition\u00a039(12), 2281\u20132292 (2006)","journal-title":"Pattern Recognition"},{"doi-asserted-by":"crossref","unstructured":"Bernholt, T., Eisenbrand, F., Hofmeister, T.: A Geometric Framework for Solving Subsequence Problems in Computational Biology Efficiently. In: SoCG, pp. 310\u2013318 (2007)","key":"72_CR4","DOI":"10.1145\/1247069.1247125"},{"key":"72_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/11682462_20","volume-title":"LATIN 2006: Theoretical Informatics","author":"T. Bernholt","year":"2006","unstructured":"Bernholt, T., Hofmeister, T.: An Algorithm for a Generalized Maximum Subsequence Problem. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 178\u2013189. Springer, Heidelberg (2006)"},{"key":"72_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/11841036_17","volume-title":"Algorithms \u2013 ESA 2006","author":"D. Bremner","year":"2006","unstructured":"Bremner, D., Chan, T., Demaine, E., Erickson, J., Hurtado, F., Iacono, J., Langerman, S., Streinu, I., Taslakian, P.: Necklaces, Convolutions, and X+Y. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 160\u2013171. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Chan, T.M.: More Algorithms for All-Pairs Shortest Paths in Weighted Graphs. In: STOC (to appear, 2007)","key":"72_CR7","DOI":"10.1145\/1250790.1250877"},{"issue":"2","key":"72_CR8","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(2), 373\u2013387 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"72_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Heidelberg (2000)","edition":"2"},{"key":"72_CR10","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)"},{"unstructured":"Felzenszwalb, P., Huttenlocher, D.: Distance Transforms of Sampled Functions. Technical Report TR2004-1963, Cornell Computing and Information Science (2004)","key":"72_CR11"},{"key":"72_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1038\/nrg1767","volume":"7","author":"L. Feuk","year":"2006","unstructured":"Feuk, L., Carson, A.R., Scherer, S.W.: Structural variation in the human genome. Nature Reviews Genetics\u00a07, 85\u201397 (2006)","journal-title":"Nature Reviews Genetics"},{"issue":"2","key":"72_CR13","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.jcss.2004.08.001","volume":"70","author":"M. Goldwasser","year":"2005","unstructured":"Goldwasser, M., 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(2), 128\u2013144 (2005)","journal-title":"Journal of Computer and System Sciences"},{"key":"72_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/11841036_38","volume-title":"Algorithms \u2013 ESA 2006","author":"Y. Han","year":"2006","unstructured":"Han, Y.: An O(n 3 (loglogn\/ logn)5\/4 ) Time Algorithm for All Pairs Shortest Path. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 411\u2013417. Springer, Heidelberg (2006)"},{"unstructured":"Hogg, R.V., Tanis, E.A.: Probability and Statistical Inference, 7th edn. (2005)","key":"72_CR15"},{"issue":"3","key":"72_CR16","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(3), 219\u2013225 (1994)","journal-title":"Computer Applications in the Biosciences"},{"issue":"9","key":"72_CR17","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1038\/ng1416","volume":"36","author":"A.J. Iafrate","year":"2004","unstructured":"Iafrate, A J., Feuk, L., Rivera, M.N., Listewnik, M.L, Donahoe, P.K, Qi, Y., Scherer, S.W, Lee, C.: Detection of Large-Scale Variation in the Human Genome. Nature Genetics\u00a036(9), 949\u2013951 (2004)","journal-title":"Nature Genetics"},{"issue":"6","key":"72_CR18","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(6), 339\u2013342 (2003)","journal-title":"Information Processing Letters"},{"issue":"12","key":"72_CR19","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.1101\/gr.5629106","volume":"16","author":"D. Komura","year":"2006","unstructured":"Komura, D., Shen, F., Ishikawa, S., Fitch, K.R., Chen, W., Zhang, J., Liu, G., Ihara, S., Nakamura, H., Hurles, M.E., et al.: Genome-wide Detection of Human Copy Number Variations Using High-Density DNA Oligonucleotide Arrays. Genome Research\u00a016(12), 1575\u20131584 (2006)","journal-title":"Genome Research"},{"issue":"3","key":"72_CR20","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"},{"key":"72_CR21","series-title":"Lecture Notes in Bioinformatics","first-page":"83","volume-title":"Comparative Genomics","author":"D. Lipson","year":"2005","unstructured":"Lipson, D., Aumann, Y., Ben-Dor, A., Linial, N., Yakhini, Z.: Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. In: McLysaght, A., Huson, D.H. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a03678, pp. 83\u2013100. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Maragos, P.: Differential Morphology. Nonlinear Image Processing, 289\u2013329 (2000)","key":"72_CR22","DOI":"10.1016\/B978-012500451-0\/50010-2"},{"key":"72_CR23","first-page":"109","volume":"49","author":"J.-J. Moreau","year":"1970","unstructured":"Moreau, J.-J.: Inf-Convolution, Sous-Additivit\u00e9, Convexit\u00e9 Des Fonctions Num\u00e9riques. Journal de Math\u00e9matiques Pures et Appliqu\u00e9es\u00a049, 109\u2013154 (1970)","journal-title":"Journal de Math\u00e9matiques Pures et Appliqu\u00e9es"},{"issue":"2","key":"72_CR24","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1038\/2524","volume":"20","author":"D. Pinkel","year":"1998","unstructured":"Pinkel, D., Segraves, R., Sudar, D., Clark, S., Poole, I., Kowbel, D., Collins, C., Kuo, W.-L., Chen, C., Zhai, Y., et al.: High Resolution Analysis of DNA Copy Number Variation Using Comparative Genomic Hybridization to Microarrays. Nature Genetics\u00a020(2), 207\u2013211 (1998)","journal-title":"Nature Genetics"},{"issue":"1","key":"72_CR25","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1038\/12640","volume":"23","author":"J.R. Pollack","year":"1999","unstructured":"Pollack, J.R., Perou, C.M., Alizadeh, A.A., Eisen, M.B., Pergamenschikov, A., Williams, C.F., Jeffrey, S.S., Botstein, D., Brown, P.O.: Genome-wide analysis of DNA copy-number changes using cDNA microarrays. Nature Genetics\u00a023(1), 41\u201346 (1999)","journal-title":"Nature Genetics"},{"key":"72_CR26","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1038\/nature05329","volume":"444","author":"R. Redon","year":"2006","unstructured":"Redon, R., Ishikawa, S., Fitch, K.R., Feuk, L., Perry, G.H., Andrews, T.D., Fiegler, H., Shapero, M.H., Carson, A.R., Chen, W.: Global Variation in Copy Number in the Human Genome. Nature\u00a0444, 444\u2013454 (2006)","journal-title":"Nature"},{"doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Convex Analysis (1970)","key":"72_CR27","DOI":"10.1515\/9781400873173"},{"issue":"23","key":"72_CR28","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1126\/science.1098918","volume":"305","author":"J. Sebat","year":"2004","unstructured":"Sebat, J., Lakshmi, B., Troge, J., Alexander, J., Young, J., Lundin, P., M\u00e5ner, S., Massa, H., Walker, M., Chi, M., et al.: Large-Scale Copy Number Polymorphism in the Human Genome. Science\u00a0305(23), 525\u2013528 (2004)","journal-title":"Science"},{"key":"72_CR29","first-page":"58","volume":"352","author":"T. Str\u00f6mberg","year":"1996","unstructured":"Str\u00f6mberg, T.: The Operation of Infimal Convolution. Dissertationes Mathematicae\u00a0352, 58 (1996)","journal-title":"Dissertationes Mathematicae"},{"key":"72_CR30","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S1571-0661(04)00313-5","volume":"61","author":"T. Takaoka","year":"2002","unstructured":"Takaoka, T.: Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication. Electronic Notes in Theoretical Computer Science\u00a061, 191\u2013200 (2002)","journal-title":"Electronic Notes in Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77120-3_72.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:01:27Z","timestamp":1619521287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77120-3_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771180"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77120-3_72","relation":{},"subject":[]}}