Pages that link to "Item:Q4147591"
From MaRDI portal
The following pages link to The Complexity of Some Problems on Subsequences and Supersequences (Q4147591):
Displaying 50 items.
- A multiobjective optimization algorithm for the weighted LCS (Q313763) (← links)
- The constrained shortest common supersequence problem (Q396654) (← links)
- Variants of constrained longest common subsequence (Q407588) (← links)
- On the parameterized complexity of the repetition free longest common subsequence problem (Q413298) (← links)
- Fast algorithms for computing the constrained LCS of run-length encoded strings (Q428842) (← links)
- Approximability of constrained LCS (Q439929) (← links)
- A hyper-heuristic for the longest common subsequence problem (Q441749) (← links)
- Charge and reduce: A fixed-parameter algorithm for string-to-string correction (Q456695) (← links)
- Parameterized complexity and approximability of the longest compatible sequence problem (Q456697) (← links)
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728) (← links)
- On the generalized constrained longest common subsequence problems (Q491203) (← links)
- Constrained sequence analysis algorithms in computational biology (Q527151) (← links)
- Concordance and consensus (Q545367) (← links)
- Combined super-/substring and super-/subsequence problems (Q596093) (← links)
- Consistent subsequences and supersequences (Q671514) (← links)
- On the approximation of longest common nonsupersequences and shortest common nonsubsequences (Q673078) (← links)
- On the complexity of learning strings and sequences (Q688167) (← links)
- The complexity of flood filling games (Q692938) (← links)
- A new efficient algorithm for computing the longest common subsequence (Q733720) (← links)
- Searching and inferring colorful topological motifs in vertex-colored graphs (Q782751) (← links)
- Computing a longest common subsequence for a set of strings (Q786541) (← links)
- Beam search for the longest common subsequence problem (Q833536) (← links)
- Dynamic programming algorithms for the mosaic longest common subsequence problem (Q845973) (← links)
- On the longest common rigid subsequence problem (Q848965) (← links)
- Novel evolutionary models and applications to sequence alignment problems (Q863608) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- The consensus string problem for a metric is NP-complete (Q876700) (← links)
- Sequence matching with binary codes (Q911265) (← links)
- Algorithms for computing variants of the longest common subsequence problem (Q932321) (← links)
- Comparing bacterial genomes from linear orders of patterns (Q947065) (← 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)
- Finding common structured patterns in linear graphs (Q974741) (← links)
- Finding the longest common nonsuperstring in linear time (Q989576) (← links)
- Disjoint pattern matching and implication in strings (Q990133) (← links)
- Efficient algorithms for finding a longest common increasing subsequence (Q996830) (← links)
- The constrained longest common subsequence problem (Q1029006) (← links)
- On the longest common parameterized subsequence (Q1038473) (← links)
- Optimizing glass coating lines: MIP model and valid inequalities (Q1040997) (← links)
- New algorithms for the LCS problem (Q1072704) (← links)
- Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves (Q1091713) (← links)
- Constrained string editing (Q1099954) (← links)
- The string merging problem (Q1154285) (← links)
- The shortest common supersequence problem over binary alphabet is NP- complete (Q1157167) (← links)
- On the inadequacy of tournament algorithms for the \(N\)-SCS problem (Q1178218) (← links)
- On the complexity of approximating the independent set problem (Q1184733) (← links)
- Consensus sequences based on plurality rule (Q1199388) (← links)
- The shortest common nonsubsequence problem is NP-complete (Q1208726) (← links)
