Some limit results for longest common subsequences
type: Item
instance of: scholarly article
title: Some limit results for longest common subsequences
zbMATH Open document ID: 0403.68064
DOI: 10.1016/0012-365X(79)90057-8
author: Joseph G. Deken
published in: Discrete Mathematics
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R99
zbMATH DE Number: 3626619
zbMATH Keywords: Longest Common Subsequence
zbMATH Keywords: Simple Matching Algorithm
MaRDI profile type: Publication
cites work: Bounds on the Complexity of the Longest Common Subsequence Problem
cites work: Longest common subsequences of two random sequences
cites work: Algorithms for the Longest Common Subsequence Problem
cites work: Subadditive ergodic theory
cites work: A Method for the Correction of Garbled Words Based on the Levenshtein Metric
cites work: The tree-to-tree editing problem
cites work: An algorithm for the distance between two finite sequences
cites work: The String-to-String Correction Problem
description: scientific article; zbMATH DE number 3626619