The string merging problem
type: Item
instance of: scholarly article
title: The string merging problem
zbMATH Open document ID: 0464.68071
DOI: 10.1007/BF01934067
author: Stephen Y. Itoga
published in: BIT
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R99
zbMATH DE Number: 3727653
zbMATH Keywords: 21, 20-30 (1981)
zbMATH Keywords: string modification
zbMATH Keywords: string matching
zbMATH Keywords: costs of editing
zbMATH Keywords: longest common subsequence
zbMATH Keywords: shortest common supersequence
MaRDI profile type: Publication
cites work: Optimal Code Generation for Expression Trees
cites work: Q5616735
cites work: Studies in abstract families of languages
cites work: A linear space algorithm for computing maximal common subsequences
cites work: A fast algorithm for computing longest common subsequences
cites work: An Extension of the String-to-String Correction Problem
cites work: The Complexity of Some Problems on Subsequences and Supersequences
cites work: Matching Sequences under Deletion/Insertion Constraints
cites work: An algorithm for the distance between two finite sequences
cites work: The String-to-String Correction Problem
cites work: Bounds for the String Editing Problem
description: scientific article; zbMATH DE number 3727653