A common basis for similarity measures involving two strings†

DOI10.1080/00207168308803349zbMath0497.68042OpenAlexW2081848125WikidataQ60328398 ScholiaQ60328398MaRDI QIDQ3962481

B. John Oommen, Rangasami L. Kashyap

Publication date: 1983

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168308803349

zbMATH Keywords

longest common subsequenceshortest common supersequencesimilarity measures for stringsdistances between stringssets of shuffles of two strings

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Related Items (4)

Constrained tree editing ⋮ Constrained string editing ⋮ On the inadequacy of tournament algorithms for the \(N\)-SCS problem ⋮ Automatic error correction in flexion languages

Cites Work

• Unnamed Item
• A faster algorithm computing string edit distances
• An algorithm for the distance between two finite sequences
• A linear space algorithm for computing maximal common subsequences
• A Method for the Correction of Garbled Words Based on the Levenshtein Metric
• Bounds for the String Editing Problem
• Bounds on the Complexity of the Longest Common Subsequence Problem
• A fast algorithm for computing longest common subsequences
• The Complexity of Some Problems on Subsequences and Supersequences
• Algorithms for the Longest Common Subsequence Problem
• The String-to-String Correction Problem

This page was built for publication: A common basis for similarity measures involving two strings†