{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:51:50Z","timestamp":1725900710573},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642334115"},{"type":"electronic","value":"9783642334122"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33412-2_60","type":"book-chapter","created":{"date-parts":[[2012,9,21]],"date-time":"2012-09-21T17:07:08Z","timestamp":1348247228000},"page":"584-592","source":"Crossref","is-referenced-by-count":5,"title":["Querying Highly Similar Structured Sequences via Binary Encoding and Word Level Operations"],"prefix":"10.1007","author":[{"given":"Ali","family":"Alatabbi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carl","family":"Barton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Mouchard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"60_CR1","doi-asserted-by":"crossref","unstructured":"Adjeroh, D., Bell, T., Mukherjee, A.: The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching, 1st edn. Springer (July 2008)","DOI":"10.1007\/978-0-387-78909-5"},{"issue":"6","key":"60_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Commun. ACM"},{"issue":"3","key":"60_CR3","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S.F. Altschul","year":"1990","unstructured":"Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. Journal of Molecular Biology\u00a0215(3), 403\u2013410 (1990)","journal-title":"Journal of Molecular Biology"},{"key":"60_CR4","doi-asserted-by":"crossref","unstructured":"Barton, C., Giraud, M., Iliopoulos, C., Lecroq, T., Mouchard, L., Pissis, S.P.: Querying highly similar sequences. International Journal of Computational Biology and Drug Design (accepted, 2012)","DOI":"10.1504\/IJCBDD.2013.052206"},{"key":"60_CR5","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/BIBE.2010.22","volume-title":"Proceedings of the 2010 IEEE International Conference on Bioinformatics and Bioengineering, BIBE 2010","author":"F. Claude","year":"2010","unstructured":"Claude, F., Farina, A., Mart\u00ednez-Prieto, M.A., Navarro, G.: Compressed q-gram indexing for highly repetitive biological sequences. In: Proceedings of the 2010 IEEE International Conference on Bioinformatics and Bioengineering, BIBE 2010, pp. 86\u201391. IEEE Computer Society, Washington, DC (2010)"},{"issue":"2","key":"60_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.ipl.2005.11.019","volume":"98","author":"S. Dori","year":"2006","unstructured":"Dori, S., Landau, G.M.: Construction of Aho Corasick automaton in linear time for integer alphabets. Inf. Process. Lett.\u00a098(2), 66\u201372 (2006)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"60_CR7","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. J. ACM\u00a052(4), 552\u2013581 (2005)","journal-title":"J. ACM"},{"key":"60_CR8","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1145\/1854776.1854801","volume-title":"Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology, BCB 2010","author":"K. Frousios","year":"2010","unstructured":"Frousios, K., Iliopoulos, C.S., Mouchard, L., Pissis, S.P., Tischler, G.: REAL: an efficient read aligner for next generation sequencing reads. In: Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology, BCB 2010, pp. 154\u2013159. ACM, New York (2010)"},{"key":"60_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-14355-7_19","volume-title":"Algorithmic Aspects in Information and Management","author":"S. Huang","year":"2010","unstructured":"Huang, S., Lam, T.W., Sung, W.K., Tam, S.L., Yiu, S.M.: Indexing Similar DNA Sequences. In: Chen, B. (ed.) AAIM 2010. LNCS, vol.\u00a06124, pp. 180\u2013190. Springer, Heidelberg (2010)"},{"issue":"6","key":"60_CR10","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J. K\u00e4rkk\u00e4inen","year":"2006","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM\u00a053(6), 918\u2013936 (2006)","journal-title":"J. ACM"},{"issue":"4","key":"60_CR11","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1089\/cmb.2005.12.407","volume":"12","author":"R. Lippert","year":"2005","unstructured":"Lippert, R.: Space-effiient whole genome comparisons with Burrows Wheeler Transforms. Journal of Computational Biology\u00a012(4), 407\u2013415 (2005)","journal-title":"Journal of Computational Biology"},{"key":"60_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0076-6879(90)83007-V","volume":"183","author":"W.R. Pearson","year":"1990","unstructured":"Pearson, W.R.: Rapid and sensitive sequence comparison with FASTP and FASTA. Methods in Enzymology\u00a0183, 63\u201398 (1990)","journal-title":"Methods in Enzymology"},{"key":"60_CR13","doi-asserted-by":"crossref","unstructured":"Puglisi, S.J., Smyth, W.F., Turpin, A.H.: A taxonomy of suffix array construction algorithms. ACM Comput. Surv.\u00a039(2) (July 2007)","DOI":"10.1145\/1242471.1242472"},{"key":"60_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/11408079_4","volume-title":"Database Systems for Advanced Applications","author":"X. Cao","year":"2005","unstructured":"Cao, X., Li, S.C., Tung, A.K.H.: Indexing DNA Sequences Using q-Grams. In: Zhou, L.-Z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol.\u00a03453, pp. 4\u201316. Springer, Heidelberg (2005)"}],"container-title":["IFIP Advances in Information and Communication Technology","Artificial Intelligence Applications and Innovations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33412-2_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:08:02Z","timestamp":1620115682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33412-2_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334115","9783642334122"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33412-2_60","relation":{},"ISSN":["1868-4238","1861-2288"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1861-2288"}],"subject":[],"published":{"date-parts":[[2012]]}}}