Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words
From MaRDI portal
Publication:782596
DOI10.1007/978-3-030-40608-0_27zbMath1446.68130OpenAlexW3009111940MaRDI QIDQ782596
Rocco Zaccagnino, Clelia De Felice, Paola Bonizzoni, Rosalba Zizza
Publication date: 27 July 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-40608-0_27
Related Items
Can formal languages help pangenomics to represent and analyze multiple genomes?, Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches, On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties, Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning