Pages that link to "Item:Q1827280"

The following pages link to Lyndon-like and V-order factorizations of strings (Q1827280):

Displaying 12 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)
• Computation of the suffix array, Burrows-Wheeler transform and FM-index in \(V\)-order (Q2043023) (← links)
• Indeterminate string factorizations and degenerate text transformations (Q2363995) (← 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)
• PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS (Q3526553) (← links)
• Generic Algorithms for Factoring Strings (Q4915247) (← links)
• \(V\)-words, Lyndon words and substring circ-UMFFs (Q6606210) (← links)