{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:27:44Z","timestamp":1725492464702},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442110"},{"type":"electronic","value":"9783540457848"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45784-4_10","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T10:33:38Z","timestamp":1192530818000},"page":"126-139","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Segment Match Refinement and Applications"],"prefix":"10.1007","author":[{"given":"Aaron L.","family":"Halpern","sequence":"first","affiliation":[]},{"given":"Daniel H.","family":"Huson","sequence":"additional","affiliation":[]},{"given":"Knut","family":"Reinert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1007\/BF02462328","volume":"48","author":"S. F. Altschul","year":"1986","unstructured":"S. F. Altschul and B. W. Erickson. Locally optimal subalignments using nonlinear similarity functions. Bull. Math. Biol., 48:633\u2013660, 1986.","journal-title":"Bull. Math. Biol."},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S. F. Altschul","year":"1990","unstructured":"S. F. Altschul, W. Gish, W. Miller, E. W. Myers, and D. J. Lipman. Basic local alignment search tool. Journal of Molecular Biology, 215:403\u2013410, 1990.","journal-title":"Journal of Molecular Biology"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1101\/gr.10.7.950","volume":"10","author":"S. Batzoglou","year":"2000","unstructured":"S. Batzoglou, L. Pachter, J. P. Mesirov, B. Berger, and E. S. Lander. Human and mouse gene structure: Comparative analysis and application to exon prediction. Genome Research, 10:950\u2013958, 2000.","journal-title":"Genome Research"},{"issue":"11","key":"10_CR4","doi-asserted-by":"publisher","first-page":"2369","DOI":"10.1093\/nar\/27.11.2369","volume":"27","author":"A. L. Delcher","year":"1999","unstructured":"A. L. Delcher, S. Kasif, R. D. Fleischmann, J. Peterson, O. White, and S. L. Salzberg. Alignment of whole genomes. Nucleic Acids Research, 27(11):2369\u20132376, 1999.","journal-title":"Nucleic Acids Research"},{"key":"10_CR5","unstructured":"Delcher, A. and others. unpublished."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"G. Jacobson and K.-P. Vo. Heaviest increasing\/common subsequence problems. In Proceedings 3rd Annual Symposium on Combinatorial pattern matching (CPM), pages 52\u201366, 1992.","DOI":"10.1007\/3-540-56024-6_5"},{"key":"10_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/BFb0029800","volume-title":"The maximum weight trace problem in multiple sequence alignment","author":"J. D. Kececioglu","year":"1993","unstructured":"J. D. Kececioglu. The maximum weight trace problem in multiple sequence alignment. In Proc. 4-th Symp. Combinatorial Pattern Matching, number 684 in Lecture Notes in Computer Science, pages 106\u2013119. Springer-Verlag, 1993."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0166-218X(00)00194-3","volume":"104","author":"J. D. Kececioglu","year":"2000","unstructured":"J. D. Kececioglu, H.-P. Lenhof, K. Mehlhorn, P. Mutzel, K. Reinert, and M. Vingron. A polyhedral approach to sequence alignment problems. Discrete Applied Mathematics, 104:143\u2013186, 2000.","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"10_CR9","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1093\/bioinformatics\/15.5.426","volume":"15","author":"S. Kurtz","year":"1999","unstructured":"S. Kurtz and C. Schleiermacher. REPuter: fast computation of maximal repeats in complete genomes. Bioinformatics, 15(5):426\u2013427, 1999.","journal-title":"Bioinformatics"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"G. S. Luecker. A data structure for orthogonal range queries. Proc. 19th IEEE Symposium on Foundations of Computer Science, pages 28\u201334, 1978.","DOI":"10.1109\/SFCS.1978.1"},{"key":"10_CR11","unstructured":"B. Morgenstern, W. R. Atchley, K. Hahn, and A. Dress. Segment-based scores for pairwise and multiple sequence alignments. In Proceedings of the Sixth International Conference on Intelligent Systems for Molecular Biology (ISMB-98), 1998."},{"issue":"7","key":"10_CR12","doi-asserted-by":"crossref","first-page":"4145","DOI":"10.1073\/pnas.092136699","volume":"99","author":"E. W. Myers","year":"2002","unstructured":"E. W. Myers, G. G. Sutton, H. O. Smith, M. D. Adams, and J. C. Venter. On the sequencing and assembly of the human genome. Proc Natl Acad Sci U S A, 99(7):4145\u20134146, 2002.","journal-title":"Proc Natl Acad Sci U S A"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/aama.1993.1008","volume":"14","author":"P. A. Pevzner","year":"1993","unstructured":"P. A. Pevzner and M. S. Waterman. Generalized sequence alignment and duality. Advances in Applied Mathematics, 14:139\u2013171, 1993.","journal-title":"Advances in Applied Mathematics"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1101\/gr.10.4.577","volume":"10","author":"S. Schwartz","year":"2000","unstructured":"S. Schwartz, Z. Zhang, K. A. Frazer, A. Smit, C. Riemer, J. Bouck, R. Gibbs, R. Hardison, and W. Miller. PipMaker-a web server for aligning two genomic dna sequences. Genome Research, 10:577\u2013586, 2000.","journal-title":"Genome Research"},{"issue":"3","key":"10_CR15","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1093\/bioinformatics\/15.3.194","volume":"15","author":"J.-S. Varr\u00e9","year":"1999","unstructured":"J.-S. Varr\u00e9, J.-P. Delahaye, and E. Rivals. Transformation distances: a family of dissimilarity measures based on movements of segments. Bioinformatics, 15(3):194\u2013202, 1999.","journal-title":"Bioinformatics"},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1137\/0144038","volume":"44","author":"W. J. Wilbur","year":"1984","unstructured":"W. J. Wilbur and D. J. Lipman. The context dependent comparison of biological sequences. SIAM J. Applied Mathematics, 44(3):557\u2013567, 1984.","journal-title":"SIAM J. Applied Mathematics"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"D. E. Willard. New data structures for orthogonal queries. SIAM Journal of Computing, pages 232\u2013253, 1985.","DOI":"10.1137\/0214019"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45784-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:51:48Z","timestamp":1558263108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45784-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442110","9783540457848"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45784-4_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"10 October 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}