The following pages link to Rocco Zaccagnino (Q728276):
Displaying 12 items.
- Unavoidable sets and circular splicing languages (Q728277) (← links)
- Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words (Q782596) (← links)
- Testing DNA code words properties of regular languages (Q896711) (← 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 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)
- Hybrid and generalized marked systems (Q2243582) (← links)
- An Easy Automata Based Algorithm for Testing Coding Properties of Infinite Sets of (DNA) Words (Q4649276) (← links)
- Unavoidable Sets, Prefix Graphs and Regularity of Circular Splicing Languages (Q5114209) (← links)
- From the Lyndon factorization to the Canonical Inverse Lyndon factorization: back and forth (Q6532347) (← links)
- On the efficacy of ``herd behavior'' in the commodities market: a neuro-fuzzy agent ``herding'' on deep learning traders (Q6581594) (← links)
