Pages that link to "Item:Q4147591"

The following pages link to The Complexity of Some Problems on Subsequences and Supersequences (Q4147591):

Displaying 24 items.

• Constrained LCS: Hardness and Approximation (Q3506958) (← links)
• On the Longest Common Parameterized Subsequence (Q3506962) (← links)
• A common basis for similarity measures involving two strings† (Q3962481) (← links)
• Similarity measures for sets of strings^† (Q3968468) (← links)
• APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ † (Q4240887) (← links)
• On the approximation of shortest common supersequences and longest common subsequences (Q4632426) (← links)
• (Q4852904) (← links)
• Scattered Factor-Universality of Words (Q5041246) (← links)
• On the complexity of approximating the independent set problem (Q5096160) (← links)
• Longest common subsequences (Q5096874) (← links)
• Graph Logics with Rational Relations (Q5278208) (← links)
• Analogical Proportions in a Lattice of Sets of Alignments Built on the Common Subwords in a Finite Language (Q5739528) (← links)
• Listing Center Strings Under the Edit Distance Metric (Q5743548) (← links)
• Approximate periods of strings (Q5958136) (← links)
• Absent Subsequences in Words (Q6070611) (← links)
• Nearly \(k\)-universal words -- investigating a part of Simon's congruence (Q6073651) (← links)
• (Q6084394) (← links)
• Algorithms and complexity on indexing founder graphs (Q6103519) (← links)
• String Covering: A Survey (Q6145625) (← links)
• Existential Definability over the Subword Ordering (Q6178718) (← links)
• Beam-ACO for the Repetition-Free Longest Common Subsequence Problem (Q6487177) (← links)
• Weighted shortest common supersequence problem revisited (Q6536257) (← links)
• Algorithms and hardness for the longest common subsequence of three strings and related problems (Q6545446) (← links)
• A neural network based guidance for a BRKGA: an application to the longest common square subsequence problem (Q6635971) (← links)