Longest common subsequences
From MaRDI portal
Recommendations
- An iterative approach to determining the length of the longest common subsequence of two strings
- Approximation to the mean curve in the LCS problem
- The longest common subsequence problem revisited
- Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima
- LATIN 2004: Theoretical Informatics
Cites work
- scientific article; zbMATH DE number 30301 (Why is no real title available?)
- scientific article; zbMATH DE number 3630761 (Why is no real title available?)
- scientific article; zbMATH DE number 1142294 (Why is no real title available?)
- scientific article; zbMATH DE number 1414290 (Why is no real title available?)
- A fast algorithm for computing longest common subsequences
- A faster algorithm computing string edit distances
- A linear space algorithm for computing maximal common subsequences
- A linear space algorithm for the LCS problem
- A longest common subsequence algorithm suitable for similar text strings
- A variational problem for random Young tableaux
- Algorithms for approximate string matching
- Algorithms for the Longest Common Subsequence Problem
- An information-theoretic lower bound for the longest common subsequence problem
- Bounds for the String Editing Problem
- Bounds on the Complexity of the Longest Common Subsequence Problem
- Fast linear-space computations of longest common subsequences
- Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
- Longest common subsequences of two random sequences
- Maximal common subsequences and minimal common supersequences
- New algorithms for the LCS problem
- Searching subsequences
- Some limit results for longest common subsequences
- Sparse dynamic programming I
- The Complexity of Some Problems on Subsequences and Supersequences
- The String-to-String Correction Problem
- The longest common subsequence problem revisited
Cited in
(21)- Cyclic longest common subsequence
- Small Longest Tandem Scattered Subsequences
- On longest matching consecutive subsequence
- scientific article; zbMATH DE number 13327 (Why is no real title available?)
- Letter change bias and local uniqueness in optimal sequence alignments
- scientific article; zbMATH DE number 7651110 (Why is no real title available?)
- Repetition-free longest common subsequence
- Length of the longest common subsequence between overlapping words
- A faster linear systolic algorithm for recovering a longest common subsequence
- LCSk: a refined similarity measure
- Distribution of the length of the longest common subsequence of two multi-state biological sequences
- Computing the similarity of two sequences with nested arc annotations
- An iterative approach to determining the length of the longest common subsequence of two strings
- The longest filled common subsequence problem
- Computing a Longest Common Palindromic Subsequence
- Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov--Jacobson energy model
- Approximation to the mean curve in the LCS problem
- Deposition and extension approach to find longest common subsequence for thousands of long sequences
- A hybrid genetic algorithm for the repetition free longest common subsequence problem
- Approximating longest common subsequence in linear time: beating the \(\sqrt{n}\) barrier
- Constrained sequence analysis algorithms in computational biology
This page was built for publication: Longest common subsequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096874)
