The following pages link to Counting suffix arrays and strings (Q932319):
Displaying 17 items.
- On the number of elements to reorder when updating a suffix array (Q414460) (← links)
- Inferring strings from suffix trees and links on a binary alphabet (Q496548) (← links)
- A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- Counting certain binary strings (Q665047) (← links)
- Counting distinct strings (Q1277320) (← links)
- String inference from longest-common-prefix array (Q2110373) (← links)
- When a dollar makes a BWT (Q2220786) (← links)
- Inferring strings from Lyndon factorization (Q2402270) (← links)
- Efficient computation of substring equivalence classes with suffix arrays (Q2408913) (← links)
- On the combinatorics of suffix arrays (Q2445335) (← links)
- Counting Colours in Compressed Strings (Q3011854) (← links)
- Counting Parameterized Border Arrays for a Binary Alphabet (Q3618600) (← links)
- (Q3740259) (← links)
- Counting Dependent and Independent Strings (Q5415292) (← links)
- On suffix tree detection (Q6545407) (← links)
- On suffix tree detection (Q6593670) (← links)