{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:10:34Z","timestamp":1725567034903},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_13","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:34:13Z","timestamp":1127813653000},"page":"104-114","source":"Crossref","is-referenced-by-count":5,"title":["Rapid Homology Search with Two-Stage Extension and Daughter Seeds"],"prefix":"10.1007","author":[{"given":"Mikl\u00f3s","family":"Cs\u0171r\u00f6s","sequence":"first","affiliation":[]},{"given":"Bin","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1146\/annurev.genom.5.061903.180057","volume":"5","author":"W. Miller","year":"2004","unstructured":"Miller, W., Makova, K.D., Nekrutenko, A., Hardison, R.C.: Comparative genomics. Annu. Rev. Genomics Hum. Genet.\u00a05, 15\u201356 (2004)","journal-title":"Annu. Rev. Genomics Hum. Genet."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1101\/gr.222003","volume":"13","author":"K.A. Frazer","year":"2003","unstructured":"Frazer, K.A., Elnitski, L., Church, D.M., Dubchak, I., Hardison, R.C.: Crossspecies sequence comparisons. Genome Res.\u00a013, 1\u201312 (2003)","journal-title":"Genome Res."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T.F. Smith","year":"1981","unstructured":"Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. J. Mol. Biol.\u00a0147, 195\u2013197 (1981)","journal-title":"J. Mol. Biol."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1016\/0022-2836(82)90398-9","volume":"162","author":"O. Gotoh","year":"1982","unstructured":"Gotoh, O.: An improved algorithm for matching biological sequences. J. Mol. Biol.\u00a0162, 708\u2013708 (1982)","journal-title":"J. Mol. Biol."},{"key":"13_CR5","unstructured":"Crochemore, M., Landau, G.M., Ziv-Ukelson, M.: A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. In: Proc. SODA, pp. 679\u2013688 (2002)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"2444","DOI":"10.1073\/pnas.85.8.2444","volume":"85","author":"W.R. Pearson","year":"1988","unstructured":"Pearson, W.R., Lipman, D.J.: Improved tools for biological sequence comparison. Proc. Natl. Acad. Sci. USA\u00a085, 2444\u20132448 (1988)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S.F. Altschul","year":"1990","unstructured":"Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. J. Mol. Biol.\u00a0215, 403\u2013410 (1990)","journal-title":"J. Mol. Biol."},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"3389","DOI":"10.1093\/nar\/25.17.3389","volume":"25","author":"S.F. Altschul","year":"1997","unstructured":"Altschul, S.F., et al.: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res.\u00a025, 3389\u20133402 (1997)","journal-title":"Nucleic Acids Res."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1101\/gr.809403","volume":"13","author":"S. Schwartz","year":"2003","unstructured":"Schwartz, S., et al.: Human-mouse alignments with BLASTZ. Genome Res.\u00a013, 103\u2013107 (2003)","journal-title":"Genome Res."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1101\/gr.194201","volume":"11","author":"Z. Ning","year":"2001","unstructured":"Ning, Z., Cox, A.J., Mullikin, J.C.: SSAHA: A fast search method for large DNA databases. Genome Res.\u00a011, 1725\u20131729 (2001)","journal-title":"Genome Res."},{"key":"13_CR11","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. Bioinformatics\u00a018, 440\u2013445 (2002)","journal-title":"Bioinformatics"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1142\/S0219720004000661","volume":"2","author":"M. Li","year":"2004","unstructured":"Li, M., Ma, B., Kisman, D., Tromp, J.: PatternHunter II: highly sensitive and fast homology search. J. Bioinform. Comput. Biol.\u00a02, 411\u2013439 (2004)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Kurtz, S., et al.: Versatile and open software for comparing large genomes. Genome Biol.\u00a05, R12 (2004)","DOI":"10.1186\/gb-2004-5-2-r12"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.jcss.2004.12.003","volume":"70","author":"J. Buhler","year":"2005","unstructured":"Buhler, J., Keich, U., Sun, Y.: Designing seeds for similarity search in genomic DNA. J. Comp. Syst. Sci.\u00a070, 342\u2013363 (2005)","journal-title":"J. Comp. Syst. Sci."},{"key":"13_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."},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1142\/S0219720004000983","volume":"2","author":"D.G. Brown","year":"2004","unstructured":"Brown, D.G., Li, M., Ma, B.: A tutorial of recent developments in the seeding of local alignment. J. Bioinform. Comput. Biol.\u00a02, 819\u2013842 (2004)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Sun, Y., Buhler, J.: Designing multiple simultaneous seeds for DNA similarity search. In: Proc. RECOMB, pp. 76\u201384 (2004)","DOI":"10.1145\/974614.974625"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/j.jcss.2004.12.008","volume":"70","author":"B. Brejov\u00e1","year":"2005","unstructured":"Brejov\u00e1, B., Brown, D., Vina\u0159, T.: Vector seeds: An extension to spaced seeds. J. Comp. Syst. Sci.\u00a070, 364\u2013380 (2005)","journal-title":"J. Comp. Syst. Sci."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Kucherov, G., No\u00e9, L., Ponty, Y.: Estimating seed sensitivity on homogeneous alignments. In: Proc. BIBE, pp. 387\u2013394 (2004)","DOI":"10.1109\/BIBE.2004.1317369"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In: Proc. STOC, pp. 397\u2013406 (2000)","DOI":"10.1145\/335305.335351"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proc. FOCS, pp. 390\u2013398 (2000)","DOI":"10.1109\/SFCS.2000.892127"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-540-27801-6_32","volume-title":"Combinatorial Pattern Matching","author":"V. M\u00e4kinen","year":"2004","unstructured":"M\u00e4kinen, V., Navarro, G.: Compressed compact suffix arrays. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 421\u2013433. Springer, Heidelberg (2004)"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/TIT.1966.1053907","volume":"12","author":"S.W. Golomb","year":"1966","unstructured":"Golomb, S.W.: Run-length encodings. IEEE Trans. Inform. Theory\u00a012, 399\u2013401 (1966)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-45452-7_13","volume-title":"Combinatorial Pattern Matching","author":"W.K. Hon","year":"2002","unstructured":"Hon, W.K., Sadakane, K.: Space-economical algorithms for finding maximal unique matches. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol.\u00a02373, p. 144. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T22:50:17Z","timestamp":1553554217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11533719_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}