Bounds on the number of string subsequences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1645, Issue , 1999, Pages 115-122

  Hirschberg, Daniel S ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AVERAGE CASE;

PATTERN MATCHING;

EID: 84957665287     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48452-3_9     Document Type: Conference Paper

References (7)

1. L. Calabi, "On the computation of Levenshtein's distances," TM-9-0030, Parke Math. Labs., Inc., Carlisle, Mass., 1967.
2. L. Calabi and W.E. Hartnett, "Some general results of coding theory with applica- tions to the study of codes for the correction of synchronization errors," Information and Control 15,3 (Sept 1969) 235-249. Reprinted in: W. E. Hartnett (ed), Founda- tions of Coding Theory (1974) Chapter 7, pp.107-121.
3. V. I. Levenshtein, "Binary codes capable of correcting deletions, insertions and reversals," Soviet Phys. Dokl. 10 (1966) 707-710.
4. V. I. Levenshtein, "Elements of the coding theory," in: Discrete Math. and Math. Probl. of Cybern., Nauka, Moscow (1974) 207-235 (in Russian).
5. V. I. Levenshtein, "On perfect codes in deletion and insertion metric," Discrete Math. Appl. 2,3 (1992) 241-258. Originally published in Diskretnaya Matematika 3,1 (1991) 3-20 (in Russian).
6. V. I. Levenshtein, "Reconstructing binary sequences by the minimum number of their subsequences or supersequences of a given length," Proc. 5th Int. Wkshp on Alg. & Comb. Coding Theory, Sozopol, Bulgaria (1996) 176-183.
7. C. L. Liu, Introduction to Combinatorial Mathematics, McGraw-Hill, 1986, pp. 80-86.