Pages that link to "Item:Q4915247"

The following pages link to Generic Algorithms for Factoring Strings (Q4915247):

Displaying 15 items.

• A linear partitioning algorithm for hybrid Lyndons using \(V\)-order (Q390899) (← links)
• Parallel RAM algorithms for factorizing words (Q1325834) (← links)
• Reconstructing a string from its Lyndon arrays (Q1698704) (← links)
• Enhanced string factoring from alphabet orderings (Q1711413) (← links)
• Lyndon-like and V-order factorizations of strings (Q1827280) (← links)
• Lyndon factorization algorithms for small alphabets and run-length encoded strings (Q2004905) (← links)
• String factorisations with maximum or minimum dimension (Q2006777) (← links)
• A bijective variant of the Burrows-Wheeler transform using \(V\)-order (Q2441784) (← links)
• Computing equality-free and repetitive string factorisations (Q2634669) (← links)
• String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time (Q3011844) (← links)
• Algorithms for the Lyndon unique maximal factorization (Q3089218) (← links)
• Combinatorics of Unique Maximal Factorization Families (UMFFs) (Q3400579) (← links)
• PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS (Q3526553) (← links)
• Factorizing a String into Squares in Linear Time (Q5369562) (← links)
• (Q6075975) (← links)