Pages that link to "Item:Q5136252"

The following pages link to Almost linear time computation of maximal repetitions in run length encoded strings (Q5136252):

Displaying 9 items.

• Alphabet-independent algorithms for finding context-sensitive repeats in linear time (Q491149) (← links)
• Space efficient search for maximal repetitions (Q557913) (← links)
• Upper bounds on distinct maximal (sub-)repetitions in compressed strings (Q832954) (← links)
• Hardness of comparing two run-length encoded strings (Q990818) (← links)
• Reversal distance for strings with duplicates: linear time approximation using hitting set (Q1010605) (← links)
• Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets (Q1702853) (← links)
• Crochemore's repetitions algorithm revisited: computing runs (Q2909203) (← links)
• Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard (Q3637111) (← links)
• The Number of Runs in a String: Improved Analysis of the Linear Upper Bound (Q5449797) (← links)