Reconstructing Strings from Random Traces

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 903-911

  Batu, Tuǧkan ^a   Kannan, Sampath ^a   Khanna, Sanjeev ^a   McGregor, Andrew ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR CORRECTING CODES; MUTATIONS; TRANSMITTED STRINGS;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DNA; ERROR CORRECTION; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING;

COMPUTER SCIENCE;

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

References (10)

1. N. Alon and J. Edmonds and M. Luby, Linear Time Erasure Codes with Nearly Optimal Recovery, 36th Annual Symposium on Foundations of Computer Science, pp. 512-519,1995.
2. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge University Press, 1997.
3. V. I. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals (in Russian), Doklady Akademii Nauk SSSR, 163 (1965), no. 4, 845-848. Enlgish translation in Soviet Physics Dokl., 10 (1966), no. 8, 707-710.
4. V. I. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals (in Russian), Doklady Akademii Nauk SSSR, 163 (1965), no. 4, 845-848. Enlgish translation in Soviet Physics Dokl., 10 (1966), no. 8, 707-710.
5. V. I. Levenshtein, Binary codes capable of correcting spurious insertions and deletions of ones (in Russian), Problemy Peredachi Informatsii, 1 (1965), no. 1, 12-25. Enlgish translation in Problems of Information Transmission, 1 (1965), no. 1, 8-17.
6. V. I. Levenshtein, Binary codes capable of correcting spurious insertions and deletions of ones (in Russian), Problemy Peredachi Informatsii, 1 (1965), no. 1, 12-25. Enlgish translation in Problems of Information Transmission, 1 (1965), no. 1, 8-17.
7. V. I. Levenshtein, On perfect codes in the deletion/insertion metric (in Russian), Diskret. Mat. 3 (1991), no. 1, 3-20. English translation in Discrete Mathematics and Applications 2 (1992), no. 3, 241-258.
8. V. I. Levenshtein, On perfect codes in the deletion/insertion metric (in Russian), Diskret. Mat. 3 (1991), no. 1, 3-20. English translation in Discrete Mathematics and Applications 2 (1992), no. 3, 241-258.
9. V. I. Levenshtein, 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, IEEE Trans. Inform. Theory 45 (1999), no. 7, 2552-2557.