{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T00:00:09Z","timestamp":1780444809055,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Simon's Investigator Grant","award":["376201"],"award-info":[{"award-number":["376201"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451118","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"21-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Separating words and trace reconstruction"],"prefix":"10.1145","author":[{"given":"Zachary","family":"Chase","sequence":"first","affiliation":[{"name":"University of Oxford, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"05532","author":"Ban F.","year":"1904","unstructured":"F. Ban, X. Chen, A. Freilich, R. Servedio, and S. Sinha. Beyond trace reconstruction: population recovery from the deletion channel. ArXiv e-prints, April 2019, 1904. 05532.","journal-title":"ArXiv e-prints"},{"key":"e_1_3_2_1_2_1","first-page":"44","volume-title":"APPROX\/RANDOM 2019","volume":"145","author":"Ban Frank","year":"2019","unstructured":"Frank Ban, Xi Chen, Rocco A. Servedio, and Sandip Sinha. Eficient averagecase population recovery in the presence of insertions and deletions. In APPROX\/RANDOM 2019, volume 145 of LIPIcs, pages 44 : 1-44 : 18. Schloss DagstuhlLeibniz-Zentrum f\u00fcr Informatik, 2019."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/982792.982929"},{"key":"e_1_3_2_1_4_1","volume-title":"Coded trace reconstruction in a constant number of traces.CoRR, abs\/","author":"Brakensiek Joshua","year":"1908","unstructured":"Joshua Brakensiek, Ray Li, and Bruce Spang. Coded trace reconstruction in a constant number of traces.CoRR, abs\/ 1908.03996, 2019."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1512\/iumj.1997.46.1435"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1112\/S0024611599011831"},{"key":"e_1_3_2_1_7_1","volume-title":"May","author":"Chase Z.","year":"2019","unstructured":"Z. Chase. New Lower Bounds for Trace Reconstruction. To appear in Annales Institute Henri Poincare: Probability and Statistics, May 2019, 1905. 03031."},{"key":"e_1_3_2_1_8_1","volume-title":"August","author":"Chen X.","year":"2020","unstructured":"X. Chen, A. De, C. Lee, R. Servedio, S. Sinha. Polynomial-time trace reconstruction in the smoothed complexity model. ArXiv e-prints, August 2020, 2008. 12386."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT"},{"key":"e_1_3_2_1_10_1","volume-title":"February","author":"Davies S.","year":"2019","unstructured":"S. Davies, M. Racz, and C. Rashtchian. Reconstructing trees from traces. ArXiv e-prints, February 2019, 1902. 05101."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055450"},{"key":"e_1_3_2_1_12_1","volume-title":"DCFS 2011","volume":"6808","author":"Demaine E.D.","year":"2011","unstructured":"E.D. Demaine, S. Eisenstat, J. Shallit, D.A. Wilson, Remarks on Separating Words, Holzer, M. (ed.) DCFS 2011. LNCS, vol. 6808, 147-157, 2011."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0097-3165(03)00103-1"},{"key":"e_1_3_2_1_14_1","series-title":"Lecture Notes Comput. Sci. 226","volume-title":"On discerning words by automata, 13th Internat. Colloquium on Automate Languages and Programming","author":"Goralcik P.","year":"1986","unstructured":"P. Goralcik and V. Koubek, On discerning words by automata, 13th Internat. Colloquium on Automate Languages and Programming, Lecture Notes Comput. Sci. 226 (Springer, Berlin, 1986 ) 116-122, 1986."},{"key":"e_1_3_2_1_15_1","author":"Holden N.","year":"2019","unstructured":"N. Holden and R. Lyons. Lower bounds for trace reconstruction. To appear in Annals of Applied Probability, 2019.","journal-title":"Lower bounds for trace reconstruction. To appear in Annals of Applied Probability"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the 31st Conference On Learning Theory, PMLR 75 : 1799-1840","author":"Holden N.","year":"2018","unstructured":"N. Holden, R. Pemantle, Y. Peres, A. Zhai. Subpolynomial trace reconstruction for random strings and arbitrary deletion probability. In Proceedings of the 31st Conference On Learning Theory, PMLR 75 : 1799-1840, 2018."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1347082.1347125"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1997.2732"},{"key":"e_1_3_2_1_19_1","volume-title":"April","author":"Krishnamurthy A.","year":"2019","unstructured":"A. Krishnamurthy, A. Mazumdar, A. McGregor, S. Pal. Trace reconstruction: generalized and parameterized. ArXiv e-prints, April 2019, 1904. 09618."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44777-2_57"},{"key":"e_1_3_2_1_21_1","volume-title":"Population recovery from the deletion channel: Nearly matching trace reconstruction bounds. CoRR, abs\/","author":"Narayanan S.","year":"2004","unstructured":"S. Narayanan. Population recovery from the deletion channel: Nearly matching trace reconstruction bounds. CoRR, abs\/ 2004.06828, 2020."},{"key":"e_1_3_2_1_22_1","volume-title":"September","author":"Narayanan S.","year":"2020","unstructured":"S. Narayanan, M. Ren. Circular Trace Reconstruction. ArXiv e-prints, September 2020, 2009. 01346."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055494"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.29"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90215-9"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(96)00153-7"},{"key":"e_1_3_2_1_27_1","first-page":"3","volume":"21","author":"Vyaly\u0131 M. N.","year":"2014","unstructured":"M. N. Vyaly\u0131 and R. A. Gimadeev, On separating words by the occurrences of subwords, Diskretn. Anal. Issled. Oper., 21 ( 1 ): 3-14, 2014.","journal-title":"Anal. Issled. Oper."}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451118","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451118","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:53Z","timestamp":1750195493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":27,"alternative-id":["10.1145\/3406325.3451118","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451118","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}