scientific article; zbMATH DE number 842125
From MaRDI portal
Recommendations
- A new practical linear space algorithm for the longest common subsequence problem
- The longest common subsequence problem revisited
- New algorithms for the LCS problem
- A new efficient algorithm for computing the longest common subsequence
- An almost-linear time and linear space algorithm for the longest common subsequence problem
Cited in
(27)- The longest common subsequence problem revisited
- An improved algorithm for the longest common subsequence problem
- A new practical linear space algorithm for the longest common subsequence problem
- Mining Bit-Parallel LCS-length Algorithms
- Algorithms for computing variants of the longest common subsequence problem
- Algorithms for Computing Variants of the Longest Common Subsequence Problem
- Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima
- A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
- An efficient algorithm for LCS problem between two arbitrary sequences
- A space efficient algorithm for the longest common subsequence in \(k\)-length substrings
- A fast and practical bit-vector algorithm for the longest common subsequence problem
- scientific article; zbMATH DE number 1617276 (Why is no real title available?)
- A fast longest common subsequence algorithm for similar strings
- Performance analysis of some simple heuristics for computing longest common subsequences
- scientific article; zbMATH DE number 5545474 (Why is no real title available?)
- The longest common subsequence problem -- a finite automata approach
- Dynamic programming algorithms for the mosaic longest common subsequence problem
- A New Efficient Algorithm for Computing the Longest Common Subsequence
- FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search
- New algorithms for the LCS problem
- A learning algorithm for the longest common subsequence problem
- An efficient systolic algorithm for the longest common subsequence problem
- A Scalable Approximation Algorithm for Weighted Longest Common Subsequence
- New refinement techniques for longest common subsequence algorithms.
- Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
- Simple and fast linear space computation of longest common subsequences
- Deposition and extension approach to find longest common subsequence for thousands of long sequences
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4862293)
