{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T04:09:22Z","timestamp":1751342962496,"version":"3.41.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031970993","type":"print"},{"value":"9783031971006","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-97100-6_3","type":"book-chapter","created":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T14:08:46Z","timestamp":1751292526000},"page":"34-49","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["k-Local Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3313-0752","authenticated-orcid":false,"given":"Christian","family":"Beth","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1531-7970","authenticated-orcid":false,"given":"Pamela","family":"Fleischmann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0005-1145-5806","authenticated-orcid":false,"given":"Annika","family":"Huch","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2063-2756","authenticated-orcid":false,"given":"Daniyal","family":"Kazempour","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5646-3299","authenticated-orcid":false,"given":"Peer","family":"Kr\u00f6ger","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Kulow","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2024-7700","authenticated-orcid":false,"given":"Matthias","family":"Renz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,29]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47\u201397 (2002)","journal-title":"Rev. Mod. Phys."},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D Angluin","year":"1980","unstructured":"Angluin, D.: Finding patterns common to a set of strings. J. Comput. Syst. Sci. 21(1), 46\u201362 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5439","key":"3_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"3_CR4","unstructured":"Casel, K., Day, J.D., Fleischmann, P., Kociumaka, T., Manea, F., Schmid, M.L.: Graph and string parameters: connections between pathwidth, cutwidth and the locality number. In: ICALP. LIPIcs, vol.\u00a0132, pp. 109:1\u2013109:16 (2019)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on strings. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511546853"},{"key":"3_CR6","unstructured":"Day, J.D., Fleischmann, P., Manea, F., Nowotka, D.: Local patterns. In: IARCS. LIPIcs, vol.\u00a093, pp. 24:1\u201324:14 (2017)"},{"issue":"1","key":"3_CR7","first-page":"17","volume":"5","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., R\u00e9nyi, A., et al.: On the evolution of random graphs. Publ. math. inst. hung. acad. sci 5(1), 17\u201360 (1960)","journal-title":"Publ. math. inst. hung. acad. sci"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Fleischmann, P., Haschke, L., L\u00f6ck, T., Nowotka, D.: Word-representable graphs from a word\u2019s perspective. In: SOFSEM 2024. LNCS, vol. 14519, pp. 255\u2013268. Springer (2024). (accepted at Acta Informatica)","DOI":"10.1007\/978-3-031-52113-3_18"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Fleischmann, P., Haschke, L., Manea, F., Nowotka, D., Tsida, C.T., Wiedenbeck, J.: Blocksequences of k-local words. In: SOFSEM 2021. Springer International Publishing (2021)","DOI":"10.1007\/978-3-030-67731-2_9"},{"issue":"4","key":"3_CR10","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1038\/scientificamerican0476-126","volume":"234","author":"M Gardner","year":"1976","unstructured":"Gardner, M.: Mathematical games. Sci. Am. 234(4), 126\u2013131 (1976)","journal-title":"Sci. Am."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/gb-2008-9-8-r128","volume":"9","author":"M Hamady","year":"2008","unstructured":"Hamady, M., Widmann, J., Copley, S., Knight, R.: MotifCluster: an interactive online tool for clustering and visualizing sequences using shared motifs. Genome Biol. 9, 1\u201313 (2008)","journal-title":"Genome Biol."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Mamoulis, N.: Co-location Patterns, Algorithms, pp. 103\u2013107. Springer US, Boston, MA (2008)","DOI":"10.1007\/978-0-387-35973-1_152"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Masrur, A., Thakur, G., Sparks, K., P., R., Peuquet, D.: Co-location pattern mining of geosocial data to characterize urban functional spaces. In: Big Data, pp. 4099\u20134102. IEEE (2019)","DOI":"10.1109\/BigData47090.2019.9006263"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Morimoto, Y.: Mining frequent neighboring class sets in spatial databases. In: SIGKDD, pp. 353\u2013358 (2001)","DOI":"10.1145\/502512.502564"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"P Rousseeuw","year":"1987","unstructured":"Rousseeuw, P.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20, 53\u201365 (1987)","journal-title":"J. Comput. Appl. Math."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Shekhar, S., Huang, Y.: Discovering spatial co-location patterns: a summary of results. In: SSTD, pp. 236\u2013256. Springer (2001)","DOI":"10.1007\/3-540-47724-1_13"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TKDE.2016.2598561","volume":"29","author":"C Shi","year":"2016","unstructured":"Shi, C., Li, Y., Zhang, J., Sun, Y., Philip, S.Y.: A survey of heterogeneous information network analysis. IEEE Trans. Knowl. Data Eng. 29(1), 17\u201337 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR18","unstructured":"Shinohara, T.: Polynomial time inference of pattern languages and its applications. In: MFCS, pp. 191\u2013209 (1982)"},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","volume":"16","author":"R Sibson","year":"1973","unstructured":"Sibson, R.: SLINK: an optimally efficient algorithm for the single-link cluster method. Comput. J. 16(1), 30\u201334 (1973)","journal-title":"Comput. J."},{"issue":"11","key":"3_CR20","doi-asserted-by":"publisher","first-page":"992","DOI":"10.14778\/3402707.3402736","volume":"4","author":"Y Sun","year":"2011","unstructured":"Sun, Y., Han, J., Yan, X., Yu, P.S., Wu, T.: PathSim: meta path-based top-k similarity search in heterogeneous information networks. Proc. VLDB Endowment 4(11), 992\u20131003 (2011)","journal-title":"Proc. VLDB Endowment"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1017\/S0370164600044643","volume":"10","author":"P Tait","year":"1880","unstructured":"Tait, P.: Remarks on the colourings of maps. Proc. R. Soc. Edinburgh 10, 729\u2013729 (1880)","journal-title":"Proc. R. Soc. Edinburgh"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440\u2013442 (1998)","DOI":"10.1038\/30918"},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TCBB.2022.3158471","volume":"20","author":"Q Yu","year":"2022","unstructured":"Yu, Q., Zhang, X., Hu, Y., Chen, S., Yang, L.: A method for predicting DNA motif length based on deep learning. EEE\/ACM Trans. Comput. Biol. Bioinform. 20(1), 61\u201373 (2022)","journal-title":"EEE\/ACM Trans. Comput. Biol. Bioinform."}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97100-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T14:08:48Z","timestamp":1751292528000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97100-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031970993","9783031971006"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97100-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"29 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Loughborough","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.lboro.ac.uk\/departments\/compsci\/events\/dcfs-2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}