Pages that link to "Item:Q911299"
From MaRDI portal
The following pages link to A linear-time algorithm for finding approximate shortest common superstrings (Q911299):
Displayed 13 items.
- On the greedy algorithm for the shortest common superstring problem with reversals (Q903196) (← links)
- Optimal prefix and suffix queries on texts (Q975480) (← links)
- An efficient algorithm for the all pairs suffix-prefix problem (Q1190509) (← links)
- About the design of oligo-chips (Q1766743) (← links)
- Combinatorial algorithms for DNA sequence assembly (Q1902464) (← links)
- All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent (Q2146125) (← links)
- All-pairs suffix/prefix in optimal time using Aho-Corasick space (Q2169425) (← links)
- Hierarchical overlap graph (Q2281159) (← links)
- A linear time algorithm for shortest cyclic cover of strings (Q2628807) (← links)
- Practical lower and upper bounds for the Shortest Linear Superstring (Q5140730) (← links)
- Greedy Shortest Common Superstring Approximation in Compact Space (Q5150914) (← links)
- THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW (Q5714656) (← links)
- Analysis of the Period Recovery Error Bound (Q5874467) (← links)