Computing a longest common subsequence for a set of strings

DOI10.1007/BF01934514zbMATH Open0528.68049OpenAlexW2003021193MaRDI QIDQ786541FDOQ786541

Authors: W. J. Hsu, M. W. Du 

Publication date: 1984

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01934514

zbMATH Keywords

analysis of algorithmslongest common subsequence24, 45-59 (1984)string merging

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The String-to-String Correction Problem
• Fast Pattern Matching in Strings
• A faster algorithm computing string edit distances
• A linear space algorithm for computing maximal common subsequences
• On computing the length of longest increasing subsequences
• An Extension of the String-to-String Correction Problem
• A fast algorithm for computing longest common subsequences
• Title not available (Why is that?)
• On finding minimal length superstrings
• Bounds for the String Editing Problem
• The Complexity of Some Problems on Subsequences and Supersequences
• Longest common subsequences of two random sequences
• Algorithms for the Longest Common Subsequence Problem
• Bounds on the Complexity of the Longest Common Subsequence Problem
• Title not available (Why is that?)
• An algorithm for the distance between two finite sequences
• A Sentence-to-Sentence Clustering Procedure for Pattern Analysis
• Title not available (Why is that?)
• The tree-to-tree editing problem
• Matching Sequences under Deletion/Insertion Constraints
• The string merging problem
• A fast algorithm for the longest-common-subsequence problem
• Tree Systems for Syntactic Pattern Recognition
• Spelling correction in systems programs

Cited In (16)

• Enumeration of maximal common subsequences between two strings
• Mathematical programming strategies for solving the minimum common string partition problem
• Beam search for the longest common subsequence problem
• A hyper-heuristic for the longest common subsequence problem
• Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
• A large neighborhood search heuristic for the longest common subsequence problem
• A hardness result and new algorithm for the longest common palindromic subsequence problem
• Directed acyclic subsequence graph -- overview
• Anytime algorithms for the longest common palindromic subsequence problem
• RNA multiple structural alignment with longest common subsequences
• An improved algorithm for the longest common subsequence problem
• Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
• Searching subsequences
• Automatic error correction in flexion languages
• On the approximation of shortest common supersequences and longest common subsequences
• Approximating longest common subsequence in linear time: beating the \(\sqrt{n}\) barrier

This page was built for publication: Computing a longest common subsequence for a set of strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786541)