Pages that link to "Item:Q673640"
From MaRDI portal
The following pages link to Shortest consistent superstrings computable in polynomial time (Q673640):
Displaying 7 items.
- Consistent subsequences and supersequences (Q671514) (← links)
- Finding the longest common nonsuperstring in linear time (Q989576) (← links)
- Shortest common superstrings and scheduling with coordinated starting times (Q1127327) (← links)
- A tissue \(P\) system and a DNA microfluidic device for solving the shortest common superstring problem (Q2576612) (← links)
- A new graph model and algorithms for consistent superstring problems <sup /> (Q2955630) (← links)
- Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model (Q3652303) (← links)
- Approximating shortest superstrings with constraints (Q5060130) (← links)