Trace reconstruction with constant deletion probability and related results

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 389-398

  Holenstein, Thomas ^a   Mitzenmacher, Michael ^b   Panigrahy, Rina ^a   Wieder, Udi ^a  

^a MICROSOFT RESEARCH   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY STRINGS; HIGH PROBABILITY; LOWER BOUNDS; NEW RESULTS; WORST CASE;

ALGORITHMS; CONTROL THEORY; PROBABILITY; RESTORATION;

REPAIR;

EID: 54249155031     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. M. Abramowitz, I. A. Stegun. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. Dover publication, 1964.
2. H. Alzer. Sharp inequalities for the digamma and polygamma functions Forum Mathematicum, vol. 16, no. 2, pp. 181-221. 2004.
3. T. Batu, S. Kannan, S. Khannna, and A. McGregor. Reconstructing strings from random traces. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 910-918, 2004.
4. R. L. Dobrushm. Shannon's Theorems for Channels with Synchronization Errors. Problems of Information Transmission, 3(4): 11-26, 1967.
5. Translated from Problemy Peredachi Informatsii, vol. 3, no. 4, pp 18-36, 1967.
6. E. Drinea and M. Mitzenmacher. Improved lower bounds for the capacity of i.i.d. deletion and duplication channels. IEEE Trans. on Information Theory, 53:8, pp. 2693-2714, 2007.
7. S. Kannan and A. McGregor. More on reconstructing strings from random traces: insertions and deletions. In Proc. of the Int'l. Symp. on Information 'Theory, pp. 297-301, 2005.
8. V. I. Levenshtein. Efficient reconstruction of sequences. IEEE 'Transactions on Information 'Theory, vol. 47, no. 1, pp. 2-22, 2001.
9. V. 1. Levenshtein. Efficient reconstruction of sequences from their subsequences or supersequences. Journal of Combinatorial Theory, Series A, vol. 93, no. 2, pp. 310-332, 2001.