A fast algorithm for the longest-common-subsequence problem

DOI10.1016/0020-0255(80)90025-0MaRDI QIDQ1155365zbMATH OpenOpenAlexFDO

Authors Amar Mukhopadhyay

Publication date 1980

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(80)90025-0

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• A fast algorithm for computing longest common subsequences
• A linear space algorithm for computing maximal common subsequences
• Algorithms for the Longest Common Subsequence Problem
• An algorithm for the distance between two finite sequences
• Bounds for the String Editing Problem
• Bounds on the Complexity of the Longest Common Subsequence Problem
• Matching Sequences under Deletion/Insertion Constraints
• PASCAL. User manual and report. Corr. reprint of the 2nd ed
• Spelling correction in systems programs
• The String-to-String Correction Problem

Cited in

(4)

• APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †
• New algorithms for the LCS problem
• Computing a longest common subsequence for a set of strings
• A model and a fast algorithm for multiple errors spelling correction

This page was built for publication: A fast algorithm for the longest-common-subsequence problem

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