Pages that link to "Item:Q4210217"
From MaRDI portal
The following pages link to String Noninclusion Optimization Problems (Q4210217):
Displaying 10 items.
- Consistent subsequences and supersequences (Q671514) (← links)
- On the approximation of longest common nonsupersequences and shortest common nonsubsequences (Q673078) (← links)
- Shortest consistent superstrings computable in polynomial time (Q673640) (← links)
- Finding the longest common nonsuperstring in linear time (Q989576) (← links)
- On trace inclusion optimization problems (Q2247802) (← links)
- A new graph model and algorithms for consistent superstring problems <sup /> (Q2955630) (← links)
- Restricted Common Superstring and Restricted Common Supersequence (Q3011876) (← links)
- Avoiding substrings in compositons (Q3015585) (← links)
- (Q4677914) (← links)
- Non-Looping String Rewriting (Q4718895) (← links)