{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:41:53Z","timestamp":1649025713939},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T00:00:00Z","timestamp":1485993600000},"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":["Math.Comput.Sci."],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s11786-016-0283-z","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T06:16:24Z","timestamp":1486016184000},"page":"151-157","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Compressed Spaced Suffix Arrays"],"prefix":"10.1007","volume":"11","author":[{"given":"Travis","family":"Gagie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Manzini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Valenzuela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,2]]},"reference":[{"key":"283_CR1","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/s00453-012-9726-3","volume":"69","author":"J Barbay","year":"2014","unstructured":"Barbay, J., Claude, F., Gagie, T., Navarro, G., Nekrich, Y.: Efficient fully-compressed sequence representations. Algorithmica 69, 232\u2013268 (2014)","journal-title":"Algorithmica"},{"key":"283_CR2","doi-asserted-by":"crossref","first-page":"4327","DOI":"10.1016\/j.tcs.2009.07.014","volume":"410","author":"G Battaglia","year":"2009","unstructured":"Battaglia, G., Cangelosi, D., Grossi, R., Pisanti, N.: Masking patterns in sequences: a new class of motif discovery with don\u2019t cares. Theor. Comput. Sci. 410, 4327\u20134340 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"283_CR3","doi-asserted-by":"crossref","unstructured":"Belazzougui, D., Gagie, T., Gog, S., Manzini, G., Sir\u00e9n, J.: Relative FM-indexes. In: Proceedings of the 21st Symposium on String Processing and Information Retrieval (SPIRE), pp. 52\u201364 (2014)","DOI":"10.1007\/978-3-319-11918-2_6"},{"key":"283_CR4","doi-asserted-by":"crossref","unstructured":"Belazzougui, D., Navarro, G.: Alphabet-independent compressed text indexing. ACM Trans. Algorithms 11(4) (2015)","DOI":"10.1145\/2629339"},{"key":"283_CR5","doi-asserted-by":"crossref","unstructured":"Boucher, C., Bowe, A., Gagie, T., Manzini, G., Sir\u00e9n, J.: Relative select. In: Proceedings of the 22nd Symposium on String Processing and Information Retrieval (SPIRE), pp. 149\u2013155 (2015)","DOI":"10.1007\/978-3-319-23826-5_15"},{"key":"283_CR6","doi-asserted-by":"crossref","unstructured":"Bowe, A., Onodera, T., Sadakane, K., Shibuya, T.: Succinct de Bruijn graphs. In: Proceedings of the 12th Workshop on Algorithms in Bioinformatics (WABI), pp. 225\u2013235 (2012)","DOI":"10.1007\/978-3-642-33122-0_18"},{"key":"283_CR7","first-page":"126","volume-title":"Bioinformatics Algorithms: Techniques and Applications","author":"DG Brown","year":"2008","unstructured":"Brown, D.G.: A survey of seeding for sequence alignment. In: M\u01cendoiu, I., Zelikovsky, A. (eds.) Bioinformatics Algorithms: Techniques and Applications, pp. 126\u2013152. Wiley-Interscience, Hoboken (2008)"},{"key":"283_CR8","first-page":"51","volume":"56","author":"S Burkhardt","year":"2003","unstructured":"Burkhardt, S., K\u00e4rkk\u00e4inen, J.: Better filtering with gapped q-grams. Fundamenta Informicae 56, 51\u201370 (2003)","journal-title":"Fundamenta Informicae"},{"key":"283_CR9","unstructured":"Burrows, M., Wheeler, D.J.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)"},{"key":"283_CR10","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Tischler, G.: The gapped suffix array: a new index structure for fast approximate matching. In: Proceedings of the 17th Symposium on String Processing and Information Retrieval (SPIRE), pp. 359\u2013364 (2010)","DOI":"10.1007\/978-3-642-16321-0_37"},{"key":"283_CR11","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1093\/bioinformatics\/btr046","volume":"27","author":"M David","year":"2011","unstructured":"David, M., Dzamba, M., Lister, D., Ilie, L., Brudno, M.: SHRiMP2: sensitive yet practical short read mapping. Bioinformatics 27, 1011\u20131012 (2011)","journal-title":"Bioinformatics"},{"key":"283_CR12","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1016\/j.jcss.2013.03.002","volume":"79","author":"L Egidi","year":"2013","unstructured":"Egidi, L., Manzini, G.: Better spaced seeds using quadratic residues. J. Comput. Syst. Sci. 79, 1144\u20131155 (2013)","journal-title":"J. Comput. Syst. Sci."},{"key":"283_CR13","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, 552\u2013581 (2005)","journal-title":"J. ACM"},{"key":"283_CR14","unstructured":"Gagie, T., Manzini, G., Valenzuela, D.: Compressed spaced suffix arrays. In: Proceedings of the 2nd International Conference on Algorithms for Big Data (ICABD), pp. 37\u201345 (2014)"},{"key":"283_CR15","unstructured":"Gagie, T., Navarro, G., Puglisi, S.J., Sir\u00e9n, J.: Relative compressed suffix trees. Technical Report. arXiv:1508.02550 (2015)"},{"key":"283_CR16","doi-asserted-by":"crossref","first-page":"e7767","DOI":"10.1371\/journal.pone.0007767","volume":"4","author":"N Homer","year":"2009","unstructured":"Homer, N., Merriman, B., Nelson, S.F.: BFAST: an alignment tool for large scale genome resequencing. PLOS One 4, e7767 (2009)","journal-title":"PLOS One"},{"key":"283_CR17","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1186\/1471-2164-12-280","volume":"12","author":"L Ilie","year":"2011","unstructured":"Ilie, L., Ilie, S., Khoshraftar, S., Mansouri Bigvand, A.: Seeds for effective oligonucleotide design. BMC Genomics 12, 280 (2011)","journal-title":"BMC Genomics"},{"key":"283_CR18","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1038\/ng.1028","volume":"44","author":"Z Iqbal","year":"2012","unstructured":"Iqbal, Z., Caccamo, M., Turner, I., Flicek, P., McVean, G.: De novo assembly and genotyping of variants using colored de Bruijn graphs. Nat. Genet. 44, 226\u2013232 (2012)","journal-title":"Nat. Genet."},{"key":"283_CR19","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1101\/gr.113985.110","volume":"21","author":"SM Kie\u0142basa","year":"2011","unstructured":"Kie\u0142basa, S.M., Wan, R., Sato, K., Horton, P., Frith, M.C.: Adaptive seeds tame genomic sequence comparison. Genome Res. 21, 487\u2013493 (2011)","journal-title":"Genome Res."},{"key":"283_CR20","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1038\/nmeth.1923","volume":"9","author":"B Langmeand","year":"2012","unstructured":"Langmeand, B., Salzberg, S.L.: Fast gapped-read alignment with Bowtie 2. Nat. Methods 9, 357\u2013359 (2012)","journal-title":"Nat. Methods"},{"key":"283_CR21","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1093\/bioinformatics\/18.3.440","volume":"18","author":"B Ma","year":"2002","unstructured":"Ma, B., Tromp, J., Li, M.: PatternHunter: faster and more sensitive homology search. Bioinformatics 18, 440\u2013445 (2002)","journal-title":"Bioinformatics"},{"issue":"3","key":"283_CR22","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1016\/j.jda.2007.03.003","volume":"6","author":"P Peterlongo","year":"2008","unstructured":"Peterlongo, P., Pisanti, N., Boyer, F., Pereira do Lago, A., Sagot, M.: Lossless filter for multiple repetitions with Hamming distance. J. Discrete Algorithms 6(3), 497\u2013509 (2008)","journal-title":"J. Discrete Algorithms"},{"key":"283_CR23","doi-asserted-by":"crossref","unstructured":"Russo, L.M.S., Tischler, G.: Succinct gapped suffix arrays. In: Proceedings of the 17th Symposium on String Processing and Information Retrieval (SPIRE), pp. 290\u2013294 (2011)","DOI":"10.1007\/978-3-642-24583-1_28"},{"key":"283_CR24","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1089\/cmb.2005.12.847","volume":"12","author":"Y Sun","year":"2005","unstructured":"Sun, Y., Buhler, J.: Designing multiple simultaneous seeds for DNA similarity search. J. Comput. Biol. 12, 847\u2013861 (2005)","journal-title":"J. Comput. Biol."},{"key":"283_CR25","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0020-0190(85)90093-6","volume":"21","author":"KJ Supowit","year":"1985","unstructured":"Supowit, K.J.: Decomposing a set of points into chains, with applications to permutation and circle graphs. Inform. Process. Lett. 21, 249\u2013252 (1985)","journal-title":"Inform. Process. Lett."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-016-0283-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-016-0283-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-016-0283-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:27:29Z","timestamp":1568784449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-016-0283-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,2]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["283"],"URL":"https:\/\/doi.org\/10.1007\/s11786-016-0283-z","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,2]]}}}