Some limit results for longest common subsequences

Discrete Mathematics

Volumn 26, Issue 1, 1979, Pages 17-31

  Deken, Joseph G ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010568711     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(79)90057-8     Document Type: Article

References (10)

1. Bounds on the complexity of the longest common subsequences problem
2. Longest common subsequences of two random sequences
3. Algorithms for the longest common subsequences problem
4. Subadditive ergodic theory
5. A method for the correction of garbled words based on the Levenshtein metric
6. Frequency of insertion-deletion, transversion, and transition in evolution of 5S ribosomal RNA
7. The tree to tree editing problem
8. An algorithm for the distance between two finite sequences
9. The string to string correction problem