scientific article; zbMATH DE number 5764889

MaRDI QIDQ3579482zbMATH OpenFDO

Authors Thomas Holenstein, Panigrahy Rina, Udi Wieder, Michael Mitzenmacher

Publication date 6 August 2010

Mathematics Subject Classification ID

Combinatorics on words (68R15) Detection theory in information and communication theory (94A13)

Cited in

(23)

• Optimal mean-based algorithms for trace reconstruction
• Subpolynomial trace reconstruction for random strings and arbitrary deletion probability
• New lower bounds for trace reconstruction
• Reconstructing trees from traces
• The trace reconstruction problem for spider graphs
• Lower bounds for trace reconstruction
• Population recovery and partial identification
• Trace reconstruction: generalized and parameterized
• A binary deletion channel with a fixed number of deletions
• Information-Theoretic Foundations of DNA Data Storage
• scientific article; zbMATH DE number 7650111 (Why is no real title available?)
• Tree trace reconstruction using subtraces
• Reconstruction of permutations distorted by single Kendall -errors
• Near-linear time edit distance for indel channels
• Pairwise sequence alignment at arbitrarily large evolutionary distance
• Trace reconstruction from local statistical queries
• Polynomial-time trace reconstruction in the smoothed complexity model
• The sequence reconstruction of permutations with Hamming metric
• Global alignment of molecular sequences via ancestral state reconstruction
• Circular trace reconstruction
• Polynomial-time trace reconstruction in the low deletion rate regime
• On the decoding error weight of one or two deletion channels
• Near-optimal trace reconstruction for mildly separated strings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579482)