Efficient reconstruction of sequences from their subsequences or supersequences

Journal of Combinatorial Theory. Series A

Volumn 93, Issue 2, 2001, Pages 310-332

  Levenshtein, Vladimir I ^a  

^a KELDYSH INSTITUTE OF APPLIED MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035255506     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.2000.3081     Document Type: Article

References (15)

1. Apostolico A., Giancarlo R. Sequence alignments and molecular biology. J. of Comp. Biology. 5:1998;173-196.
2. Calabi L. On the Computation of Levenshtein's Distances. TN-9-0030. 1967;Parke Math. Labs., Inc. Carlisle.
3. Calabi L., Hartnett W. E. Some general results of abstract coding theory with applications to the study of codes for the correction of synchronization errors. Inform. Control. 15:1969;235-249.
4. Glukhov M. M., Zubov A. Ju. On length of symmetric and alternating permutation groups for different systems of generators (survey). Mat. Problemy Kibernet. 8:1999;5-32.
5. Hirschberg D. S. Algorithms for the longest subsequence problem. J. Assoc. Comput. Mach. 24:1977;664-675.
6. Hirschberg D. S. Bounds on the number of string subsequences. Proc. 10th Symp. on Combinatorial Pattern Matching, Warwick UK. Lecture Notes in Computer Science. 1999;Springer-Verlag, Berlin.
7. Krasikov I., Roditty Y. On a reconstruction problem for sequences. J. Combin. Theory Ser. A. 77:1997;344-348.
8. Leont'ev V. K., Smetanin Ju. G. Reconstruction of vectors from a set of their fragments. Dokl. Akad. Nauk. 302:1988;1319-1322.
9. Levenshtein V. I. Binary codes capable of correcting deletions, insertions and reversals. Dokl. Akad. Nauk. 163:1965;845-848.
10. Levenshtein V. I. Elements of coding theory. Discrete Mathematics and Math. Problems of Cybernetics. 1974;Nauka, Moscow. p. 207-305.
11. Levenshtein V. I. On perfect codes in deletion/insertion metric. Diskret. Math. 3:1991;3-20.
12. Levenshtein V. I. Reconstruction of objects from a minimum number of distorted patterns. Dokl. Akad. Math. 354:1997;593-596.
13. V. I. Levenshtein, Efficient reconstruction of sequences, IEEE Trans. Inform. Theory, in press.
14. Manvel B., Meyerowitz A., Schwenk A., Smith K., Stockmeyer P. Reconstruction of sequences. Discrete Math. 94:1991;209-219.
15. Zenkin A. I., Leont'ev V. K. On a nonclassical problem of recognition. Zh. Vychisl. Mat. Mat. Fiz. 24:1984;925-931.