Algorithms for the Longest Common Subsequence Problem
From MaRDI portal
Publication:4187318
DOI10.1145/322033.322044zbMath0402.68041OpenAlexW2162744351WikidataQ29392442 ScholiaQ29392442MaRDI QIDQ4187318
Publication date: 1977
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322033.322044
Related Items
The longest common subsequence problem for sequences with nested arc annotations., A common basis for similarity measures involving two strings†, Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings, Performance analysis of some simple heuristics for computing longest common subsequences, A substring-substring LCS data structure, DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM, Scaled and permuted string matching, Algorithms for subsequence combinatorics, The longest common subsequence problem revisited, Constrained string editing, An \(O(ND)\) difference algorithm and its variations, Calculating distances for dissimilar strings: the shortest path formulation revisited, Two algorithms for LCS consecutive suffix alignment, A lower bound for the edit-distance problem under an arbitrary cost function, Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism, A simple algorithm for the constrained sequence problems, Longest common subsequence problem for unoriented and cyclic strings, Computing longest (common) Lyndon subsequences, The longest common subsequence problem for arc-annotated sequences, Longest common subsequences, Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier, A Linear-Time n 0.4 -Approximation for Longest Common Subsequence, Linear-space S-table algorithms for the longest common subsequence problem, Computing longest Lyndon subsequences and longest common Lyndon subsequences, Fast Algorithms for Computing Tree LCS, Constrained LCS: Hardness and Approximation, Longest Common Subsequence with Gap Constraints, Longest bordered and periodic subsequences, Exact algorithms for the repetition-bounded longest common subsequence problem, A novel distance measure based on dynamic time warping to improve time series classification, On finding a longest common palindromic subsequence, Subsequence frequency in binary words, Fast algorithms for computing the constrained LCS of run-length encoded strings, Calcul de la distance par les sous-mots, A fast algorithm for the longest-common-subsequence problem, An O(NP) sequence comparison algorithm, Efficient recognition of rational relations, Context prediction of mobile users based on time-inferred pattern networks: a probabilistic approach, An efficient algorithm for LCS problem between two arbitrary sequences, An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints, Regular expression constrained sequence alignment, Computing a longest common almost-increasing subsequence of two sequences, Computational geometry algorithms for the systolic screen, Algorithms for computing variants of the longest common subsequence problem, On the inadequacy of tournament algorithms for the \(N\)-SCS problem, On the approximation of shortest common supersequences and longest common subsequences, Multiple genome rearrangement by swaps and by element duplications, Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion, On the generalized constrained longest common subsequence problems, Fast linear-space computations of longest common subsequences, Dynamic programming with convexity, concavity and sparsity, Algorithms for the bounded set-up knapsack problem, Finding the longest common subsequence for multiple biological sequences by ant colony optimization, TS-CHIEF: a scalable and accurate forest algorithm for time series classification, ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS, A large neighborhood search heuristic for the longest common subsequence problem, Fitness landscape analysis for the no-wait flow-shop scheduling problem, Similar sequence matching supporting variable-length and variable-tolerance continuous queries on time-series data stream, A bit-string longest-common-subsequence algorithm, Symbolic analysis of indicator time series by quantitative sequence alignment, Sparse RNA folding: time and space efficient algorithms, Efficient algorithms for the block edit problems, Efficient reconstruction of sequences from their subsequences of supersequences, Finding a longest common subsequence between a run-length-encoded string and an uncompressed string, Concordance and consensus, Finding common structured patterns in linear graphs, A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings, Unnamed Item, Tight conditional lower bounds for longest common increasing subsequence, Finding longest increasing and common subsequences in streaming data, LCS approximation via embedding into locally non-repetitive strings, Unnamed Item, An information-theoretic lower bound for the longest common subsequence problem, Fast algorithms for computing tree LCS, A new efficient algorithm for computing the longest common subsequence, Some limit results for longest common subsequences, Unnamed Item, A learning algorithm for the longest common subsequence problem, Fast prefix matching of bounded strings, LCS Approximation via Embedding into Local Non-repetitive Strings, Sparse RNA Folding: Time and Space Efficient Algorithms, Comparison of strings belonging to the same family, The constrained longest common subsequence problem, Sparse LCS common substring alignment, Unnamed Item, An almost-linear time and linear space algorithm for the longest common subsequence problem, Maximal common subsequence algorithms, Computing a longest common subsequence for a set of strings, Simple and fast linear space computation of longest common subsequences, Parallel algorithms for permutation graphs, Automatic error correction in flexion languages, A systolic array for the longest common subsequence problem, APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †, Maximal Common Subsequence Algorithms, Resequencing a set of strings based on a target string, New algorithms for the LCS problem, Enumeration of maximal common subsequences between two strings
