Pages that link to "Item:Q1341729"
From MaRDI portal
The following pages link to Approximating shortest superstrings with constraints (Q1341729):
Displaying 15 items.
- The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings (Q313766) (← links)
- Recognition of overlap graphs (Q405660) (← links)
- Shortest consistent superstrings computable in polynomial time (Q673640) (← links)
- On the greedy algorithm for the shortest common superstring problem with reversals (Q903196) (← links)
- A linear-time algorithm for finding approximate shortest common superstrings (Q911299) (← links)
- A note on shortest superstrings with flipping (Q1208439) (← links)
- A \(2_3^2\) superstring approximation algorithm (Q1281759) (← links)
- A linear time algorithm for shortest cyclic cover of strings (Q2628807) (← links)
- A new graph model and algorithms for consistent superstring problems <sup /> (Q2955630) (← links)
- Sequential and Parallel Approximation of Shortest Superstrings (Q3128987) (← links)
- DNA sequencing and string learning (Q3445271) (← links)
- Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model (Q3652303) (← links)
- Linear approximation of shortest superstrings (Q4310837) (← links)
- Approximating shortest superstrings with constraints (Q5060130) (← links)
- Superstrings with multiplicities (Q5140785) (← links)
