36 citations · 78 across the 32 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015★ 6 cited
On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals
Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski +2
We study a variation of the classical Shortest Common Superstring (SCS) problem in which a shortest superstring of a finite set of strings is sought containing as a factor ever…
cs.DS2015★ 14 cited
Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
We give efficient algorithms for ranking Lyndon words of length over an alphabet of size . The rank of a Lyndon word is its position in the sequence of lexicographically ord…