{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:57:36Z","timestamp":1743130656954,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030250263"},{"type":"electronic","value":"9783030250270"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25027-0_15","type":"book-chapter","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:04:09Z","timestamp":1564617849000},"page":"213-228","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Circular Pattern Matching with k Mismatches"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6024-1557","authenticated-orcid":false,"given":"Panagiotis","family":"Charalampopoulos","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2477-1702","authenticated-orcid":false,"given":"Tomasz","family":"Kociumaka","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1445-1932","authenticated-orcid":false,"given":"Solon P.","family":"Pissis","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0067-6401","authenticated-orcid":false,"given":"Jakub","family":"Radoszewski","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9162-6724","authenticated-orcid":false,"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2207-0053","authenticated-orcid":false,"given":"Juliusz","family":"Straszy\u0144ski","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7369-3309","authenticated-orcid":false,"given":"Tomasz","family":"Wale\u0144","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1988-3507","authenticated-orcid":false,"given":"Wiktor","family":"Zuba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"issue":"6","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/0216067","volume":"16","author":"KR Abrahamson","year":"1987","unstructured":"Abrahamson, K.R.: Generalized string matching. SIAM J. Comput. 16(6), 1039\u20131051 (1987). https:\/\/doi.org\/10.1137\/0216067","journal-title":"SIAM J. Comput."},{"issue":"2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0196-6774(03)00097-X","volume":"50","author":"A Amir","year":"2004","unstructured":"Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with $$k$$ mismatches. J. Algorithms 50(2), 257\u2013275 (2004). https:\/\/doi.org\/10.1016\/S0196-6774(03)00097-X","journal-title":"J. Algorithms"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.patrec.2017.01.018","volume":"88","author":"LAK Ayad","year":"2017","unstructured":"Ayad, L.A.K., Barton, C., Pissis, S.P.: A faster and more accurate heuristic for cyclic edit distance computation. Pattern Recognit. Lett. 88, 81\u201387 (2017). https:\/\/doi.org\/10.1016\/j.patrec.2017.01.018","journal-title":"Pattern Recognit. Lett."},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1186\/s12864-016-3477-5","volume":"18","author":"LAK Ayad","year":"2017","unstructured":"Ayad, L.A.K., Pissis, S.P.: MARS: improving multiple circular sequence alignment using refined sequences. BMC Genomics 18(1), 86 (2017). https:\/\/doi.org\/10.1186\/s12864-016-3477-5","journal-title":"BMC Genomics"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-319-19048-8_3","volume-title":"Bioinformatics Research and Applications","author":"MAR Azim","year":"2015","unstructured":"Azim, M.A.R., Iliopoulos, C.S., Rahman, M.S., Samiruzzaman, M.: A filter-based approach for approximate circular pattern matching. In: Harrison, R., Li, Y., M\u0103ndoiu, I. (eds.) ISBRA 2015. LNCS, vol. 9096, pp. 24\u201335. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19048-8_3"},{"key":"15_CR6","doi-asserted-by":"publisher","unstructured":"Azim, M.A.R., Iliopoulos, C.S., Rahman, M.S., Samiruzzaman, M.: A fast and lightweight filter-based algorithm for circular pattern matching. In: Baldi, P., Wang, W. (eds.) 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics, BCB 2014, pp. 621\u2013622. ACM (2014). https:\/\/doi.org\/10.1145\/2649387.2660804","DOI":"10.1145\/2649387.2660804"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-20086-6_19","volume-title":"Experimental Algorithms","author":"C Barton","year":"2015","unstructured":"Barton, C., Iliopoulos, C.S., Kundu, R., Pissis, S.P., Retha, A., Vayani, F.: Accurate and efficient methods to improve multiple circular sequence alignment. In: Bampis, E. (ed.) SEA 2015. LNCS, vol. 9125, pp. 247\u2013258. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20086-6_19"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1186\/1748-7188-9-9","volume":"9","author":"C Barton","year":"2014","unstructured":"Barton, C., Iliopoulos, C.S., Pissis, S.P.: Fast algorithms for approximate circular string matching. Algorithms Mol. Biol. 9, 9 (2014). https:\/\/doi.org\/10.1186\/1748-7188-9-9","journal-title":"Algorithms Mol. Biol."},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-319-15579-1_6","volume-title":"Language and Automata Theory and Applications","author":"C Barton","year":"2015","unstructured":"Barton, C., Iliopoulos, C.S., Pissis, S.P.: Average-case optimal approximate circular string matching. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 85\u201396. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15579-1_6"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/1644015.1644018","volume":"6","author":"P Bille","year":"2009","unstructured":"Bille, P., Fagerberg, R., G\u00f8rtz, I.L.: Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts. ACM Trans. Algorithms 6(1), 3:1\u20133:14 (2009). https:\/\/doi.org\/10.1145\/1644015.1644018","journal-title":"ACM Trans. Algorithms"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1137\/1.9781611975482.69","volume-title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Karl Bringmann","year":"2019","unstructured":"Bringmann, K., Wellnitz, P., K\u00fcnnemann, M.: Few matches or almost periodicity: faster pattern matching with mismatches in compressed texts. In: Chan, T.M. (ed.) 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, pp. 1126\u20131145. SIAM (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.69"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-58094-8_23","volume-title":"Combinatorial Pattern Matching","author":"WI Chang","year":"1994","unstructured":"Chang, W.I., Marr, T.G.: Approximate string matching and local similarity. In: Crochemore, M., Gusfield, D. (eds.) CPM 1994. LNCS, vol. 807, pp. 259\u2013273. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58094-8_23"},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"Clifford, R., Fontaine, A., Porat, E., Sach, B., Starikovskaya, T.: The $$k$$-mismatch problem revisited. In: Krauthgamer, R. (ed.) 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, pp. 2039\u20132052. SIAM (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.ch142","DOI":"10.1137\/1.9781611974331.ch142"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.1137\/1.9781611975482.68","volume-title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Raphael Clifford","year":"2019","unstructured":"Clifford, R., Kociumaka, T., Porat, E.: The streaming $$k$$-mismatch problem. In: Chan, T.M. (ed.) 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, pp. 1106\u20131125. SIAM (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.68"},{"key":"15_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511546853","volume-title":"Algorithms on Strings","author":"M Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007). https:\/\/doi.org\/10.1017\/cbo9780511546853"},{"issue":"3","key":"15_CR16","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"ML Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J., Szemer\u00e9di, E.: Storing a sparse table with $$\\cal{O}(1)$$ worst case access time. J. ACM 31(3), 538\u2013544 (1984). https:\/\/doi.org\/10.1145\/828.1884","journal-title":"J. ACM"},{"issue":"es","key":"15_CR17","doi-asserted-by":"publisher","first-page":"1.4","DOI":"10.1145\/1005813.1041513","volume":"9","author":"Kimmo Fredriksson","year":"2005","unstructured":"Fredriksson, K., Navarro, G.: Average-optimal single and multiple approximate string matching. ACM J. Exp. Algorithmics 9(1.4), 1\u201347 (2004). https:\/\/doi.org\/10.1145\/1005813.1041513","journal-title":"Journal of Experimental Algorithmics"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/0304-3975(87)90042-9","volume":"51","author":"Z Galil","year":"1987","unstructured":"Galil, Z., Giancarlo, R.: Parallel string matching with $$k$$ mismatches. Theor. Comput. Sci. 51, 341\u2013348 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90042-9","journal-title":"Theor. Comput. Sci."},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-45030-3_8","volume-title":"Algorithms and Computation","author":"P Gawrychowski","year":"2013","unstructured":"Gawrychowski, P., Straszak, D.: Beating $$\\cal{O}(nm)$$ in approximate LZW-compressed pattern matching. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol. 8283, pp. 78\u201388. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45030-3_8"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.tcs.2015.08.022","volume":"638","author":"P Gawrychowski","year":"2016","unstructured":"Gawrychowski, P., Uzna\u0144ski, P.: Order-preserving pattern matching with $$k$$ mismatches. Theor. Comput. Sci. 638, 136\u2013144 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2015.08.022","journal-title":"Theor. Comput. Sci."},{"key":"15_CR21","doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Uzna\u0144ski, P.: Towards unified approximate pattern matching for Hamming and $${L}_1$$ distance. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) Automata, Languages, and Programming, ICALP 2018. LIPIcs, vol. 107, pp. 62:1\u201362:13. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.62","DOI":"10.4230\/LIPIcs.ICALP.2018.62"},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1186\/s13015-016-0076-6","volume":"11","author":"R Grossi","year":"2016","unstructured":"Grossi, R., Iliopoulos, C.S., Mercas, R., Pisanti, N., Pissis, S.P., Retha, A., Vayani, F.: Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11, 12 (2016). https:\/\/doi.org\/10.1186\/s13015-016-0076-6","journal-title":"Algorithms Mol. Biol."},{"issue":"3","key":"15_CR23","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/1273340.1273345","volume":"3","author":"C Hazay","year":"2007","unstructured":"Hazay, C., Lewenstein, M., Sokol, D.: Approximate parameterized matching. ACM Trans. Algorithms 3(3), 29 (2007). https:\/\/doi.org\/10.1145\/1273340.1273345","journal-title":"ACM Trans. Algorithms"},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3129536","volume":"22","author":"T Hirvola","year":"2017","unstructured":"Hirvola, T., Tarhio, J.: Bit-parallel approximate matching of circular strings with k mismatches. ACM J. Exp. Algorithmics 22, 1\u20135 (2017). https:\/\/doi.org\/10.1145\/3129536","journal-title":"ACM J. Exp. Algorithmics"},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-59826-0_3","volume-title":"Algorithms for Next-Generation Sequencing Data","author":"CS Iliopoulos","year":"2017","unstructured":"Iliopoulos, C.S., Pissis, S.P., Rahman, M.S.: Searching and indexing circular patterns. In: Elloumi, M. (ed.) Algorithms for Next-Generation Sequencing Data, pp. 77\u201390. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59826-0_3"},{"key":"15_CR26","unstructured":"Kociumaka, T.: Efficient data structures for internal queries in texts. Ph.D. thesis, University of Warsaw, October 2018. https:\/\/www.mimuw.edu.pl\/~kociumaka\/files\/phd.pdf"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Straszy\u0144ski, J., Wale\u0144, T., Zuba, W.: Efficient representation and counting of antipower factors in words (2018). http:\/\/arxiv.org\/abs\/1812.08101","DOI":"10.1007\/978-3-030-13435-8_31"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-030-13435-8_31","volume-title":"Language and Automata Theory and Applications","author":"T Kociumaka","year":"2019","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Straszy\u0144ski, J., Wale\u0144, T., Zuba, W.: Efficient representation and counting of antipower factors in words. In: Mart\u00edn-Vide, C., Okhotin, A., Shapira, D. (eds.) LATA 2019. LNCS, vol. 11417, pp. 421\u2013433. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-13435-8_31"},{"key":"15_CR29","doi-asserted-by":"publisher","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: Internal pattern matching queries in a text and applications. In: Indyk, P. (ed.) 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, pp. 532\u2013551. SIAM (2015). https:\/\/doi.org\/10.1137\/1.9781611973730.36","DOI":"10.1137\/1.9781611973730.36"},{"key":"15_CR30","unstructured":"Kosaraju, S.: Efficient string matching (1987, manuscript)"},{"key":"15_CR31","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0304-3975(86)90178-7","volume":"43","author":"GM Landau","year":"1986","unstructured":"Landau, G.M., Vishkin, U.: Efficient string matching with $$k$$ mismatches. Theor. Comput. Sci. 43, 239\u2013249 (1986). https:\/\/doi.org\/10.1016\/0304-3975(86)90178-7","journal-title":"Theor. Comput. Sci."},{"issue":"12","key":"15_CR32","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1016\/j.imavis.2012.08.012","volume":"30","author":"V Palaz\u00f3n-Gonz\u00e1lez","year":"2012","unstructured":"Palaz\u00f3n-Gonz\u00e1lez, V., Marzal, A.: On the dynamic time warping of cyclic sequences for shape retrieval. Image Vision Comput. 30(12), 978\u2013990 (2012). https:\/\/doi.org\/10.1016\/j.imavis.2012.08.012","journal-title":"Image Vision Comput."},{"key":"15_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.patrec.2015.04.013","volume":"62","author":"V Palaz\u00f3n-Gonz\u00e1lez","year":"2015","unstructured":"Palaz\u00f3n-Gonz\u00e1lez, V., Marzal, A.: Speeding up the cyclic edit distance using LAESA with early abandon. Pattern Recognit. Lett. 62, 1\u20137 (2015). https:\/\/doi.org\/10.1016\/j.patrec.2015.04.013","journal-title":"Pattern Recognit. Lett."},{"issue":"7","key":"15_CR34","doi-asserted-by":"publisher","first-page":"2490","DOI":"10.1016\/j.patcog.2014.01.018","volume":"47","author":"V Palaz\u00f3n-Gonz\u00e1lez","year":"2014","unstructured":"Palaz\u00f3n-Gonz\u00e1lez, V., Marzal, A., Vilar, J.M.: On hidden Markov models and cyclic strings for shape recognition. Pattern Recognit. 47(7), 2490\u20132504 (2014). https:\/\/doi.org\/10.1016\/j.patcog.2014.01.018","journal-title":"Pattern Recognit."},{"key":"15_CR35","doi-asserted-by":"publisher","unstructured":"Porat, B., Porat, E.: Exact and approximate pattern matching in the streaming model. In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, pp. 315\u2013323. IEEE Computer Society (2009). https:\/\/doi.org\/10.1109\/FOCS.2009.11","DOI":"10.1109\/FOCS.2009.11"},{"key":"15_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-70575-8_8","volume-title":"Automata, Languages and Programming","author":"M Ru\u017ei\u0107","year":"2008","unstructured":"Ru\u017ei\u0107, M.: Constructing efficient dictionaries in close to sorting time. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 84\u201395. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_8"},{"key":"15_CR37","unstructured":"Tiskin, A.: Threshold approximate matching in grammar-compressed strings. In: Holub, J., Zd\u00e1rek, J. (eds.) Prague Stringology Conference 2014, PSC 2014, pp. 124\u2013138. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague (2014). http:\/\/www.stringology.org\/event\/2014\/p12.html"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25027-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:25:33Z","timestamp":1710336333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-25027-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030250263","9783030250270"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25027-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/di.ku.dk\/fct2019","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}