{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:08Z","timestamp":1760202668757},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_12","type":"book-chapter","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T23:22:47Z","timestamp":1376608967000},"page":"133-144","source":"Crossref","is-referenced-by-count":27,"title":["Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform"],"prefix":"10.1007","author":[{"given":"Djamal","family":"Belazzougui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Cunial","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juha","family":"K\u00e4rkk\u00e4inen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Veli","family":"M\u00e4kinen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Apostolico, A.: The myriad virtues of subword trees. Technical Report 85\u2013540, Department of Computer Science, Purdue University (1985)","DOI":"10.1007\/978-3-642-82456-2_6"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Apostolico, A., Bock, M.E., Lonardi, S.: Monotony of surprise and large-scale quest for unusual words. In: RECOMB 2002, pp. 22\u201331 (2002)","DOI":"10.1145\/565196.565200"},{"issue":"1-2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1089\/10665270050081397","volume":"7","author":"A. Apostolico","year":"2000","unstructured":"Apostolico, A., Bock, M.E., Lonardi, S., Xu, X.: Efficient detection of unusual words. J. Comput. Biol.\u00a07(1-2), 71\u201394 (2000)","journal-title":"J. Comput. Biol."},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1137\/1.9781611973068.86","volume-title":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Djamal Belazzougui","year":"2009","unstructured":"Belazzougui, D., Boldi, P., Pagh, R., Vigna, S.: Monotone minimal perfect hashing: searching a sorted table with o(1) accesses. In: SODA 2009, pp. 785\u2013794 (2009)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Belazzougui, D., Navarro, G.: Alphabet-independent compressed text indexing. ACM Trans. Alg. (to appear, 2013)","DOI":"10.1145\/2635816"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-34109-0_11","volume-title":"String Processing and Information Retrieval","author":"T. Beller","year":"2012","unstructured":"Beller, T., Berger, K., Ohlebusch, E.: Space-efficient computation of maximal and supermaximal repeats in genome sequences. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol.\u00a07608, pp. 99\u2013110. Springer, Heidelberg (2012)"},{"issue":"6","key":"12_CR7","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0020-0190(92)90111-8","volume":"44","author":"D. Breslauer","year":"1992","unstructured":"Breslauer, D.: An on-line string superprimitivity test. Inform. Process. Lett.\u00a044(6), 345\u2013347 (1992)","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"12_CR8","first-page":"20","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 T. Alg.\u00a03(2), 20 (2007)","journal-title":"ACM T. Alg."},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-12200-2_16","volume-title":"LATIN 2010: Theoretical Informatics","author":"J. Fischer","year":"2010","unstructured":"Fischer, J.: Optimal succinctness for range minimum queries. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 158\u2013169. Springer, Heidelberg (2010)"},{"issue":"51","key":"12_CR10","doi-asserted-by":"publisher","first-page":"5354","DOI":"10.1016\/j.tcs.2009.09.012","volume":"410","author":"J. Fischer","year":"2009","unstructured":"Fischer, J., M\u00e4kinen, V., Navarro, G.: Faster entropy-bounded compressed suffix trees. Theor. Comput. Sci.\u00a0410(51), 5354\u20135364 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"C.A.R. Hoare","year":"1962","unstructured":"Hoare, C.A.R.: Quicksort. The Computer Journal\u00a05(1), 10\u201316 (1962)","journal-title":"The Computer Journal"},{"key":"12_CR13","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, pp. 144\u2013152. Springer, Heidelberg (2002)"},{"issue":"6","key":"12_CR14","doi-asserted-by":"publisher","first-page":"2162","DOI":"10.1137\/070685373","volume":"38","author":"W.-K. Hon","year":"2009","unstructured":"Hon, W.-K., Sadakane, K., Sung, W.-K.: Breaking a time-and-space barrier in constructing full-text indices. SIAM J. Comput.\u00a038(6), 2162\u20132178 (2009)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"12_CR15","first-page":"421","volume":"9","author":"O. Kulekci","year":"2012","unstructured":"Kulekci, O., Vitter, J.S., Xu, B.: Efficient maximal repeat finding using the Burrows-Wheeler transform and wavelet tree. TCBB\u00a09(2), 421\u2013429 (2012)","journal-title":"TCBB"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Lam, T.W., Li, R., Tam, A., Wong, S., Wu, E., Yiu, S.: High throughput short read alignment via bi-directional BWT. In: BIBM 2009, pp. 31\u201336 (2009)","DOI":"10.1109\/BIBM.2009.42"},{"issue":"5","key":"12_CR17","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. Brief. Bioinform.\u00a011(5), 473\u2013483 (2010)","journal-title":"Brief. Bioinform."},{"issue":"15","key":"12_CR18","doi-asserted-by":"publisher","first-page":"1966","DOI":"10.1093\/bioinformatics\/btp336","volume":"25","author":"R. Li","year":"2009","unstructured":"Li, R., Yu, C., Li, Y., Lam, T.W., Yiu, S.-M., Kristiansen, K., Wang, J.: Soap2: An improved ultrafast tool for short read alignment. Bioinformatics\u00a025(15), 1966\u20131967 (2009)","journal-title":"Bioinformatics"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-642-16321-0_36","volume-title":"String Processing and Information Retrieval","author":"E. Ohlebusch","year":"2010","unstructured":"Ohlebusch, E., Gog, S., K\u00fcgel, A.: Computing matching statistics and maximal exact matches on compressed full-text indexes. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol.\u00a06393, pp. 347\u2013358. Springer, Heidelberg (2010)"},{"issue":"1","key":"12_CR20","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1186\/1471-2105-10-137","volume":"10","author":"A.J. Pinho","year":"2009","unstructured":"Pinho, A.J., Ferreira, P.J.S.G., Garcia, S.P., Rodrigues, J.M.O.S.: On finding minimal absent words. BMC Bioinformatics\u00a010(1), 137 (2009)","journal-title":"BMC Bioinformatics"},{"issue":"4","key":"12_CR21","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/1290672.1290680","volume":"3","author":"Rajeev Raman","year":"2007","unstructured":"Raman, R., Raman, V., Satti, S.R.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM T. Alg.\u00a03(4) (2007)","journal-title":"ACM Transactions on Algorithms"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-540-69068-9_19","volume-title":"Combinatorial Pattern Matching","author":"L.M.S. Russo","year":"2008","unstructured":"Russo, L.M.S., Navarro, G., Oliveira, A.L.: Dynamic fully-compressed suffix trees. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol.\u00a05029, pp. 191\u2013203. Springer, Heidelberg (2008)"},{"issue":"4","key":"12_CR23","first-page":"53","volume":"7","author":"L.M.S. Russo","year":"2011","unstructured":"Russo, L.M.S., Navarro, G., Oliveira, A.L.: Fully compressed suffix trees. ACM Trans. Alg.\u00a07(4), 53 (2011)","journal-title":"ACM Trans. Alg."},{"issue":"4","key":"12_CR24","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-006-1198-x","volume":"41","author":"K. Sadakane","year":"2007","unstructured":"Sadakane, K.: Compressed suffix trees with full functionality. Theor. Comput. Syst.\u00a041(4), 589\u2013607 (2007)","journal-title":"Theor. Comput. Syst."},{"issue":"1","key":"12_CR25","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.jda.2006.03.011","volume":"5","author":"K. Sadakane","year":"2007","unstructured":"Sadakane, K.: Succinct data structures for flexible text retrieval systems. J. Discrete Alg.\u00a05(1), 12\u201322 (2007)","journal-title":"J. Discrete Alg."},{"key":"12_CR26","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/1.9781611973075.13","volume-title":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Kunihiko Sadakane","year":"2010","unstructured":"Sadakane, K., Navarro, G.: Fully-functional succinct trees. In: SODA 2010, pp. 134\u2013149 (2010)"},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-13509-5_5","volume-title":"Combinatorial Pattern Matching","author":"T. Schnattinger","year":"2010","unstructured":"Schnattinger, T., Ohlebusch, E., Gog, S.: Bidirectional search in a string with wavelet trees. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol.\u00a06129, pp. 40\u201350. Springer, Heidelberg (2010)"},{"key":"12_CR28","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. Inform. Comput.\u00a0213, 13\u201322 (2012)","journal-title":"Inform. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T22:45:07Z","timestamp":1563662707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}