{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:45Z","timestamp":1740098925954,"version":"3.37.3"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319598246"},{"type":"electronic","value":"9783319598260"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59826-0_2","type":"book-chapter","created":{"date-parts":[[2017,9,18]],"date-time":"2017-09-18T07:16:01Z","timestamp":1505718961000},"page":"41-75","source":"Crossref","is-referenced-by-count":0,"title":["Full-Text Indexes for High-Throughput Sequencing"],"prefix":"10.1007","author":[{"given":"David","family":"Weese","sequence":"first","affiliation":[]},{"given":"Enrico","family":"Siragusa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,19]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"M. Abouelhoda","year":"2004","unstructured":"Abouelhoda, M., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2, 53\u201386 (2004)","journal-title":"J. Discrete Algorithms"},{"key":"2_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-78909-5","volume-title":"The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching","author":"D. Adjeroh","year":"2008","unstructured":"Adjeroh, D., Bell, T., Mukherjee, A.: The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching. Springer Science & Business Media, Berlin (2008)"},{"key":"2_CR3","first-page":"194","volume":"11","author":"V. Arlazarov","year":"1970","unstructured":"Arlazarov, V., Dinic, E., Kronrod, M., Faradzev, I.: On economical construction of the transitive closure of a directed graph. Dokl. Akad. Nauk 11, 194 (1970)","journal-title":"Dokl. Akad. Nauk"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bauer, M.J., Cox, A.J., Rosone, G., Sciortino, M.: Lightweight LCP construction for next-generation sequencing datasets. In: Algorithms in Bioinformatics, pp. 326\u2013337. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-33122-0_26"},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.tcs.2012.02.002","volume":"483","author":"M.J. Bauer","year":"2013","unstructured":"Bauer, M.J., Cox, A.J., Rosone, G.: Lightweight algorithms for constructing and inverting the bwt of string collections. Theor. Comput. Sci. 483, 134\u2013148 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR6","unstructured":"Burkhardt, S., K\u00e4rkk\u00e4inen, J.: Better filtering with gapped q-grams. Fund. Inform. 56(1,2), 51\u201370 (2003)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Burkhardt, S., Crauser, A., Ferragina, P., Lenhof, H.P., Rivals, E., Vingron, M.: q-gram based database searching using suffix arrays. In: Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), pp. 77\u201383 (1999)","DOI":"10.1145\/299432.299460"},{"key":"2_CR8","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical Report 124, Digital SRC Research Report (1994)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Cazaux, B., Lecroq, T., Rivals, E.: From indexing data structures to de Bruijn graphs. In: Combinatorial Pattern Matching, pp. 89\u201399. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-07566-2_10"},{"key":"2_CR10","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT, Cambridge, MA (2001)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Grossi, R., K\u00e4rkk\u00e4inen, J., Landau, G.M.: A constant-space comparison-based algorithm for computing the Burrows\u2013Wheeler transform. In: Combinatorial Pattern Matching, pp. 74\u201382. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-38905-4_9"},{"key":"2_CR12","doi-asserted-by":"crossref","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 Bioinf. 9, 11 (2008)","journal-title":"BMC Bioinf."},{"issue":"1","key":"2_CR13","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1093\/bioinformatics\/btp601","volume":"26","author":"A.K. Emde","year":"2010","unstructured":"Emde, A.K., Grunert, M., Weese, D., Reinert, K., Sperling, S.R.: MicroRazerS: rapid alignment of small RNA reads. Bioinformatics 26(1), 123\u2013124 (2010)","journal-title":"Bioinformatics"},{"issue":"5","key":"2_CR14","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1093\/bioinformatics\/bts019","volume":"28","author":"A.K. Emde","year":"2012","unstructured":"Emde, A.K., Schulz, M.H., Weese, D., Sun, R., Vingron, M., Kalscheuer, V.M., Haas, S.A., Reinert, K.: Detecting genomic indel variants with exact breakpoints in single- and paired-end sequencing data using splazers. Bioinformatics 28(5), 619\u2013627 (2012)","journal-title":"Bioinformatics"},{"issue":"6","key":"2_CR15","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1145\/355541.355547","volume":"47","author":"M. Farach-Colton","year":"2000","unstructured":"Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. J. ACM 47(6), 987\u20131011 (2000)","journal-title":"J. ACM"},{"issue":"2","key":"2_CR16","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/2431211.2431212","volume":"45","author":"S. Faro","year":"2013","unstructured":"Faro, S., Lecroq, T.: The exact online string matching problem: a review of the most recent results. ACM Comput. Surv. 45(2), 13 (2013)","journal-title":"ACM Comput. Surv."},{"issue":"4","key":"2_CR17","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"52","author":"P. Ferragina","year":"2005","unstructured":"Ferragina, P., Manzini, G.: Indexing compressed text. J. ACM 52(4), 552\u2013581 (2005)","journal-title":"J. ACM"},{"issue":"3","key":"2_CR18","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1007\/s00453-011-9535-0","volume":"63","author":"P. Ferragina","year":"2012","unstructured":"Ferragina, P., Gagie, T., Manzini, G.: Lightweight data indexing and compression in external memory. Algorithmica 63(3), 707\u2013730 (2012)","journal-title":"Algorithmica"},{"issue":"1","key":"2_CR19","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0885-064X(88)90008-8","volume":"4","author":"Z. Galil","year":"1988","unstructured":"Galil, Z., Giancarlo, R.: Data structures and algorithms for approximate string matching. J. Complexity 4(1), 33\u201372 (1988)","journal-title":"J. Complexity"},{"key":"2_CR20","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0167-6423(95)00003-8","volume":"25","author":"R. Giegerich","year":"1995","unstructured":"Giegerich, R., Kurtz, S.: A comparison of imperative and purely functional suffix tree constructions. Sci. Comput. Program. 25, 187\u2013218 (1995)","journal-title":"Sci. Comput. Program."},{"issue":"11","key":"2_CR21","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1002\/spe.535","volume":"33","author":"R. Giegerich","year":"2003","unstructured":"Giegerich, R., Kurtz, S., Stoye, J.: Efficient implementation of lazy suffix trees. Softw. Pract. Exp. 33(11), 1035\u20131049 (2003)","journal-title":"Softw. Pract. Exp."},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Gog, S., Beller, T., Moffat, A., Petri, M.: From theory to practice: plug and play with succinct data structures. In: Experimental Algorithms, pp. 326\u2013337. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-07959-2_28"},{"issue":"2","key":"2_CR23","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1137\/S0097539702402354","volume":"35","author":"R. Grossi","year":"2005","unstructured":"Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM J. Comput. 35(2), 378\u2013407 (2005)","journal-title":"SIAM J. Comput."},{"key":"2_CR24","unstructured":"Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u00a0\u201903, pp. 841\u2013850. Society for Industrial and Applied Mathematics, Philadelphia, PA (2003)"},{"key":"2_CR25","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)"},{"key":"2_CR26","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"R.W. Hamming","year":"1950","unstructured":"Hamming, R.W.: Error detecting and error correcting codes. Syst. Tech. J. 29, 147\u2013160 (1950)","journal-title":"Syst. Tech. J."},{"issue":"1","key":"2_CR27","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s00453-006-1228-8","volume":"48","author":"W.K. Hon","year":"2007","unstructured":"Hon, W.K., Lam, T.W., Sadakane, K., Sung, W.K., Yiu, S.M.: A space and time efficient algorithm for constructing compressed suffix arrays. Algorithmica 48(1), 23\u201336 (2007)","journal-title":"Algorithmica"},{"key":"2_CR28","unstructured":"Intel: Intel\u00ae; 64 and IA-32 Architectures Optimization Reference Manual. Intel Corporation, Santa Clara, CA (2011)"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: 30th Annual Symposium on Foundations of Computer Science, 1989, pp. 549\u2013554. IEEE, New York (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, CPM\u00a0\u201901, pp. 181\u2013192. Springer, Berlin (2001)","DOI":"10.1007\/3-540-48194-X_17"},{"issue":"Suppl. 9","key":"2_CR31","doi-asserted-by":"crossref","first-page":"S15","DOI":"10.1186\/1471-2105-12-S9-S15","volume":"12","author":"B. Kehr","year":"2011","unstructured":"Kehr, B., Weese, D., Reinert, K.: Stellar: fast and exact local alignments. BMC Bioinf. 12(Suppl. 9), S15 (2011)","journal-title":"BMC Bioinf."},{"issue":"3","key":"2_CR32","doi-asserted-by":"crossref","first-page":"R25","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 Biol. 10(3), R25 (2009)","journal-title":"Genome Biol."},{"issue":"14","key":"2_CR33","doi-asserted-by":"crossref","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(14), 1754\u20131760 (2009)","journal-title":"Bioinformatics"},{"issue":"16","key":"2_CR34","doi-asserted-by":"crossref","first-page":"2078","DOI":"10.1093\/bioinformatics\/btp352","volume":"25","author":"H. Li","year":"2009","unstructured":"Li, H., Handsaker, B., Wysoker, A., Fennell, T., Ruan, J., Homer, N., Marth, G., Abecasis, G., Durbin, R., 1000 Genome Project Data Processing Subgroup: The sequence alignment\/map format and SAMtools. Bioinformatics 25(16), 2078\u20132079 (2009)","journal-title":"Bioinformatics"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Louza, F.A., Telles, G.P., Ciferri, C.D.D.A.: External memory generalized suffix and LCP arrays construction. In: Combinatorial Pattern Matching, pp. 201\u2013210. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-38905-4_20"},{"key":"2_CR36","unstructured":"Manber, U., Myers, E.: Suffix arrays: a new method for on-line string searches. In: SODA \u201990, pp. 319\u2013327. SIAM, Philadelphia (1990)"},{"issue":"5","key":"2_CR37","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, E.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"2_CR38","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/j.tcs.2007.07.014","volume":"387","author":"S. Mantaci","year":"2007","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: An extension of the Burrows\u2013Wheeler transform. Theor. Comput. Sci. 387(3), 298\u2013312 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"2_CR39","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1145\/382780.382782","volume":"48","author":"G. Manzini","year":"2001","unstructured":"Manzini, G.: An analysis of the Burrows\u2013Wheeler transform. J. ACM 48(3), 407\u2013430 (2001)","journal-title":"J. ACM"},{"issue":"2","key":"2_CR40","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM 23(2), 262\u2013272 (1976)","journal-title":"J. ACM"},{"issue":"4","key":"2_CR41","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"D.R. Morrison","year":"1968","unstructured":"Morrison, D.R.: Patricia \u2013 practical algorithm to retrieve information coded in alphanumeric. J. ACM 15(4), 514\u2013534 (1968)","journal-title":"J. ACM"},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Comput. Surv. 39(1), 2:1\u20132:61 (2007)","DOI":"10.1145\/1216370.1216372"},{"key":"2_CR43","volume-title":"Bioinformatics Algorithms: Sequence Analysis, Genome Rearrangements, and Phylogenetic Reconstruction","author":"E. Ohlebusch","year":"2013","unstructured":"Ohlebusch, E.: Bioinformatics Algorithms: Sequence Analysis, Genome Rearrangements, and Phylogenetic Reconstruction. Oldenbusch, Bremen (2013)"},{"key":"2_CR44","unstructured":"Puglisi, S., Smyth, W., Turpin, A.: A taxonomy of suffix array construction algorithms. In: Holub, J. (ed.) Proceedings of Prague Stringology Conference \u201905, Prague, pp. 1\u201330 (2005)"},{"issue":"16","key":"2_CR45","doi-asserted-by":"crossref","first-page":"i187","DOI":"10.1093\/bioinformatics\/btn281","volume":"24","author":"T. Rausch","year":"2008","unstructured":"Rausch, T., Emde, A.K., Weese, D., D\u00f6ring, A., Notredame, C., Reinert, K.: Segment-based multiple sequence alignment. Bioinformatics 24(16), i187\u2013192 (2008)","journal-title":"Bioinformatics"},{"issue":"9","key":"2_CR46","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1093\/bioinformatics\/btp131","volume":"25","author":"T. Rausch","year":"2009","unstructured":"Rausch, T., Koren, S., Denisov, G., Weese, D., Emde, A.K., D\u00f6ring, A., Reinert, K.: A consistency-based consensus algorithm for de novo and reference-guided sequence assembly of short reads. Bioinformatics 25(9), 1118\u20131124 (2009)","journal-title":"Bioinformatics"},{"key":"2_CR47","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/978-3-540-87361-7_26","volume-title":"Algorithms in Bioinformatics. Lecture Notes in Computer Science","author":"M.H. Schulz","year":"2008","unstructured":"Schulz, M.H., Weese, D., Rausch, T., D\u00f6ring, A., Reinert, K., Vingron, M.: Fast and adaptive variable order Markov chain construction. In: Crandall, K., Lagergren, J. (eds.) Algorithms in Bioinformatics. Lecture Notes in Computer Science, vol. 5251, pp. 306\u2013317. Springer, Berlin (2008)"},{"issue":"17","key":"2_CR48","doi-asserted-by":"crossref","first-page":"i356","DOI":"10.1093\/bioinformatics\/btu440","volume":"30","author":"M.H. Schulz","year":"2014","unstructured":"Schulz, M.H., Weese, D., Holtgrewe, M., Dimitrova, V., Niu, S., Reinert, K., Richard, H.: Fiona: a parallel and automatic strategy for read error correction. Bioinformatics 30(17), i356\u2013i363 (2014)","journal-title":"Bioinformatics"},{"key":"2_CR49","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BFb0027775","volume-title":"Concurrency and Parallelism, Programming, Networking, and Security. Lecture Notes in Computer Science","author":"F. Shi","year":"1996","unstructured":"Shi, F.: Suffix arrays for multiple strings: a method for on-line multiple string searches. In: Jaffar, J., Yap, R. (eds.) Concurrency and Parallelism, Programming, Networking, and Security. Lecture Notes in Computer Science, vol. 1179, pp. 11\u201322. Springer, Berlin (1996). DOI\u00a010.1007\/BFb0027775. http:\/\/dx.doi.org\/10.1007\/BFb0027775"},{"issue":"3","key":"2_CR50","doi-asserted-by":"crossref","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 Res. 22(3), 549\u2013556 (2012)","journal-title":"Genome Res."},{"key":"2_CR51","unstructured":"Siragusa, E.: Approximate string matching for high-throughput sequencing. Ph.D. thesis, Freie Universit\u00e4t Berlin (2015)"},{"issue":"7","key":"2_CR52","doi-asserted-by":"crossref","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(7), e78 (2013)","journal-title":"Nucleic Acids Res."},{"key":"2_CR53","doi-asserted-by":"crossref","unstructured":"Siragusa, E., Weese, D., Reinert, K.: Scalable string similarity search\/join with approximate seeds and multiple backtracking. In: Proceedings of the Joint EDBT\/ICDT 2013 Workshops, pp. 370\u2013374. ACM, New York (2013)","DOI":"10.1145\/2457317.2457386"},{"key":"2_CR54","doi-asserted-by":"crossref","unstructured":"Ukkonen, E.: Approximate string-matching over suffix trees. In: Combinatorial Pattern Matching, pp. 228\u2013242. Springer, Berlin (1993)","DOI":"10.1007\/BFb0029808"},{"issue":"3","key":"2_CR55","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"2_CR56","unstructured":"Weese, D.: Indices and applications in high-throughput sequencing. Ph.D. thesis, Freie Universit\u00e4t Berlin (2013)"},{"key":"2_CR57","doi-asserted-by":"crossref","unstructured":"Weese, D., Schulz, M.H.: Efficient string mining under constraints via the deferred frequency index. In: Proceedings of the 8th Industrial Conference on Data Mining (ICDM\u00a0\u201908). LNAI, vol. 5077, pp. 374\u2013388. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-70720-2_29"},{"key":"2_CR58","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proceedings of the 14th Symposium on Switching and Automata Theory, SWAT\u00a0\u201973, pp. 1\u201311. IEEE Computer Society, Washington (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Algorithms for Next-Generation Sequencing Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59826-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T12:00:38Z","timestamp":1570104038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59826-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319598246","9783319598260"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59826-0_2","relation":{},"subject":[],"published":{"date-parts":[[2017]]}}}