{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:17:56Z","timestamp":1771024676923,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319537320","type":"print"},{"value":"9783319537337","type":"electronic"}],"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-53733-7_9","type":"book-chapter","created":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T05:39:21Z","timestamp":1487137161000},"page":"131-142","source":"Crossref","is-referenced-by-count":13,"title":["Efficient Pattern Matching in Elastic-Degenerate Texts"],"prefix":"10.1007","author":[{"given":"Costas S.","family":"Iliopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ritu","family":"Kundu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Solon P.","family":"Pissis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,16]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/S0022-0000(05)80047-9","volume":"49","author":"A Amir","year":"1994","unstructured":"Amir, A., Farach, M., Galil, Z., Giancarlo, R., Park, K.: Dynamic dictionary matching. J. Comput. Syst. Sci. 49(2), 208\u2013222 (1994). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000005800479","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9_CR2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1186\/s13059-015-0587-3","volume":"16","author":"DM Church","year":"2015","unstructured":"Church, D.M., Schneider, V.A., Steinberg, K.M., Schatz, M.C., Quinlan, A.R., Chin, C.S., Kitts, P.A., Aken, B., Marth, G.T., Hoffman, M.M., Herrero, J., Mendoza, M.L.Z., Durbin, R., Flicek, P.: Extending reference assembly models. Genome Biol. 16(1), 13 (2015). http:\/\/dx.doi.org\/10.1186\/s13059-015-0587-3","journal-title":"Genome Biol."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings, 392 p. Cambridge University Press, Cambridge (2007)","DOI":"10.1017\/CBO9780511546853"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Sagot, M.F.: Motifs in Sequences: Localization and Extraction, pp. 47\u201397. Marcel Dekker, New York (2004)","DOI":"10.1201\/9780203021415.ch3"},{"issue":"6","key":"9_CR5","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1038\/ng.3257","volume":"47","author":"A Dilthey","year":"2015","unstructured":"Dilthey, A., Cox, C., Iqbal, Z., Nelson, M.R., McVean, G.: Improved genome inference in the MHC using a population reference graph. Nat. Genet. 47(6), 682\u2013688 (2015). Technical report, http:\/\/dx.doi.org\/10.1038\/ng.3257","journal-title":"Nat. Genet."},{"key":"9_CR6","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)"},{"issue":"2","key":"9_CR7","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"HT Harel","year":"1984","unstructured":"Harel, H.T., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13(2), 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"issue":"13","key":"9_CR8","doi-asserted-by":"crossref","first-page":"i361","DOI":"10.1093\/bioinformatics\/btt215","volume":"29","author":"L Huang","year":"2013","unstructured":"Huang, L., Popic, V., Batzoglou, S.: Short read alignment with populations of genomes. Bioinformatics 29(13), i361\u2013i370 (2013). http:\/\/bioinformatics.oxfordjournals.org\/content\/29\/13\/i361.abstract","journal-title":"Bioinformatics"},{"issue":"2","key":"9_CR9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977). http:\/\/dx.doi.org\/10.1137\/0206024","journal-title":"SIAM J. Comput."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Li, Y., Bailey, J., Kulik, L., Pei, J.: Efficient matching of substrings in uncertain sequences. In: Zaki, M.J., Obradovic, Z., Tan, P., Banerjee, A., Kamath, C., Parthasarathy, S. (eds.) Proceedings of 2014 SIAM International Conference on Data Mining, 24\u201326 April 2014, pp. 767\u2013775. SIAM, Philadelphia (2014). http:\/\/dx.doi.org\/10.1137\/1.9781611973440.88","DOI":"10.1137\/1.9781611973440.88"},{"issue":"1","key":"9_CR11","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1186\/1471-2164-15-685","volume":"15","author":"Y Liu","year":"2014","unstructured":"Liu, Y., Koyut\u00fcrk, M., Maxwell, S., Xiang, M., Veigl, M., Cooper, R.S., Tayo, B.O., Li, L., LaFramboise, T., Wang, Z., Zhu, X., Chance, M.R.: Discovery of common sequences absent in the human reference genome using pooled samples from next generation sequencing. BMC Genomics 15(1), 685 (2014). http:\/\/dx.doi.org\/10.1186\/1471-2164-15-685","journal-title":"BMC Genomics"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-319-43681-4_18","volume-title":"Algorithms in Bioinformatics","author":"S Maciuca","year":"2016","unstructured":"Maciuca, S., del Ojo Elias, C., McVean, G., Iqbal, Z.: A natural encoding of genetic variation in a burrows-wheeler transform to enable mapping and genome inference. In: Frith, M., Storm Pedersen, C.N. (eds.) WABI 2016. LNCS, vol. 9838, pp. 222\u2013233. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-43681-4_18"},{"issue":"2","key":"9_CR13","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"EM McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM (JACM) 23(2), 262\u2013272 (1976)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"9_CR14","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1186\/1471-2105-15-235","volume":"15","author":"SP Pissis","year":"2014","unstructured":"Pissis, S.P.: MoTeX-II: structured MoTif eXtraction from large-scale datasets. BMC Bioinform. 15(1), 235 (2014). http:\/\/dx.doi.org\/10.1186\/1471-2105-15-235","journal-title":"BMC Bioinform."},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/11809678_17","volume-title":"Computing and Combinatorics","author":"MS Rahman","year":"2006","unstructured":"Rahman, M.S., Iliopoulos, C.S., Lee, I., Mohamed, M., Smyth, W.F.: Finding patterns with variable length gaps or don\u2019t cares. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 146\u2013155. Springer, Heidelberg (2006). doi: 10.1007\/11809678_17"},{"issue":"6","key":"9_CR16","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput. 17(6), 1253\u20131262 (1988). http:\/\/dx.doi.org\/10.1137\/0217079","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9_CR17","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":"9_CR18","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proceedings of 14th IEEE Annual Symposium on Switching and Automata Theory, pp. 1\u201311. Institute of Electrical Electronics Engineer (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53733-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T14:18:39Z","timestamp":1568816319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53733-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319537320","9783319537337"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53733-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}