{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T22:16:40Z","timestamp":1762899400289,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319569697"},{"type":"electronic","value":"9783319569703"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-56970-3_12","type":"book-chapter","created":{"date-parts":[[2017,4,11]],"date-time":"2017-04-11T00:43:49Z","timestamp":1491871429000},"page":"190-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["EPR-Dictionaries: A Practical and Fast Data Structure for Constant Time Searches in Unidirectional and Bidirectional FM Indices"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Pockrandt","sequence":"first","affiliation":[]},{"given":"Marcel","family":"Ehrhardt","sequence":"additional","affiliation":[]},{"given":"Knut","family":"Reinert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,12]]},"reference":[{"key":"12_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. 8125, pp. 133\u2013144. Springer, Heidelberg (2013). doi:\n                    10.1007\/978-3-642-40450-4_12"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/2629339","volume":"11","author":"D Belazzougui","year":"2015","unstructured":"Belazzougui, D., Navarro, G.: Optimal lower and upper bounds for representing sequences. ACM Trans. Algorithms 11, 31 (2015)","journal-title":"ACM Trans. Algorithms"},{"key":"12_CR3","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical report (1994)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1186\/1471-2105-9-11","volume":"9","author":"A D\u00f6ring","year":"2008","unstructured":"D\u00f6ring, A., Weese, D., Rausch, T., Reinert, K.: SeqAn an efficient, generic C++ library for sequence analysis. BMC Bioinform. 9, 11 (2008). \n                    https:\/\/doi.org\/10.1186\/1471-2105-9-11","journal-title":"BMC Bioinform."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Annual Symposium on Foundations of Computer Science (2000). \n                    https:\/\/doi.org\/10.1109\/SFCS.2000.892127","DOI":"10.1109\/SFCS.2000.892127"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/1240233.1240243","volume":"3","author":"P Ferragina","year":"2007","unstructured":"Ferragina, P., Manzini, G., M\u00e4kinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Trans. Algorithms (TALG) 3, 20 (2007)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-319-07959-2_28","volume-title":"Experimental Algorithms","author":"S Gog","year":"2014","unstructured":"Gog, S., Beller, T., Moffat, A., Petri, M.: From theory to practice: plug and play with succinct data structures. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 326\u2013337. Springer, Cham (2014). doi:\n                    10.1007\/978-3-319-07959-2_28"},{"key":"12_CR8","unstructured":"Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2003)"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"i349","DOI":"10.1093\/bioinformatics\/btu439","volume":"30","author":"H Hauswedell","year":"2014","unstructured":"Hauswedell, H., Singer, J., Reinert, K.: Lambda: the local aligner for massive biological data. Bioinformatics (Oxford, England) 30, i349\u2013i355 (2014). \n                    https:\/\/doi.org\/10.1093\/bioinformatics\/btu439","journal-title":"Bioinformatics (Oxford, England)"},{"key":"12_CR10","unstructured":"Jacobson, G.J.: Succinct static data structures (1988)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Lam, T., Li, R., Tam, A., Wong, S., Wu, E.: High throughput short read alignment via bi-directional BWT. In: Proceedings of BIBM, pp. 31\u201336 (2009). \n                    https:\/\/doi.org\/10.1109\/BIBM.2009.42","DOI":"10.1109\/BIBM.2009.42"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1093\/bioinformatics\/btn032","volume":"24","author":"T Lam","year":"2008","unstructured":"Lam, T., Sung, W., Tam, S., Wong, C., Yiu, S.: Compressed indexing and local alignment of DNA. Bioinformatics 24, 791\u2013797 (2008). \n                    https:\/\/doi.org\/10.1093\/bioinformatics\/btn032","journal-title":"Bioinformatics"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/nmeth.1923","volume":"9","author":"B Langmead","year":"2012","unstructured":"Langmead, B., Salzberg, S.L.: Fast gapped-read alignment with Bowtie 2. Nat. Methods 9, 357\u2013359 (2012)","journal-title":"Nat. Methods"},{"key":"12_CR14","unstructured":"Li, H.: Aligning sequence reads, clone sequences and assembly contigs with BWA-MEM (2013)"},{"key":"12_CR15","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 25, 1754\u20131760 (2009). \n                    https:\/\/doi.org\/10.1093\/bioinformatics\/btp324","journal-title":"Bioinformatics"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1186\/1471-2105-12-214","volume":"12","author":"F Meyer","year":"2011","unstructured":"Meyer, F., Kurtz, S., Backofen, R., Will, S., Beckstette, M.: Structator: fast index-based search for RNA sequence-structure patterns. BMC Bioinform. 12, 214 (2011). \n                    https:\/\/doi.org\/10.1186\/1471-2105-12-214","journal-title":"BMC Bioinform."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Navarro, G., Providel, E.: Fast, small, simple rank\/select on bitmaps. In: International Symposium on Experimental Algorithms (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-30850-5_26","DOI":"10.1007\/978-3-642-30850-5_26"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1038\/nmeth.2221","volume":"9","author":"M Santiago","year":"2012","unstructured":"Santiago, M., Sammeth, M., Guigo, R., Ribeca, P.: The GEM mapper: fast, accurate and versatile alignment by filtration. Nat. Methods 9, 1185\u20131188 (2012). \n                    https:\/\/doi.org\/10.1038\/nmeth.2221","journal-title":"Nat. Methods"},{"key":"12_CR19","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. Inf. Comput. 213, 13\u201322 (2012). \n                    https:\/\/doi.org\/10.1016\/j.ic.2011.03.007","journal-title":"Inf. Comput."},{"key":"12_CR20","unstructured":"Siragusa, E.: Approximate string matching for high-throughput sequencing. Ph.D. thesis, Freie Universit\u00e4t Berlin (2015)"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"e78","DOI":"10.1093\/nar\/gkt005","volume":"41","author":"E Siragusa","year":"2013","unstructured":"Siragusa, E., Weese, D., Reinert, K.: Fast and accurate read mapping with approximate seeds and multiple backtracking. Nucleic Acids Res. 41, e78\u2013e78 (2013). \n                    https:\/\/doi.org\/10.1093\/nar\/gkt005","journal-title":"Nucleic Acids Res."},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-12-159","volume":"12","author":"Y Ye","year":"2011","unstructured":"Ye, Y., Choi, J.-H., Tang, H.: Rapsearch: a fast protein similarity search tool for short reads. BMC Bioinform. 12, 1 (2011)","journal-title":"BMC Bioinform."}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-56970-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:55:08Z","timestamp":1558317308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56970-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319569697","9783319569703"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56970-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"12 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RECOMB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Research in Computational Molecular Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"recomb2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/groups.csail.mit.edu\/cb\/recomb2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}