Pages that link to "Item:Q1795498"
From MaRDI portal
The following pages link to Inverse Lyndon words and inverse Lyndon factorizations of words (Q1795498):
Displaying 15 items.
- Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words (Q782596) (← links)
- New results on Nyldon words and Nyldon-like sets (Q820920) (← links)
- Lyndon words and singular factors of sturmian words (Q1292480) (← links)
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties (Q1998861) (← links)
- Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning (Q2061990) (← links)
- Can formal languages help pangenomics to represent and analyze multiple genomes? (Q2163974) (← links)
- Reprint of: ``Generalized Lyndon factorizations of infinite words'' (Q2192374) (← links)
- Nyldon words (Q2318478) (← links)
- On generalized Lyndon words (Q2422029) (← links)
- Unbordered factors and Lyndon words (Q2483406) (← links)
- Lyndon factorization of infinite words (Q4593925) (← links)
- Generalized Lyndon factorizations of infinite words (Q5919346) (← links)
- Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches (Q6195191) (← links)
- Constructing and indexing the bijective and extended Burrows-Wheeler transform (Q6204171) (← links)
- String attractors of some simple-parry automatic sequences (Q6661762) (← links)