Pages that link to "Item:Q5363085"
From MaRDI portal
The following pages link to A new characterization of maximal repetitions by Lyndon trees (Q5363085):
Displaying 21 items.
- On the density of Lyndon roots in factors (Q507403) (← links)
- Fast computation of abelian runs (Q507408) (← links)
- 2D Lyndon words and applications (Q513297) (← links)
- Counting maximal-exponent factors in words (Q728262) (← links)
- Lyndon words formalized in Isabelle/HOL (Q832940) (← links)
- Lyndon array construction during Burrows-Wheeler inversion (Q1632505) (← links)
- Computing primitively-rooted squares and runs in partial words (Q1678102) (← 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)
- Can formal languages help pangenomics to represent and analyze multiple genomes? (Q2163974) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
- Two-dimensional maximal repetitions (Q2297850) (← links)
- Longest $$\alpha $$-Gapped Repeat and Palindrome (Q2947867) (← links)
- Prefix-Suffix Square Completion (Q3449365) (← links)
- (Q5009559) (← links)
- (Q5088889) (← links)
- Small-space LCE data structure with constant-time queries (Q5111224) (← links)
- Almost linear time computation of maximal repetitions in run length encoded strings (Q5136252) (← links)
- The “Runs” Theorem (Q5359492) (← links)
- Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches (Q6195191) (← links)
