Efficient computation of all longest common subsequences
From MaRDI portal
Recommendations
- Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima
- The longest common subsequence problem revisited
- Algorithms for Computing Variants of the Longest Common Subsequence Problem
- scientific article; zbMATH DE number 842125
- Fast linear-space computations of longest common subsequences
Cited in
(14)- Efficient merged longest common subsequence algorithms for similar sequences
- The set-set LCS problem
- Efficient algorithms for the longest common subsequence problem with sequential substring constraints
- Enumeration of maximal common subsequences between two strings
- Efficient algorithms for the longest common subsequence in \(k\)-length substrings
- Finding least-weight subsequences with fewer processors
- RNA multiple structural alignment with longest common subsequences
- A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem
- On the reconstruction of optimal solutions in methods of dynamic programming for the sequence analysis
- All Semi-local Longest Common Subsequences in Subquadratic Time
- scientific article; zbMATH DE number 5545474 (Why is no real title available?)
- Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima
- Computing the Longest Common Transposition-Invariant Subsequence with GPU
- The colored longest common prefix array computed via sequential scans
This page was built for publication: Efficient computation of all longest common subsequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2721998)
