{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:47:12Z","timestamp":1725806832458},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319119175"},{"type":"electronic","value":"9783319119182"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11918-2_6","type":"book-chapter","created":{"date-parts":[[2014,10,10]],"date-time":"2014-10-10T05:09:45Z","timestamp":1412917785000},"page":"52-64","source":"Crossref","is-referenced-by-count":5,"title":["Relative FM-Indexes"],"prefix":"10.1007","author":[{"given":"Djamal","family":"Belazzougui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Travis","family":"Gagie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Gog","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Manzini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jouni","family":"Sir\u00e9n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"6_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0020-0190(97)00209-3","volume":"65","author":"P. Bose","year":"1998","unstructured":"Bose, P., Buss, J.F., Lubiw, A.: Pattern matching for permutations. Inf. Process. Lett.\u00a065(5), 277\u2013283 (1998)","journal-title":"Inf. Process. Lett."},{"key":"6_CR2","unstructured":"Burrows, M., Wheeler, D.J.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)"},{"key":"6_CR3","first-page":"2014","volume":"372","author":"H. Ferrada","year":"2016","unstructured":"Ferrada, H., Gagie, T., Hirvola, T., Puglisi, S.J.: Hybrid indexes for repetitive datasets. Phil. Trans. Royal Society A\u00a0372, 2014 (2016)","journal-title":"Phil. Trans. Royal Society A"},{"issue":"4","key":"6_CR4","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"52","author":"P. Ferragina","year":"2005","unstructured":"Ferragina, P., Manzini, G.: Indexing compressed text. Journal of the ACM\u00a052(4), 552\u2013581 (2005)","journal-title":"Journal of the ACM"},{"key":"6_CR5","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.\u00a08504, pp. 326\u2013337. Springer, Heidelberg (2014)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"K\u00e4rkk\u00e4inen, J., Kempa, D., Puglisi, S.J.: Hybrid compression of bitvectors for the FM-index. In: Proc. 2014 IEEE Data Compression Conference, DCC 2014, pp. 302\u2013311 (2014)","DOI":"10.1109\/DCC.2014.87"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1093\/nar\/14.1.31","volume":"14","author":"G.M. Landau","year":"1986","unstructured":"Landau, G.M., Vishkin, U., Nussinov, R.: An efficient string matching algorithm with k differences for nucleotide and amino acid sequences. Nucleic Acids Research\u00a014(1), 31\u201346 (1986)","journal-title":"Nucleic Acids Research"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Langmead, B., Trapnell, C., Pop, M., Salzberg, S.L.: Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biology 10, R25 (2009)","DOI":"10.1186\/gb-2009-10-3-r25"},{"issue":"14","key":"6_CR9","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":"15","key":"6_CR10","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"},{"issue":"3","key":"6_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/cmb.2009.0169","volume":"17","author":"V. M\u00e4kinen","year":"2010","unstructured":"M\u00e4kinen, V., Navarro, G., Sir\u00e9n, J., V\u00e4lim\u00e4ki, N.: Storage and retrieval of highly repetitive sequence collections. Journal of Computational Biology\u00a017(3), 281\u2013308 (2010)","journal-title":"Journal of Computational Biology"},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/316542.316550","volume":"46","author":"E.W. Myers","year":"1999","unstructured":"Myers, E.W.: A fast bit-vector algorithm for approximate string matching based on dynamic programming. Journal of the ACM\u00a046(3), 395\u2013415 (1999)","journal-title":"Journal of the ACM"},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01840446","volume":"1","author":"E.W. Myers","year":"1986","unstructured":"Myers, E.W.: An O(ND) difference algorithm and its variations. Algorithmica\u00a01(2), 251\u2013266 (1986)","journal-title":"Algorithmica"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Okanohara, D., Sadakane, K.: Practical entropy-compressed rank\/select dictionary. In: Proc. Ninth Workshop on Algorithm Engineering and Experiments (ALENEX 2007), pp. 60\u201370. SIAM (2007)","DOI":"10.1137\/1.9781611972870.6"},{"issue":"4","key":"6_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/1290672.1290680","volume":"3","author":"R. Raman","year":"2007","unstructured":"Raman, R., Raman, V., Rao Satti, S.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Transactions on Algorithms\u00a03(4), 43 (2007)","journal-title":"ACM Transactions on Algorithms"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1038\/msb.2011.54","volume":"7","author":"J. Rozowsky","year":"2011","unstructured":"Rozowsky, J., Abyzov, A., Wang, J., Alves, P., Raha, D., Harmanci, A., Leng, J., Bjornson, R., Kong, Y., Kitabayashi, N., Bhardwaj, N., Rubin, M., Snyder, M., Gerstein, M.: AlleleSeq: Analysis of allelespecific expression and binding in a network framework. Molecular Systems Biology\u00a07, 522 (2011)","journal-title":"Molecular Systems Biology"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11918-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T23:39:38Z","timestamp":1559000378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11918-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319119175","9783319119182"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11918-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}