A longest common subsequence algorithm suitable for similar text strings

DOI10.1007/BF00264437MaRDI QIDQ1168731zbMATH OpenOpenAlexFDO

Authors Narao Nakatsu, Yahiko Kambayashi, S. Yajima

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)

Cited in

(49)

• On the longest common parameterized subsequence
• A systolic array for the longest common subsequence problem
• An \(O(ND)\) difference algorithm and its variations
• Computational geometry algorithms for the systolic screen
• Fast linear-space computations of longest common subsequences
• Performance analysis of some simple heuristics for computing longest common subsequences
• Efficient merged longest common subsequence algorithms for similar sequences
• An efficient algorithm for LCS problem between two arbitrary sequences
• A bit-string longest-common-subsequence algorithm
• A data structure for substring-substring LCS length queries
• An \(A^\ast\) search algorithm for the constrained longest common subsequence problem
• A diagonal-based algorithm for the longest common increasing subsequence problem
• An efficient algorithm for the longest common palindromic subsequence problem
• Fast Algorithms for Local Similarity Queries in Two Sequences
• A new practical linear space algorithm for the longest common subsequence problem
• Faster STR-EC-LCS computation
• On the Longest Common Parameterized Subsequence
• Calcul de la distance par les sous-mots
• APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †
• DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
• Sketching, streaming, and fine-grained complexity of (weighted) LCS
• Longest common subsequences
• Approximating longest common subsequence in linear time: beating the \(\sqrt{n}\) barrier
• The similarity of two strings of fuzzy sets.
• A learning algorithm for the longest common subsequence problem
• A Linear-Time n ^0.4 -Approximation for Longest Common Subsequence
• Longest Common Subsequence with Gap Constraints
• Space-efficient STR-IC-LCS computation
• Algorithms and hardness for the longest common subsequence of three strings and related problems
• Faster space-efficient STR-IC-LCS computation
• A neural network based guidance for a BRKGA: an application to the longest common square subsequence problem
• k-universality of regular languages revisited
• Subsequence matching and LCS with segment number constraints
• Longest common subsequence with gap constraints
• The generalized constrained longest common subsequence in the run-length encoded format
• Efficient algorithms for enumerating maximal common subsequences of two strings
• The merged longest common increasing subsequence problem
• Computing longest common subsequence under Cartesian-tree matching model
• Subsequence matching and LCS under Cartesian-tree equivalence
• A linear-time \(n^{0.4}\)-approximation for longest common subsequence
• On finding longest palindromic subsequences using longest common subsequences
• Subsequence matching and analysis problems for formal languages
• Linear-space LCS enumeration for two strings
• A new efficient algorithm for computing the longest common subsequence
• Subsequence matching and analysis problems for formal languages
• An algorithm for distinguishing efficiently bit-strings by their subsequences
• An O(NP) sequence comparison algorithm
• Algorithms for computing variants of the longest common subsequence problem
• New efficient algorithms for the LCS and constrained LCS problems

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

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