{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:09:44Z","timestamp":1743026984175,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030485153"},{"type":"electronic","value":"9783030485160"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-48516-0_8","type":"book-chapter","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T23:04:30Z","timestamp":1590447870000},"page":"96-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reconstructing Words from Right-Bounded-Block Words"],"prefix":"10.1007","author":[{"given":"Pamela","family":"Fleischmann","sequence":"first","affiliation":[]},{"given":"Marie","family":"Lejeune","sequence":"additional","affiliation":[]},{"given":"Florin","family":"Manea","sequence":"additional","affiliation":[]},{"given":"Dirk","family":"Nowotka","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Rigo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,26]]},"reference":[{"key":"8_CR1","first-page":"178","volume":"79","author":"J Berstel","year":"2003","unstructured":"Berstel, J., Karhum\u00e4ki, J.: Combinatorics on words - a tutorial. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 79, 178\u2013228 (2003)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci. EATCS"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"2195","DOI":"10.4171\/OWR\/2010\/37","volume":"7","author":"V Berth\u00e9","year":"2010","unstructured":"Berth\u00e9, V., Karhum\u00e4ki, J., Nowotka, D., Shallit, J.: Mini-workshop: combinatorics on words. Oberwolfach Rep. 7, 2195\u20132244 (2010). https:\/\/doi.org\/10.4171\/OWR\/2010\/37","journal-title":"Oberwolfach Rep."},{"key":"8_CR3","unstructured":"Bringmann, K.: Fine-grained complexity theory (tutorial). In: Niedermeier, R., Paul, C. (eds.) 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Leibniz International Proceedings in Informatics, vol. 4, pp. 1\u20137 (2019)"},{"key":"8_CR4","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s00026-004-0232-4","volume":"8","author":"AWM Dress","year":"2004","unstructured":"Dress, A.W.M., Erd\u0151s, P.L.: Reconstructing words from subwords in linear time. Ann. Comb. 8, 457\u2013462 (2004)","journal-title":"Ann. Comb."},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0097-3165(03)00103-1","volume":"103","author":"M Dudik","year":"2003","unstructured":"Dudik, M., Schulman, L.J.: Reconstruction from subsequences. J. Combin. Theory, Ser. A 103, 337\u2013348 (2003)","journal-title":"J. Combin. Theory, Ser. A"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s00026-006-0297-3","volume":"10","author":"PL Erd\u0151s","year":"2006","unstructured":"Erd\u0151s, P.L., Ligeti, P., Sziklai, P., Torney, D.C.: Subwords in reverse-complement order. Ann. Comb. 10, 415\u2013430 (2006)","journal-title":"Ann. Comb."},{"key":"8_CR8","unstructured":"Ferov, M.: Irreducible polynomial modulo $$p$$, Bachelor thesis at Charles University Prague (2008)"},{"key":"8_CR9","unstructured":"Fleischmann, P., Lejeune, M., Manea, F., Nowotka, D., Rigo, M.: Reconstructing words from right-bounded-block words, 21 p. (2020). arXiv:2001.11218"},{"key":"8_CR10","unstructured":"Freydenberger, D.D., Gawrychowski, P., Karhum\u00e4ki, J., Manea, F., Rytter, W.: Testing $$k$$-binomial equivalence. In: Multidisciplinary Creativity: homage to G. P\u0103un on his 65th birthday, pp. 239\u2013248, Ed. Spandugino, Bucharest (2015). arXiv:1509.00622"},{"key":"8_CR11","unstructured":"Harary, F.: On the reconstruction of a graph from a collection of subgraphs. In: Theory of Graphs and its Applications (Proceedings of Symposium Smolenice, 1963), pp. 47\u201352. Publ. House Czechoslovak Acad. Sci., Prague (1964)"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"2047","DOI":"10.1137\/17M1111930","volume":"32","author":"L van Iersel","year":"2018","unstructured":"van Iersel, L., Moulton, V.: Leaf-reconstructibility of phylogenetic networks. SIAM J. Discrete Math. 32, 2047\u20132066 (2018)","journal-title":"SIAM J. Discrete Math."},{"key":"8_CR13","unstructured":"Kalashnik, L.I.: The reconstruction of a word from fragments. In: Numerical Mathematics and Computer Technology, pp. 56\u201357. Akad. Nauk Ukrain. SSR Inst. Mat, Preprint IV (1973)"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"961","DOI":"10.2140\/pjm.1957.7.961","volume":"7","author":"PJ Kelly","year":"1957","unstructured":"Kelly, P.J.: A congruence theorem for trees. Pac. J. Math. 7, 961\u2013968 (1957)","journal-title":"Pac. J. Math."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1006\/jcta.1997.2732","volume":"77","author":"I Krasikov","year":"1997","unstructured":"Krasikov, I., Roditty, Y.: On a reconstruction problem for sequences. J. Combin. Theory Ser. A 77, 344\u2013348 (1997)","journal-title":"J. Combin. Theory Ser. A"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1515\/dma.1992.2.3.241","volume":"2","author":"VI Levenshtein","year":"1992","unstructured":"Levenshtein, V.I.: On perfect codes in deletion and insertion metric. Discret. Math. Appl. 2, 241\u2013258 (1992)","journal-title":"Discret. Math. Appl."},{"key":"8_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Ma\u0148uch, J.: Characterization of a word by its subwords. In: Developments in Language Theory, pp. 210\u2013219. World Scientific (1999)","DOI":"10.1142\/9789812792464_0018"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0012-365X(91)90026-X","volume":"94","author":"B Manvel","year":"1991","unstructured":"Manvel, B., Meyerowitz, A., Schwenk, A., Smith, K., Stockmeyer, P.: Reconstruction of sequences. Discret. Math. 94, 209\u2013219 (1991)","journal-title":"Discret. Math."},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1080\/0025570X.1971.11976153","volume":"44","author":"B Manvel","year":"1971","unstructured":"Manvel, B., Stockmeyer, P.K.: On reconstruction of matrices. Math. Mag. 44, 218\u2013221 (1971)","journal-title":"Math. Mag."},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/00029890.1970.11992413","volume":"77","author":"PV O\u2019Neil","year":"1970","unstructured":"O\u2019Neil, P.V.: Ulam\u2019s conjecture and graph reconstructions. Am. Math. Mon. 77, 35\u201343 (1970)","journal-title":"Am. Math. Mon."},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Reutenauer, C.: Free lie algebras. In: Cohn, P.M., Dales, H.G. (eds.) London Mathematical Society Monographs New Series (1993)","DOI":"10.1093\/oso\/9780198536796.001.0001"},{"key":"8_CR23","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. Theoret. Comput. Sci. 601, 47\u201357 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6","volume-title":"Handbook of Formal Languages (3 volumes)","author":"G Rozenberg","year":"1997","unstructured":"Rozenberg, G., Salomaa, A.: Handbook of Formal Languages (3 volumes). Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59126-6"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-07407-4_23","volume-title":"Automata Theory and Formal Languages","author":"I Simon","year":"1975","unstructured":"Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 214\u2013222. Springer, Heidelberg (1975). https:\/\/doi.org\/10.1007\/3-540-07407-4_23"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48516-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T09:55:40Z","timestamp":1722938140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-48516-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030485153","9783030485160"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48516-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"26 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tampa, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/knot.math.usf.edu\/dlt2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.48","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Conference cancelled due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}