The following pages link to (Q4386294):
Displaying 15 items.
- \(V\)-order: new combinatorial properties \& a simple comparison algorithm (Q323035) (← links)
- A linear partitioning algorithm for hybrid Lyndons using \(V\)-order (Q390899) (← links)
- Binary block order Rouen transform (Q507387) (← links)
- Reconstructing a string from its Lyndon arrays (Q1698704) (← links)
- A survey of string orderings and their application to the Burrows-Wheeler transform (Q1698705) (← links)
- Lyndon-like and V-order factorizations of strings (Q1827280) (← links)
- Computation of the suffix array, Burrows-Wheeler transform and FM-index in \(V\)-order (Q2043023) (← links)
- A bijective variant of the Burrows-Wheeler transform using \(V\)-order (Q2441784) (← links)
- String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time (Q3011844) (← links)
- (Q3742134) (← links)
- To find all ``suitable'' orders of 0,1-vectors (Q4386295) (← links)
- Sets of 0, 1 vectors with minimal sets of subvectors (Q4398533) (← links)
- Ordering Integer Vectors for Coordinate Deletions (Q4716717) (← links)
- Generic Algorithms for Factoring Strings (Q4915247) (← links)
- \(V\)-words, Lyndon words and substring circ-UMFFs (Q6606210) (← links)
