Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning

DOI10.1007/978-3-030-74432-8_2zbMath1477.92012OpenAlexW3171819403MaRDI QIDQ2061990

Yuri Pirola, Rocco Zaccagnino, Rosalba Zizza, Clelia De Felice, Alessia Petescia, Paola Bonizzoni, Jens Stoye, Raffaella Rizzi

Publication date: 21 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-74432-8_2

zbMATH Keywords

sequence analysismachine learningLyndon factorizationsequence miningread representation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Protein sequences, DNA sequences (92D20)

Related Items (1)

Can formal languages help pangenomics to represent and analyze multiple genomes?

Cites Work

• Unnamed Item
• Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words
• The origins of combinatorics on words
• Inverse Lyndon words and inverse Lyndon factorizations of words
• On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
• Factorizing words over an ordered alphabet
• On Burnside's Problem
• In-place bijective burrows-wheeler transforms
• Free differential calculus. IV: The quotient groups of the lower central series

This page was built for publication: Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning