Pages that link to "Item:Q4857599"
From MaRDI portal
The following pages link to On the Approximation of Shortest Common Supersequences and Longest Common Subsequences (Q4857599):
Displayed 28 items.
- Combined super-/substring and super-/subsequence problems (Q596093) (← links)
- On the approximation of longest common nonsupersequences and shortest common nonsubsequences (Q673078) (← links)
- A new efficient algorithm for computing the longest common subsequence (Q733720) (← links)
- Beam search for the longest common subsequence problem (Q833536) (← links)
- On the longest common rigid subsequence problem (Q848965) (← links)
- Novel evolutionary models and applications to sequence alignment problems (Q863608) (← links)
- A note on the precedence-constrained class sequencing problem (Q868379) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- Algorithms for computing variants of the longest common subsequence problem (Q932321) (← links)
- Distribution of the length of the longest common subsequence of two multi-state biological sequences (Q947262) (← links)
- Finding the longest common subsequence for multiple biological sequences by ant colony optimization (Q947943) (← links)
- A large neighborhood search heuristic for the longest common subsequence problem (Q953288) (← links)
- New efficient algorithms for the LCS and constrained LCS problems (Q963324) (← links)
- Finite automata based algorithms on subsequences and supersequences of degenerate strings (Q972350) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- On the longest common parameterized subsequence (Q1038473) (← links)
- Some MAX SNP-hard results concerning unordered labeled trees (Q1318750) (← links)
- Improved heuristics and a genetic algorithm for finding short supersequences (Q1384223) (← links)
- An approximate \(A^{\ast}\) algorithm and its application to the SCS problem. (Q1401210) (← links)
- On the complexity of finding common approximate substrings. (Q1426464) (← links)
- On the approximation of largest common subtrees and largest common point sets (Q1575954) (← links)
- RNA multiple structural alignment with longest common subsequences (Q2385486) (← links)
- Minimum cost multi-product flow lines (Q2480199) (← links)
- On the Longest Common Parameterized Subsequence (Q3506962) (← links)
- Exact algorithms for the master ring problem (Q3528154) (← links)
- Maximum Motif Problem in Vertex-Colored Graphs (Q3637115) (← links)
- A learning algorithm for the longest common subsequence problem (Q5463438) (← links)
- On the complexity of comparing evolutionary trees (Q5961623) (← links)