On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
From MaRDI portal
Publication:4857599
Recommendations
- On the approximation of shortest common supersequences and longest common subsequences
- On the approximation of longest common nonsupersequences and shortest common nonsubsequences
- scientific article; zbMATH DE number 827942
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- Algorithms for Computing Variants of the Longest Common Subsequence Problem
- scientific article; zbMATH DE number 5545474
- On the longest common parameterized subsequence
- On the Longest Common Parameterized Subsequence
Cited in
(55)- Improved heuristics and a genetic algorithm for finding short supersequences
- scientific article; zbMATH DE number 827942 (Why is no real title available?)
- The constrained shortest common supersequence problem
- The multi-spreader crane scheduling problem: partitions and supersequences
- Split-plot designs for robotic serial dilution assays
- The multiple sequence sets: Problem and heuristic algorithms
- A new efficient algorithm for computing the longest common subsequence
- Comparing incomplete sequences via longest common subsequence
- New efficient algorithms for the LCS and constrained LCS problems
- On the longest common rigid subsequence problem
- A beam search for the shortest common supersequence problem guided by an approximate expected length calculation
- Backdoors to planning
- New results for the longest haplotype reconstruction problem
- On the longest common parameterized subsequence
- Novel evolutionary models and applications to sequence alignment problems
- Solving longest common subsequence problems via a transformation to the maximum clique problem
- scientific article; zbMATH DE number 7758340 (Why is no real title available?)
- Beam search for the longest common subsequence problem
- Variants of constrained longest common subsequence
- On the parameterized complexity of the repetition free longest common subsequence problem
- Restricted common superstring and restricted common supersequence
- Finding the longest common subsequence for multiple biological sequences by ant colony optimization
- Approximability of constrained LCS
- A hyper-heuristic for the longest common subsequence problem
- A note on the precedence-constrained class sequencing problem
- Combined super-/substring and super-/subsequence problems
- On the approximation of longest common nonsupersequences and shortest common nonsubsequences
- Distribution of the length of the longest common subsequence of two multi-state biological sequences
- Finite automata based algorithms on subsequences and supersequences of degenerate strings
- A large neighborhood search heuristic for the longest common subsequence problem
- Complexity issues in vertex-colored graph pattern matching
- On the approximability of the maximum agreement subtree and maximum compatible tree problems
- Exact algorithms for the repetition-bounded longest common subsequence problem
- The complexity of flood filling games
- Some MAX SNP-hard results concerning unordered labeled trees
- Anytime algorithms for the longest common palindromic subsequence problem
- RNA multiple structural alignment with longest common subsequences
- Longest common subsequence problem for unoriented and cyclic strings
- Algorithms for computing variants of the longest common subsequence problem
- An improved algorithm for the longest common subsequence problem
- Approximating minimum reset sequences
- Minimum cost multi-product flow lines
- An approximate \(A^{\ast}\) algorithm and its application to the SCS problem.
- Listing center strings under the edit distance metric
- Maximum Motif Problem in Vertex-Colored Graphs
- Average-case analysis via incompressibility
- On the approximation of largest common subtrees and largest common point sets
- Deposition and extension approach to find longest common subsequence for thousands of long sequences
- Exact algorithms for the master ring problem
- On the Longest Common Parameterized Subsequence
- A learning algorithm for the longest common subsequence problem
- On the complexity of comparing evolutionary trees
- Weighted shortest common supersequence problem revisited
- On the complexity of finding common approximate substrings.
- Algorithms and hardness for the longest common subsequence of three strings and related problems
This page was built for publication: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857599)
