Pages that link to "Item:Q2922642"

The following pages link to Inferring Strings from Lyndon Factorization (Q2922642):

Displaying 12 items.

• Optimal canonization of all substrings of a string (Q1183603) (← links)
• Reconstructing a string from its Lyndon arrays (Q1698704) (← links)
• Inverse Lyndon words and inverse Lyndon factorizations of words (Q1795498) (← links)
• On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties (Q1998861) (← links)
• Lyndon factorization algorithms for small alphabets and run-length encoded strings (Q2004905) (← links)
• String inference from longest-common-prefix array (Q2110373) (← links)
• Indeterminate string factorizations and degenerate text transformations (Q2363995) (← links)
• Inferring strings from Lyndon factorization (Q2402270) (← links)
• Linear construction of a left Lyndon tree (Q2672265) (← links)
• Inferring strings from cover arrays (Q2846478) (← links)
• Algorithms for the Lyndon unique maximal factorization (Q3089218) (← links)
• Universal Reconstruction of a String (Q3449836) (← links)