Recommendations
All-pairs suffix/prefix in optimal time using Aho-Corasick space
AbstractThe all-pairs suffix/prefix (APSP) problem is a classic problem in computer science with many applications in bioinformatics. Given a set { S 1 , … , S k } of k strings of total length n, we are asked to find, for each string S i, i ∈ [...
Highlights- All-pairs suffix/prefix of length at least ℓ in optimal time.
- All-pairs suffix/...
Prefix and Suffix Reversals on Strings
SPIRE 2015: Proceedings of the 22nd International Symposium on String Processing and Information Retrieval - Volume 9309The Sorting by Prefix Reversals problem consists in sorting the elements of a given permutation $$\pi $$ with a minimum number of prefix reversals, i.e. reversals that always imply the leftmost element of $$\pi $$. A natural extension of this problem is ...
Comments