Approximate trace reconstruction of random strings from a constant number of traces

In the trace reconstruction problem, the goal is to reconstruct an unknown string x of length n from multiple traces obtained by passing x through the deletion channel. In the relaxed problem of approximate trace reconstruction, the goal is to reconstruct an approximation x̂ of x which is close (within ǫn) to x in edit distance. We show that for most strings x, this is possible with high probability using only a constant number of traces. Crucially, this constant does not grow with n, and only depends on the deletion probability and ǫ.

[1]  Jehoshua Bruck,et al.  Trace Reconstruction with Bounded Edit Distance , 2021, 2021 IEEE International Symposium on Information Theory (ISIT).

[2]  Zachary Chase.  New Upper Bounds for Trace Reconstruction , 2020, ArXiv.

[3]  Rina Panigrahy,et al.  Trace reconstruction with constant deletion probability and related results , 2008, SODA '08.

[4]  Yuval Peres,et al.  Trace reconstruction with exp(O(n1/3)) samples , 2017, STOC.

[5]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[6]  Rocco A. Servedio,et al.  Polynomial-time trace reconstruction in the smoothed complexity model , 2020, ArXiv.

[7]  G. Nemhauser,et al.  Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2014 .

[8]  Shyam Narayanan,et al.  Population Recovery from the Deletion Channel: Nearly Matching Trace Reconstruction Bounds , 2020, ArXiv.

[9]  Yuval Peres,et al.  Average-Case Reconstruction for the Deletion Channel: Subpolynomially Many Traces Suffice , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[10]  Cyrus Rashtchian,et al.  Trace Reconstruction Problems in Computational Biology , 2020, ArXiv.

[11]  Russell Lyons,et al.  Lower bounds for trace reconstruction , 2018, ArXiv.

[12]  Cyrus Rashtchian,et al.  Approximate Trace Reconstruction , 2020, ArXiv.

[13]  Rocco A. Servedio,et al.  Efficient average-case population recovery in the presence of insertions and deletions , 2019, APPROX-RANDOM.

[14]  Lev Reyzin,et al.  Reconstructing Arbitrary Trees from Traces in the Tree Edit Distance Model , 2021, ArXiv.

[15]  Bruce Spang,et al.  Coded trace reconstruction in a constant number of traces , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

[16]  Madhu Sudan,et al.  Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance , 2020, 2021 IEEE International Symposium on Information Theory (ISIT).

[17]  Michael Mitzenmacher,et al.  A Survey of Results for Deletion Channels and Related Synchronization Channels , 2008, SWAT.

[18]  Yuval Peres,et al.  Subpolynomial trace reconstruction for random strings and arbitrary deletion probability , 2018, COLT.

[19]  Ryan O'Donnell,et al.  Optimal mean-based algorithms for trace reconstruction , 2017, STOC.

[20]  Joakim Blikstad.  On the longest common subsequence of Thue-Morse words , 2020, Inf. Process. Lett..

[21]  Olgica Milenkovic,et al.  Coded Trace Reconstruction , 2019, 2019 IEEE Information Theory Workshop (ITW).

[22]  Kazutaka Katoh,et al.  Multiple alignment of DNA sequences with MAFFT. , 2009, Methods in molecular biology.

[23]  Akshay Krishnamurthy,et al.  Trace Reconstruction: Generalized and Parameterized , 2019, ESA.

[24]  Mahdi Cheraghchi,et al.  Mean-Based Trace Reconstruction over Practically any Replication-Insertion Channel , 2021, 2021 IEEE International Symposium on Information Theory (ISIT).

[25]  Zachary Chase.  New lower bounds for trace reconstruction , 2021 .

[26]  Luis Ceze,et al.  DNA assembly for nanopore data storage readout , 2019, Nature Communications.

[27]  Massimo Franceschetti,et al.  Automated analysis of immunosequencing datasets reveals novel immunoglobulin D genes across diverse species , 2020, PLoS Comput. Biol..

[28]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[29]  Sampath Kannan,et al.  Reconstructing strings from random traces , 2004, SODA '04.

[30]  Sofya Vorotnikova,et al.  Trace Reconstruction Revisited , 2014, ESA.

[31]  Cyrus Rashtchian,et al.  Reconstructing Trees from Traces , 2019, COLT.

[32]  Tatiana Brailovskaya,et al.  Tree trace reconstruction using subtraces , 2021, ArXiv.

[33]  Shyam Narayanan,et al.  Circular Trace Reconstruction , 2021, ITCS.

[34]  Rocco A. Servedio,et al.  Beyond Trace Reconstruction: Population Recovery from the Deletion Channel , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).