{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:06:20Z","timestamp":1773270380308,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319075655","type":"print"},{"value":"9783319075662","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07566-2_23","type":"book-chapter","created":{"date-parts":[[2014,6,12]],"date-time":"2014-06-12T03:50:31Z","timestamp":1402545031000},"page":"222-231","source":"Crossref","is-referenced-by-count":11,"title":["Approximate String Matching Using a Bidirectional Index"],"prefix":"10.1007","author":[{"given":"Gregory","family":"Kucherov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamil","family":"Salikhov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dekel","family":"Tsur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-40450-4_12","volume-title":"Algorithms \u2013 ESA 2013","author":"D. Belazzougui","year":"2013","unstructured":"Belazzougui, D., Cunial, F., K\u00e4rkk\u00e4inen, J., M\u00e4kinen, V.: Versatile succinct representations of the bidirectional burrows-wheeler transform. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol.\u00a08125, pp. 133\u2013144. Springer, Heidelberg (2013)"},{"key":"23_CR2","unstructured":"Burrow, M., Wheeler, D.: A block-sorting lossless data compression algorithm. Technical report 124, Digital Equipment Corporation, California (1994)"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Chen, L.H.Y.: Poisson approximation for dependent trials. The Annals of Probability, 534\u2013545 (1975)","DOI":"10.1214\/aop\/1176996359"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proc. 41st Symposium on Foundation of Computer Science (FOCS), pp. 390\u2013398 (2000)","DOI":"10.1109\/SFCS.2000.892127"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Lam, T.W., Li, R., Tam, A., Wong, S.C.K., Wu, E., Yiu, S.-M.: High throughput short read alignment via bi-directional BWT. In: Proc. IEEE International Conference on Bioinformatics and Biomedicine (BIBM), pp. 31\u201336 (2009)","DOI":"10.1109\/BIBM.2009.42"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11602613_35","volume-title":"Algorithms and Computation","author":"T.-W. Lam","year":"2005","unstructured":"Lam, T.-W., Sung, W.-K., Wong, S.-S.: Improved approximate string matching using compressed suffix data structures. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 339\u2013348. Springer, Heidelberg (2005)"},{"issue":"3","key":"23_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1186\/gb-2009-10-3-r25","volume":"10","author":"B. Langmead","year":"2009","unstructured":"Langmead, B., Trapnell, C., Pop, M., Salzberg, S.: Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biology\u00a010(3), R25 (2009)","journal-title":"Genome Biology"},{"issue":"14","key":"23_CR8","doi-asserted-by":"publisher","first-page":"1754","DOI":"10.1093\/bioinformatics\/btp324","volume":"25","author":"H. Li","year":"2009","unstructured":"Li, H., Durbin, R.: Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics\u00a025(14), 1754\u20131760 (2009)","journal-title":"Bioinformatics"},{"issue":"5","key":"23_CR9","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1093\/bib\/bbq015","volume":"11","author":"H. Li","year":"2010","unstructured":"Li, H., Homer, N.: A survey of sequence alignment algorithms for next-generation sequencing. Briefings in Bioinformatics\u00a011(5), 473\u2013483 (2010)","journal-title":"Briefings in Bioinformatics"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Computing Surveys\u00a039(1) (2007)","DOI":"10.1145\/1216370.1216372"},{"issue":"3","key":"23_CR11","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.3390\/a2031105","volume":"2","author":"L.M.S. Russo","year":"2009","unstructured":"Russo, L.M.S., Navarro, G., Oliveira, A.L., Morales, P.: Approximate string matching with compressed indexes. Algorithms\u00a02(3), 1105\u20131136 (2009)","journal-title":"Algorithms"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ic.2011.03.007","volume":"213","author":"T. Schnattinger","year":"2012","unstructured":"Schnattinger, T., Ohlebusch, E., Gog, S.: Bidirectional search in a string with wavelet trees and bidirectional matching statistics. Information and Computation\u00a0213, 13\u201322 (2012)","journal-title":"Information and Computation"},{"issue":"3","key":"23_CR13","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1101\/gr.126953.111","volume":"22","author":"J.T. Simpson","year":"2012","unstructured":"Simpson, J.T., Durbin, R.: Efficient de novo assembly of large genomes using compressed data structures. Genome Research\u00a022(3), 549\u2013556 (2012)","journal-title":"Genome Research"},{"key":"23_CR14","first-page":"1","volume-title":"Encyclopedia of Algorithms","author":"W.-K. Sung","year":"2008","unstructured":"Sung, W.-K.: Indexed approximate string matching. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 1\u201399. Springer, US (2008)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07566-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:38:48Z","timestamp":1746265128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07566-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075655","9783319075662"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07566-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}