A fast algorithm for the longest-common-subsequence problem
From MaRDI portal
Publication:1155365
DOI10.1016/0020-0255(80)90025-0zbMath0466.68057OpenAlexW2026097868MaRDI QIDQ1155365
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
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Related Items (4)
Computing a longest common subsequence for a set of strings ⋮ A model and a fast algorithm for multiple errors spelling correction ⋮ APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ † ⋮ New algorithms for the LCS problem
Cites Work
- Unnamed Item
- PASCAL. User manual and report. Corr. reprint of the 2nd ed
- An algorithm for the distance between two finite sequences
- A linear space algorithm for computing maximal common subsequences
- Bounds for the String Editing Problem
- Bounds on the Complexity of the Longest Common Subsequence Problem
- A fast algorithm for computing longest common subsequences
- Algorithms for the Longest Common Subsequence Problem
- The String-to-String Correction Problem
- Spelling correction in systems programs
- Matching Sequences under Deletion/Insertion Constraints
This page was built for publication: A fast algorithm for the longest-common-subsequence problem
