{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:40:27Z","timestamp":1737290427928,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422426"},{"type":"electronic","value":"9783540457275"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45727-5_1","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:25:28Z","timestamp":1184603128000},"page":"1-11","source":"Crossref","is-referenced-by-count":8,"title":["Speeding Up the DIALIGN Multiple Alignment Program by Using the \u2018Greedy Alignment of BIOlogical Sequences LIBrary\u2019 (GABIOS-LIB)"],"prefix":"10.1007","author":[{"given":"Sa\u00efd","family":"Abdedda\u00efm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burkhard","family":"Morgenstern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,28]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"S. Abdedda\u00efm. Fast and sound two-step algorithms for multiple alignment of nucleic sequences. In Proceedings of the IEEE International Joint Symposia on Intelligence and Systems, pages 4\u201311, 1996.","DOI":"10.1109\/IJSIS.1996.565044"},{"key":"1_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/3-540-63220-4_58","volume-title":"Proc. of 8-th Annual Symposium on Combinatorial Pattern Matching","author":"S. Abdedda\u00efm","year":"1997","unstructured":"S. Abdedda\u00efm. Incremental computation of transitive closure and greedy alignment. In Proc. of 8-th Annual Symposium on Combinatorial Pattern Matching, volume 1264 of Lecture Notes in Computer Science, pages 167\u2013179, 1997."},{"key":"1_CR3","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. M. Myers, and D. J. Lipman. Basic local alignment search tool. J. Mol. Biol., 215:403\u2013410, 1990.","journal-title":"J. Mol. Biol."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BF01188583","volume":"13","author":"K.-M. Chao","year":"1995","unstructured":"K.-M. Chao and W. Miller. Linear-space algorithms that build local alignments from fragments. Algorithmica, 13:106\u2013134, 1995.","journal-title":"Algorithmica"},{"key":"1_CR5","first-page":"249","volume":"13","author":"E. Depiereux","year":"1997","unstructured":"E. Depiereux, G. Baudoux, P. Briffeuil, I. Reginster, X. D. Boll, C. Vinals, and E. Feytmans. Match-Box server: a multiple sequence alignment tool placing emphasis on reliability. CABIOS, 13:249\u2013256, 1997.","journal-title":"CABIOS"},{"key":"1_CR6","first-page":"501","volume":"8","author":"E. Depiereux","year":"1992","unstructured":"E. Depiereux and E. Feytmans. Match-box: a fundamentally new algorithm for the simultaneous alignment of several protein sequences. CABIOS, 8:501\u2013509, 1992.","journal-title":"CABIOS"},{"key":"1_CR7","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1145\/146637.146650","volume":"39","author":"D. Eppstein","year":"1992","unstructured":"D. Eppstein, Z. Galil, R. Giancarlo, and G. Italiano. Sparse dynamic programming I: Linear cost functions. J. Assoc. Comput. Mach., 39:519\u2013545, 1992.","journal-title":"J. Assoc. Comput. Mach."},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/0022-2836(82)90398-9","volume":"162","author":"O. Gotoh","year":"1982","unstructured":"O. Gotoh. An improved algorithm for matching biological sequences. J. Mol. Biol., 162:705\u2013708, 1982.","journal-title":"J. Mol. Biol."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1006\/jmbi.1996.0679","volume":"264","author":"O. Gotoh","year":"1996","unstructured":"O. Gotoh. Significant improvement in accuracy of multiple protein sequence alignments by iterative refinement as assessed by reference to structural alignments. J. Mol. Biol., 264:823\u2013838, 1996.","journal-title":"J. Mol. Biol."},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1038\/72635","volume":"18","author":"B. G\u00f6ttgens","year":"2000","unstructured":"B. G\u00f6ttgens, L. Barton, J. Gilbert, A. Bench, M. Sanchez, S. Bahn, S. Mistry, D. Grafham, A. McMurray, M. Vaudin, E. Amaya, D. Bentley, and A. Green. Analysis of vertebrate scl loci identifies conserved enhancers. Nature Biotechnology, 18:181\u2013186, 2000.","journal-title":"Nature Biotechnology"},{"key":"1_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/3-540-55706-7_29","volume-title":"Determining DNA sequence similarity using maximum independent set algorithms for interval graphs","author":"D. Joseph","year":"1992","unstructured":"D. Joseph, J. Meidanis, and P. Tiwari. Determining DNA sequence similarity using maximum independent set algorithms for interval graphs. Lecture Notes in Computer Science, 621:326\u2013337, 1992."},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1093\/bioinformatics\/15.3.262","volume":"15","author":"A. Krause","year":"1999","unstructured":"A. Krause, P. Nicod\u00e8me, E. Bornberg-Bauer, M. Rehmsmeier, and M. Vingron. Www access to the systers protein sequence cluster set. Bioinformatics, 15:262\u2013263, 1999.","journal-title":"Bioinformatics"},{"issue":"5131","key":"1_CR13","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1126\/science.8211139","volume":"262","author":"C. E. Lawrence","year":"1993","unstructured":"C. E. Lawrence, S. F. Altschul, M. S. Boguski, J. S. Liu, A. F. Neuwald, and J. C. Wootton. Detecting subtle sequence signals: a gibbs sampling strategy for multiple alignment. Science, 262(5131):208\u20134, 1993.","journal-title":"Science"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1038\/72588","volume":"18","author":"W. Miller","year":"2000","unstructured":"W. Miller. So many genomes, so little time. Nature Biotechnology, 18:148\u2013149, 2000.","journal-title":"Nature Biotechnology"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1093\/bioinformatics\/15.3.211","volume":"15","author":"B. Morgenstern","year":"1999","unstructured":"B. Morgenstern. DIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment. Bioinformatics, 15:211\u2013218, 1999.","journal-title":"Bioinformatics"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"B. Morgenstern. A space-efficient algorithm for aligning large genomic sequences. Bioinformatics, in press.","DOI":"10.1093\/bioinformatics\/16.10.948"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"12098","DOI":"10.1073\/pnas.93.22.12098","volume":"93","author":"B. Morgenstern","year":"1996","unstructured":"B. Morgenstern, A. W. M. Dress, and T. Werner. Multiple DNA and protein sequence alignment based on segment-to-segment comparison. Proc. Natl. Acad. Sci. USA, 93:12098\u201312103, 1996.","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1093\/bioinformatics\/14.3.290","volume":"14","author":"B. Morgenstern","year":"1998","unstructured":"B. Morgenstern, K. Frech, A. W. M. Dress, and T. Werner. DIALIGN: finding local similarities by multiple sequence alignment. Bioinformatics, 14:290\u2013294, 1998.","journal-title":"Bioinformatics"},{"key":"1_CR19","unstructured":"B. Morgenstern, K. Hahn, W. R. Atchley, and A. W. M. Dress. Segment-based scores for pairwise and multiple sequence alignments. In J. Glasgow, T. Littlejohn, F. Major, R. Lathrop, D. Sankoff, and C. Sensen, editors, Proceedings of the Sixth International Conference on Intelligent Systems for Molecular Biology, pages 115\u2013121, Menlo Parc, CA, 1998. AAAI Press."},{"key":"1_CR20","unstructured":"B. Morgenstern, J. Stoye, and A. W. M. Dress. Consistent equivalence relations: a set-theoretical framework for multiple sequence alignment. Materialien und Preprints 133, University of Bielefeld, 1999."},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S. B. Needleman","year":"1970","unstructured":"S. B. Needleman and C. D. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol., 48:443\u2013453, 1970.","journal-title":"J. Mol. Biol."},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1093\/nar\/24.8.1515","volume":"24","author":"C. Notredame","year":"1996","unstructured":"C. Notredame and D. Higgins. SAGA: sequence alignment by genetic algorithm. Nucleic Acids Research, 24:1515\u20131524, 1996.","journal-title":"Nucleic Acids Research"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"2444","DOI":"10.1073\/pnas.85.8.2444","volume":"85","author":"W. R. Pearson","year":"1988","unstructured":"W. R. Pearson and D. J. Lipman. Improved tools for biological sequence comparison. Proc. Nat. Acad. Sci. USA, 85:2444\u20132448, 1988.","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1016\/0196-8858(81)90046-4","volume":"2","author":"T. F. Smith","year":"1981","unstructured":"T. F. Smith and M. S. Waterman. Comparison of biosequences. Advances in Applied Mathematics, 2:482\u2013489, 1981.","journal-title":"Advances in Applied Mathematics"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"GC45","DOI":"10.1016\/S0378-1119(98)00097-3","volume":"211","author":"J. Stoye","year":"1998","unstructured":"J. Stoye. Multiple sequence alignment with the divide-and-conquer method. Gene, 211:GC45\u2013GC56, 1998.","journal-title":"Gene"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"4673","DOI":"10.1093\/nar\/22.22.4673","volume":"22","author":"J. D. Thompson","year":"1994","unstructured":"J. D. Thompson, D. G. Higgins, and T. J. Gibson. CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Research, 22:4673\u20134680, 1994.","journal-title":"Nucleic Acids Research"},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1093\/bioinformatics\/15.1.87","volume":"15","author":"J. D. Thompson","year":"1999","unstructured":"J. D. Thompson, F. Plewniak, and O. Poch. BAliBASE: A benchmark alignment database for the evaluation of multiple sequence alignment programs. Bioinformatics, 15:87\u201388, 1999.","journal-title":"Bioinformatics"},{"key":"1_CR28","doi-asserted-by":"crossref","first-page":"2682","DOI":"10.1093\/nar\/27.13.2682","volume":"27","author":"J. D. Thompson","year":"1999","unstructured":"J. D. Thompson, F. Plewniak, and O. Poch. A comprehensive comparison of protein sequence alignment programs. Nucleic Acids Research, 27:2682\u20132690, 1999.","journal-title":"Nucleic Acids Research"},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"2919","DOI":"10.1093\/nar\/28.15.2919","volume":"28","author":"J. D. Thompson","year":"2000","unstructured":"J. D. Thompson, F. Plewniak, J.-C. Thierry, and O. Poch. DbClustal: rapid and reliable global multiple alignments of protein sequences detected by database searches. Nucleic Acids Research, 28:2919\u20132926, 2000.","journal-title":"Nucleic Acids Research"},{"issue":"1","key":"1_CR30","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0022-2836(91)90871-3","volume":"218","author":"M. Vingron","year":"1991","unstructured":"M. Vingron and P. Argos. Motif recognition and alignment for many sequences by comparison of dot-matrices. J Mol Biol, 218(1):33\u201343, 1991.","journal-title":"J Mol Biol"},{"key":"1_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/aama.1995.1001","volume":"16","author":"M. Vingron","year":"1995","unstructured":"M. Vingron and P. Pevzner. Multiple sequence comparison and consistency on multipartite graphs. Advances in Applied Mathematics, 16:1\u201322, 1995.","journal-title":"Advances in Applied Mathematics"},{"key":"1_CR32","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1137\/0144038","volume":"44","author":"J. W. Wilbur","year":"1984","unstructured":"J. W. Wilbur and D. J. Lipman. The context dependent comparison of biological sequences. SIAM J. Appl. Math., 44:557\u2013567, 1984.","journal-title":"SIAM J. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Computational Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45727-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T11:58:07Z","timestamp":1737287887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45727-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422426","9783540457275"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-45727-5_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}