A longest common subsequence algorithm suitable for similar text strings

DOI10.1007/BF00264437zbMath0493.68041OpenAlexW2041650430MaRDI QIDQ1168731

Yahiko Kambayashi, Shuzo Yajima, Narao Nakatsu

Publication date: 1982

Published in: Acta Informatica (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (33)

Performance analysis of some simple heuristics for computing longest common subsequences ⋮ DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM ⋮ An \(O(ND)\) difference algorithm and its variations ⋮ An efficient algorithm for the longest common palindromic subsequence problem ⋮ Longest common subsequences ⋮ Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier ⋮ Fast Algorithms for Local Similarity Queries in Two Sequences ⋮ Efficient merged longest common subsequence algorithms for similar sequences ⋮ A Linear-Time n ^0.4 -Approximation for Longest Common Subsequence ⋮ On the Longest Common Parameterized Subsequence ⋮ Longest Common Subsequence with Gap Constraints ⋮ Space-efficient STR-IC-LCS computation ⋮ Calcul de la distance par les sous-mots ⋮ An O(NP) sequence comparison algorithm ⋮ An efficient algorithm for LCS problem between two arbitrary sequences ⋮ Computational geometry algorithms for the systolic screen ⋮ An \(A^\ast\) search algorithm for the constrained longest common subsequence problem ⋮ Algorithms for computing variants of the longest common subsequence problem ⋮ Faster STR-EC-LCS Computation ⋮ Fast linear-space computations of longest common subsequences ⋮ A bit-string longest-common-subsequence algorithm ⋮ New efficient algorithms for the LCS and constrained LCS problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A new efficient algorithm for computing the longest common subsequence ⋮ A learning algorithm for the longest common subsequence problem ⋮ An algorithm for distinguishing efficiently bit-strings by their subsequences ⋮ A diagonal-based algorithm for the longest common increasing subsequence problem ⋮ Unnamed Item ⋮ On the longest common parameterized subsequence ⋮ A systolic array for the longest common subsequence problem ⋮ APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ † ⋮ A data structure for substring-substring LCS length queries

This page was built for publication: A longest common subsequence algorithm suitable for similar text strings