Pages that link to "Item:Q1917072"
From MaRDI portal
The following pages link to Maximal common subsequences and minimal common supersequences (Q1917072):
Displaying 17 items.
- 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 longest common rigid subsequence problem (Q848965) (← links)
- Non-overlapping common substrings allowing mutations (Q942988) (← links)
- Finding the longest common nonsuperstring in linear time (Q989576) (← links)
- More on the complexity of common superstring and supersequence problems (Q1318686) (← links)
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems (Q1877706) (← links)
- Enumeration of maximal common subsequences between two strings (Q2118209) (← links)
- The generalized definitions of the two-dimensional largest common substructure problems (Q2182100) (← links)
- Maximal common subsequence algorithms (Q2326405) (← links)
- Local search for string problems: brute-force is essentially optimal (Q2437744) (← links)
- Longest common subsequences (Q5096874) (← links)
- Maximal Common Subsequence Algorithms (Q5140762) (← links)
- Combinatorial Pattern Matching (Q5713543) (← links)
- Analogical Proportions in a Lattice of Sets of Alignments Built on the Common Subwords in a Finite Language (Q5739528) (← links)
- Polynomial-delay enumeration of maximal common subsequences (Q6536255) (← links)
