Substring Density Estimation From Traces

In the trace reconstruction problem, one seeks to reconstruct a binary string s from a collection of traces, each of which is obtained by passing s through a deletion channel. It is known that \exp (\tilde {O}(n^{1/5})) traces suffice to reconstruct any length-n string with high probability. We co...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on information theory 2024-08, Vol.70 (8), p.5782-5798
Hauptverfasser:	Mazooji, Kayvon, Shomorony, Ilan
Format:	Artikel
Sprache:	eng
Schlagworte:	Bioinformatics deletion channel k-subword deck sequence reconstruction Smoothing methods Sufficient conditions Trace reconstruction Transforms Upper bound US Government Vectors
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!