{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:08:00Z","timestamp":1742378880376},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230182"},{"type":"electronic","value":"9783540302193"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30219-3_27","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T20:42:59Z","timestamp":1285101779000},"page":"314-325","source":"Crossref","is-referenced-by-count":2,"title":["New Algorithms for Multiple DNA Sequence Alignment"],"prefix":"10.1007","author":[{"given":"Daniel G.","family":"Brown","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander K.","family":"Hudek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1101\/gr.1933104","volume":"14","author":"M. Blanchette","year":"2004","unstructured":"Blanchette, M., Kent, W.J., Riemer, C., et al.: Aligning multiple genomic sequences with the threaded blockset aligner. Genome Res.\u00a014, 708\u2013715 (2004)","journal-title":"Genome Res."},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1101\/gr.1960404","volume":"14","author":"N. Bray","year":"2004","unstructured":"Bray, N., Pachter, L.: MAVID: Constrained ancestral alignment of multiple sequences. Genome Res.\u00a014, 693\u2013699 (2004)","journal-title":"Genome Res."},{"key":"27_CR3","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-39763-2_4","volume-title":"Algorithms in Bioinformatics","author":"B. Brejova","year":"2003","unstructured":"Brejova, B., Brown, D., Vinar, T.: Vector seeds: an extension to spaced seeds allows substantial improvements in sensitivity and specificity. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol.\u00a02812, pp. 39\u201354. Springer, Heidelberg (2003)"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1142\/S0219720004000326","volume":"1","author":"B. Brejova","year":"2004","unstructured":"Brejova, B., Brown, D., Vinar, T.: Optimal spaced seeds for homologous coding regions. J. Bioinf. and Comp. Biol.\u00a01, 595\u2013610 (2004)","journal-title":"J. Bioinf. and Comp. Biol."},{"doi-asserted-by":"crossref","unstructured":"Brown, D.: Multiple vector seeds for protein alignment. In: These proceedings","key":"27_CR5","DOI":"10.1007\/978-3-540-30219-3_15"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1186\/1471-2105-4-66","volume":"4","author":"M. Brudno","year":"2003","unstructured":"Brudno, M., Chapman, M., Gottgens, B., Batzoglou, S., Morgenstern, B.: Fast and sensitive multiple alignment of large genomic sequences. BMC Bioinf.\u00a04, 66 (2003)","journal-title":"BMC Bioinf."},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1101\/gr.926603","volume":"13","author":"M. Brudno","year":"2003","unstructured":"Brudno, M., Do, C., Cooper, G., Kim, M., et al.: LAGAN and Multi-LAGAN: Efficient tools for large-scale multiple alignment of genomic DNA. Genome Res.\u00a013, 721\u2013731 (2003)","journal-title":"Genome Res."},{"doi-asserted-by":"crossref","unstructured":"Brudno, M., Morgenstern, B.: Fast and sensitive alignment of large genomic sequences. In: Proceedings of CSB 2002, pp. 138\u2013147 (2002)","key":"27_CR8","DOI":"10.1109\/CSB.2002.1039337"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/0148063","volume":"48","author":"H. Carrillo","year":"1988","unstructured":"Carrillo, H., Lipman, D.: The multiple sequence alignment problem in biology. SIAM J. Appl. Math.\u00a048, 1073\u20131082 (1988)","journal-title":"SIAM J. Appl. Math."},{"doi-asserted-by":"crossref","unstructured":"Eppstein, D., Giancarlo, R., Galil, Z., Italiano, G.F.: Sparse dynamic programming. I: Linear cost functions; II: Convex and concave cost functions. J. ACM\u00a039 (1992)","key":"27_CR10","DOI":"10.1145\/146637.146656"},{"key":"27_CR11","volume-title":"An Introduction to Probability Theory and Its Applications","author":"W. Feller","year":"1957","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications. John Wiley & Sons, New York (1957)"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"406","DOI":"10.2307\/2412116","volume":"20","author":"W.M. Fitch","year":"1971","unstructured":"Fitch, W.M.: Toward defining the course of evolution: minimum change for a specified tree topology. Syst. Zool.\u00a020, 406\u2013416 (1971)","journal-title":"Syst. Zool."},{"key":"27_CR13","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1093\/bioinformatics\/18.suppl_1.S312","volume":"18","author":"M. Hohl","year":"2002","unstructured":"Hohl, M., Kurtz, S., Ohlebusch, E.: Efficient multiple genome alignment. Bioinf.\u00a018, 312\u2013320 (2002)","journal-title":"Bioinf."},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BFb0030790","volume-title":"Combinatorial Pattern Matching","author":"J.D. Kececioglu","year":"1998","unstructured":"Kececioglu, J.D., Zhang, W.: Aligning alignments. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol.\u00a01448, pp. 189\u2013208. Springer, Heidelberg (1998)"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0166-218X(03)00382-2","volume":"138","author":"U. Keich","year":"2004","unstructured":"Keich, U., Li, M., Ma, B., Tromp, J.: On spaced seeds for similarity search. Discrete Appl. Math.\u00a0138, 253\u2013263 (2004)","journal-title":"Discrete Appl. Math."},{"doi-asserted-by":"crossref","unstructured":"Li, M., Ma, B., Kisman, D., Tromp, J.: PatternHunter II: Highly sensitive and fast homology search. J. Bioinf. and Comp. Biol. (2004) (to appear)","key":"27_CR16","DOI":"10.1142\/S0219720004000661"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1093\/bioinformatics\/18.3.440","volume":"18","author":"B. Ma","year":"2002","unstructured":"Ma, B., Tromp, J., Li, M.: PatternHunter: faster and more sensitive homology search. Bioinf.\u00a018, 440\u2013445 (2002)","journal-title":"Bioinf."},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-44888-8_19","volume-title":"Combinatorial Pattern Matching","author":"B. Ma","year":"2003","unstructured":"Ma, B., Wang, Z., Zhang, K.: Alignment between two multiple alignments. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 254\u2013265. Springer, Heidelberg (2003)"},{"key":"27_CR19","doi-asserted-by":"publisher","first-page":"12098","DOI":"10.1073\/pnas.93.22.12098","volume":"93","author":"B. Morgenstern","year":"1996","unstructured":"Morgenstern, B., Dress, A., Werner, T.: Multiple DNA and protein sequence alignment based on segment-to-segment comparison. Proc. Natl. Acad. Sci.\u00a093, 12098\u201312103 (1996)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"4673","DOI":"10.1093\/nar\/22.22.4673","volume":"22","author":"J. Thompson","year":"1994","unstructured":"Thompson, J., Higgins, D., Gibson, T.: CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, positionspecific gap penalties and weight matrix choice. Nucl. Acids Res.\u00a022, 4673\u20134680 (1994)","journal-title":"Nucl. Acids Res."},{"key":"27_CR21","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1089\/106652703322756096","volume":"10","author":"Y. Zhang","year":"2003","unstructured":"Zhang, Y., Waterman, M.: An eulerian path approach to global multiple alignment for DNA sequences. J. Comp. Biol.\u00a010, 803\u2013819 (2003)","journal-title":"J. Comp. Biol."}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30219-3_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:57:24Z","timestamp":1620014244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30219-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230182","9783540302193"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30219-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}