{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T22:29:25Z","timestamp":1772058565560,"version":"3.50.1"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030897154","type":"print"},{"value":"9783030897161","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89716-1_8","type":"book-chapter","created":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T13:08:02Z","timestamp":1635167282000},"page":"115-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Absent Subsequences in Words"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2165-2695","authenticated-orcid":false,"given":"Maria","family":"Kosche","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6002-1581","authenticated-orcid":false,"given":"Tore","family":"Ko\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6094-3324","authenticated-orcid":false,"given":"Florin","family":"Manea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7509-8135","authenticated-orcid":false,"given":"Stefan","family":"Siemer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,22]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Ayad, L.A., Badkobeh, G., Fici, G., H\u00e9liou, A., Pissis, S.P.: Constructing antidictionaries in output-sensitive space. In: 2019 Data Compression Conference (DCC), pp. 538\u2013547. IEEE (2019)","DOI":"10.1109\/DCC.2019.00062"},{"key":"8_CR2","unstructured":"Badkobeh, G., Charalampopoulos, P., Pissis, S.: Internal shortest absent word queries. In: Proceeding of the CPM 2021 (2021)"},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0304-3975(91)90358-9","volume":"78","author":"RA Baeza-Yates","year":"1991","unstructured":"Baeza-Yates, R.A.: Searching subsequences. Theor. Comput. Sci. 78(2), 363\u2013376 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Barker, L., Fleischmann, P., Harwardt, K., Manea, F., Nowotka, D.: Scattered factor-universality of words. In: Jonoska, N., Savchuk, D. (eds.) DLT 2020. LNCS, vol. 12086, pp. 14\u201328. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-48516-0_2","DOI":"10.1007\/978-3-030-48516-0_2"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-014-0388-9","volume":"15","author":"C Barton","year":"2014","unstructured":"Barton, C., Heliou, A., Mouchard, L., Pissis, S.P.: Linear-time computation of minimal absent words using suffix array. BMC Bioinformatics 15(1), 1\u201310 (2014). https:\/\/doi.org\/10.1186\/s12859-014-0388-9","journal-title":"BMC Bioinformatics"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-319-32152-3_23","volume-title":"Parallel Processing and Applied Mathematics","author":"C Barton","year":"2016","unstructured":"Barton, C., Heliou, A., Mouchard, L., Pissis, S.P.: Parallelising the computation of minimal absent words. In: Wyrzykowski, R., Deelman, E., Dongarra, J., Karczewski, K., Kitowski, J., Wiatr, K. (eds.) PPAM 2015. LNCS, vol. 9574, pp. 243\u2013253. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-32152-3_23"},{"key":"8_CR7","unstructured":"Ben-Amram, A.M.: The Euler path to static level-ancestors. CoRR abs\/0909.1030 (2009). http:\/\/arxiv.org\/abs\/0909.1030"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.tcs.2003.05.002","volume":"321","author":"MA Bender","year":"2004","unstructured":"Bender, M.A., Farach-Colton, M.: The level ancestor problem simplified. Theor. Comput. Sci. 321(1), 5\u201312 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2003.05.002","journal-title":"Theor. Comput. Sci."},{"key":"8_CR9","unstructured":"Bernardini, G., Marchetti-Spaccamela, A., Pissis, S., Stougie, L., Sweering, M.: Constructing strings avoiding forbidden substrings. In: Proceeding of the CPM 2021 (2021)"},{"key":"8_CR10","unstructured":"Bringmann, K., Chaudhury, B.R.: Sketching, streaming, and fine-grained complexity of (weighted) LCS. In: Proceedings FSTTCS 2018. LIPIcs, vol. 122, pp. 40:1\u201340:16 (2018)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Bringmann, K., K\u00fcnnemann, M.: Multivariate fine-grained complexity of longest common subsequence. In: Proceedings of the SODA 2018, pp. 1216\u20131235 (2018)","DOI":"10.1137\/1.9781611975031.79"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.tcs.2012.04.031","volume":"450","author":"S Chairungsee","year":"2012","unstructured":"Chairungsee, S., Crochemore, M.: Using minimal absent words to build phylogeny. Theoret. Comput. Sci. 450, 109\u2013116 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ic.2018.06.002","volume":"262","author":"P Charalampopoulos","year":"2018","unstructured":"Charalampopoulos, P., Crochemore, M., Fici, G., Merca\u015f, R., Pissis, S.P.: Alignment-free sequence comparison using absent words. Inf. Comput. 262, 57\u201368 (2018)","journal-title":"Inf. Comput."},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-030-00479-8_11","volume-title":"String Processing and Information Retrieval","author":"P Charalampopoulos","year":"2018","unstructured":"Charalampopoulos, P., Crochemore, M., Pissis, S.P.: On extended special factors of a word. In: Gagie, T., Moffat, A., Navarro, G., Cuadros-Vargas, E. (eds.) SPIRE 2018. LNCS, vol. 11147, pp. 131\u2013138. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00479-8_11"},{"key":"8_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2019.104461","volume":"270","author":"M Crochemore","year":"2020","unstructured":"Crochemore, M., H\u00e9liou, A., Kucherov, G., Mouchard, L., Pissis, S.P., Ramusat, Y.: Absent words in a sliding window with applications. Inf. Comput. 270, 104461 (2020)","journal-title":"Inf. Comput."},{"issue":"3\u20134","key":"8_CR16","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S1570-8667(03)00029-7","volume":"1","author":"M Crochemore","year":"2003","unstructured":"Crochemore, M., Melichar, B., Tron\u00edcek, Z.: Directed acyclic subsequence graph - overview. J. Discrete Algorithms 1(3\u20134), 255\u2013280 (2003)","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0020-0190(98)00104-5","volume":"67","author":"M Crochemore","year":"1998","unstructured":"Crochemore, M., Mignosi, F., Restivo, A.: Automata and forbidden words. Inf. Process. Lett. 67(3), 111\u2013117 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"11","key":"8_CR18","doi-asserted-by":"publisher","first-page":"1756","DOI":"10.1109\/5.892711","volume":"88","author":"M Crochemore","year":"2000","unstructured":"Crochemore, M., Mignosi, F., Restivo, A., Salemi, S.: Data compression using antidictionaries. Proc. IEEE 88(11), 1756\u20131768 (2000)","journal-title":"Proc. IEEE"},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"Day, J.D., Fleischmann, P., Kosche, M., Ko\u00df, T., Manea, F., Siemer, S.: The edit distance to k-subsequence universality. In: Bl\u00e4ser, M., Monmege, B. (eds.) 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, 16\u201319 March, 2021, Saarbr\u00fccken, Germany (Virtual Conference). LIPIcs, vol. 187, pp. 25:1\u201325:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2021.25","DOI":"10.4230\/LIPIcs.STACS.2021.25"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-030-32686-9_11","volume-title":"String Processing and Information Retrieval","author":"G Fici","year":"2019","unstructured":"Fici, G., Gawrychowski, P.: Minimal absent words in rooted and unrooted trees. In: Brisaboa, N.R., Puglisi, S.J. (eds.) SPIRE 2019. LNCS, vol. 11811, pp. 152\u2013161. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32686-9_11"},{"issue":"1\u20133","key":"8_CR21","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.tcs.2006.03.006","volume":"359","author":"G Fici","year":"2006","unstructured":"Fici, G., Mignosi, F., Restivo, A., Sciortino, M.: Word assembly through minimal forbidden words. Theoret. Comput. Sci. 359(1\u20133), 214\u2013230 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.tcs.2018.05.037","volume":"792","author":"G Fici","year":"2019","unstructured":"Fici, G., Restivo, A., Rizzo, L.: Minimal forbidden factors of circular words. Theoret. Comput. Sci. 792, 144\u2013153 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR23","unstructured":"Fleischer, L., Kufleitner, M.: Testing Simon\u2019s congruence. In: Proceedings of the MFCS 2018. LIPIcs, vol. 117, pp. 62:1\u201362:13 (2018)"},{"key":"8_CR24","unstructured":"Freydenberger, D.D., Gawrychowski, P., Karhum\u00e4ki, J., Manea, F., Rytter, W.: Testing k-binomial equivalence. In: Multidisciplinary Creativity, a Collection of Papers Dedicated to G. P\u0103un 65th Birthday, pp. 239\u2013248 (2015). CoRR abs\/1509.00622"},{"key":"8_CR25","unstructured":"Fujishige, Y., Tsujimaru, Y., Inenaga, S., Bannai, H., Takeda, M.: Computing dawgs and minimal absent words in linear time for integer alphabets. In: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BFb0029795","volume-title":"Combinatorial Pattern Matching","author":"E Garel","year":"1993","unstructured":"Garel, E.: Minimal separators of two words. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) CPM 1993. LNCS, vol. 684, pp. 35\u201353. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/BFb0029795"},{"key":"8_CR27","doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Kosche, M., Ko\u00df, T., Manea, F., Siemer, S.: Efficiently testing simon\u2019s congruence. In: Bl\u00e4ser, M., Monmege, B. (eds.) 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16\u201319, 2021, Saarbr\u00fccken, Germany (Virtual Conference). LIPIcs, vol. 187, pp. 34:1\u201334:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2021.34","DOI":"10.4230\/LIPIcs.STACS.2021.34"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Halfon, S., Schnoebelen, P., Zetzsche, G.: Decidability, complexity, and expressiveness of first-order logic over the subword ordering. In: Proceeding of the LICS 2017, pp. 1\u201312 (2017)","DOI":"10.1109\/LICS.2017.8005141"},{"issue":"1","key":"8_CR29","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(91)90170-7","volume":"82","author":"JJ Hebrard","year":"1991","unstructured":"Hebrard, J.J.: An algorithm for distinguishing efficiently bit-strings by their subsequences. Theoret. Comput. Sci. 82(1), 35\u201349 (1991)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"8_CR30","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.ipl.2014.11.008","volume":"115","author":"P Karandikar","year":"2015","unstructured":"Karandikar, P., Kufleitner, M., Schnoebelen, P.: On the index of Simon\u2019s congruence for piecewise testability. Inf. Process. Lett. 115(4), 515\u2013519 (2015)","journal-title":"Inf. Process. Lett."},{"key":"8_CR31","unstructured":"Karandikar, P., Schnoebelen, P.: The height of piecewise-testable languages with applications in logical complexity. In: Proceedings of the CSL 2016. LIPIcs, vol. 62, pp. 37:1\u201337:22 (2016)"},{"key":"8_CR32","unstructured":"Karandikar, P., Schnoebelen, P.: The height of piecewise-testable languages and the complexity of the logic of subwords. Log. Methods Comput. Sci. 15(2) (2019)"},{"key":"8_CR33","doi-asserted-by":"publisher","unstructured":"Kitaev, S.: Patterns in Permutations and Words. Monographs in Theoretical Computer Science. An EATCS Series, Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-17333-2","DOI":"10.1007\/978-3-642-17333-2"},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Kosche, M., Ko\u00df, T., Manea, F., Siemer, S.: Absent subsequences in words. CoRR to appear (2021)","DOI":"10.1007\/978-3-030-89716-1_8"},{"key":"8_CR35","doi-asserted-by":"publisher","unstructured":"Kuske, D.: The subtrace order and counting first-order logic. In: Fernau, H. (ed.) CSR 2020. LNCS, vol. 12159, pp. 289\u2013302. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-50026-9_21","DOI":"10.1007\/978-3-030-50026-9_21"},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"Kuske, D., Zetzsche, G.: Languages ordered by the subword order. In: Proceedings of the FOSSACS 2019. Lecture Notes in Computer Science, vol. 11425, pp. 348\u2013364 (2019)","DOI":"10.1007\/978-3-030-17127-8_20"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Lejeune, M., Leroy, J., Rigo, M.: Computing the k-binomial complexity of the Thue-Morse word. In: Proceedings of the DLT 2019. Lecture Notes in Computer Science, vol. 11647, pp. 278\u2013291 (2019)","DOI":"10.1007\/978-3-030-24886-4_21"},{"key":"8_CR38","doi-asserted-by":"crossref","unstructured":"Leroy, J., Rigo, M., Stipulanti, M.: Generalized Pascal triangle for binomial coefficients of words. Electron. J. Combin. 24(1.44), 36 (2017)","DOI":"10.37236\/6581"},{"issue":"2","key":"8_CR39","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D Maier","year":"1978","unstructured":"Maier, D.: The complexity of some problems on subsequences and supersequences. J. ACM 25(2), 322\u2013336 (1978)","journal-title":"J. ACM"},{"issue":"1","key":"8_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2003.04.001","volume":"68","author":"A Mateescu","year":"2004","unstructured":"Mateescu, A., Salomaa, A., Yu, S.: Subword histories and Parikh matrices. J. Comput. Syst. Sci. 68(1), 1\u201321 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\u20132","key":"8_CR41","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(00)00436-9","volume":"273","author":"F Mignosi","year":"2002","unstructured":"Mignosi, F., Restivo, A., Sciortino, M.: Words and forbidden factors. Theoret. Comput. Sci. 273(1\u20132), 99\u2013117 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR42","doi-asserted-by":"publisher","unstructured":"Mieno, T., et al.: Minimal unique substrings and minimal absent words in a sliding window. In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020. LNCS, vol. 12011, pp. 148\u2013160. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38919-2_13","DOI":"10.1007\/978-3-030-38919-2_13"},{"key":"8_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-540-24698-5_4","volume-title":"LATIN 2004: Theoretical Informatics","author":"Jean-Eric Pin","year":"2004","unstructured":"Pin, Jean-Eric.: The consequences of IMRE Simon\u2019s work in the theory of automata, languages, and semigroups. In: Farach-Colton, Mart\u00edn (ed.) LATIN 2004. LNCS, vol. 2976, p. 5. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24698-5_4"},{"issue":"1","key":"8_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00233-019-09999-8","volume":"98","author":"Jean-\u00c9ric Pin","year":"2019","unstructured":"Pin, Jean-\u00c9ric: The influence of IMRE Simon\u2019s work in the theory of automata, languages and semigroups. Semigroup Forum 98(1), 1\u20138 (2019). https:\/\/doi.org\/10.1007\/s00233-019-09999-8","journal-title":"Semigroup Forum"},{"key":"8_CR45","doi-asserted-by":"crossref","unstructured":"Pratas, D., Silva, J.M.: Persistent minimal sequences of SARS-CoV-2. Bioinformatics (2020)","DOI":"10.1093\/bioinformatics\/btaa686"},{"key":"8_CR46","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2015.07.025","volume":"601","author":"M Rigo","year":"2015","unstructured":"Rigo, M., Salimov, P.: Another generalization of abelian equivalence: binomial complexity of infinite words. Theor. Comput. Sci. 601, 47\u201357 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR47","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J., Simon, I.: Subwords. In: Lothaire, M. (ed.) Combinatorics on Words, chap. 6, pp. 105\u2013142. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511566097.009"},{"issue":"2","key":"8_CR48","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.tcs.2005.03.024","volume":"340","author":"A Salomaa","year":"2005","unstructured":"Salomaa, A.: Connections between subwords and certain matrix mappings. Theoret. Comput. Sci. 340(2), 188\u2013203 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR49","unstructured":"Sankoff, D., Kruskal, J.: Time Warps, String Edits, and Macromolecules The Theory and Practice of Sequence Comparison. Cambridge University Press, Cambridge (2000), Originally Published in 1983"},{"key":"8_CR50","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.tcs.2011.10.017","volume":"418","author":"S Seki","year":"2012","unstructured":"Seki, S.: Absoluteness of subword inequality is undecidable. Theor. Comput. Sci. 418, 116\u2013120 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"15","key":"8_CR51","doi-asserted-by":"publisher","first-page":"2421","DOI":"10.1093\/bioinformatics\/btv189","volume":"31","author":"RM Silva","year":"2015","unstructured":"Silva, R.M., Pratas, D., Castro, L., Pinho, A.J., Ferreira, P.J.: Three minimal sequences found in Ebola virus genomes and absent from human DNA. Bioinformatics 31(15), 2421\u20132425 (2015)","journal-title":"Bioinformatics"},{"key":"8_CR52","unstructured":"Simon, I.: Hierarchies of events with dot-depth one - Ph.D. Thesis. University of Waterloo (1972)"},{"key":"8_CR53","doi-asserted-by":"crossref","unstructured":"Simon, I.: Piecewise testable events. In: Automata Theory and Formal Languages, 2nd GI Conference LNCS, vol. 33, pp. 214-222 (1975)","DOI":"10.1007\/3-540-07407-4_23"},{"key":"8_CR54","unstructured":"Simon, I.: Words distinguished by their subwords (extended abstract). In: Proceedings of the WORDS 2003. TUCS General Publication, vol. 27, pp. 6\u201313 (2003)"},{"key":"8_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-44977-9_28","volume-title":"Implementation and Application of Automata","author":"Z Troni\u0109ek","year":"2003","unstructured":"Troni\u0109ek, Z.: Common subsequence automaton. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol. 2608, pp. 270\u2013275. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44977-9_28"},{"issue":"1","key":"8_CR56","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168\u2013173 (1974)","journal-title":"J. ACM"},{"key":"8_CR57","unstructured":"Zetzsche, G.: The complexity of downward closure comparisons. In: Proceedings of the ICALP 2016. LIPIcs, vol. 55, pp. 123:1\u2013123:14 (2016)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89716-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T17:46:27Z","timestamp":1673631987000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89716-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030897154","9783030897161"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89716-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Liverpool","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rp2021.csc.liv.ac.uk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}