Pages that link to "Item:Q1702853"

The following pages link to 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):

Displaying 12 items.

• Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes (Q1625598) (← links)
• Searching of gapped repeats and subrepetitions in a word (Q1679608) (← links)
• Minimal unique palindromic substrings after single-character substitution (Q2146122) (← links)
• Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
• Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
• Some results on the number of periodic factors in words (Q2288207) (← links)
• Efficient computation of longest single-arm-gapped palindromes in a string (Q2297859) (← links)
• Universal reconstruction of a string (Q2297860) (← links)
• Faster queries for longest substring palindrome after block edit (Q5088918) (← links)
• Longest substring palindrome after edit (Q5140775) (← links)
• Efficient representation and counting of antipower factors in words (Q5919279) (← links)
• Internal pattern matching queries in a text and applications (Q6621750) (← links)