More on reconstructing strings from random traces: Insertions and deletions

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 297-301

  Kannan, Sampath ^a   McGregor, Andrew ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR RATES; INSERTION ERROR; MUTATION RATES;

BIT ERROR RATE; COMPUTATIONAL COMPLEXITY; DNA; ERROR ANALYSIS; EVOLUTIONARY ALGORITHMS; INFORMATION THEORY; PROBABILITY;

ENCODING (SYMBOLS);

EID: 33749446702     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523342     Document Type: Conference Paper

References (10)

1. N. Alon, J. Edmonds, and M. Luby, Linear time erasure codes with nearly optimal recovery, 36th Annual Symposium on Foundations of Computer Science, 1995, pp. 512-519.
2. T. Batu, S. Kannan, S. Khanna, and A. McGregor, Reconstructing strings from random traces, Proc. of SODA 2004 (2004), 903-911.
3. M. Dudik and L. J. Shulman, Reconstruction from subsequences, J. Combinatorial Theory Series A (2003), no. 103, 337-348.
4. D. Gusfleld, Algorithms on strings, trees, and sequences, Algorithms on Strings, Trees, and Sequences, 1997.
5. V. I. Levenshtein, Binary codes capable of correcting spurious insertions and deletions of ones, Problems of Information Transmission 1 (1965), no. 1, 8-17.
6. _, Binary codes capable of correcting deletions, insertions and reversals, Soviet Physics Dokl. 10 (1966), no. 8, 707-710.
7. _, On perfect codes in the deletion/insertion metric, Discrete Mathematics and Applications 3 (1992), no. 1, 241-258.
8. _, Efficient reconstruction of sequences from their subsequences and supersequences, J. Combinatorial Theory Series A (2001), no. 93, 310-332.
9. _, Efficient reconstruction of sequences, IEEE Trans. Inform. Theory 47 (2001), no. 1, 2-22.
10. L. J. Shulman and D. Zuckerman, Asymptotically good codes correction insertions, deletions and transpositions, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms 45 (1999), no. 7, 2552-2557.