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

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

Yuri Pirola, Rocco Zaccagnino, Rosalba Zizza, Clelia De Felice, Alessia Petescia, P. 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

Could not fetch data.

Cites Work

• Title not available (Why is that?)
• 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

Related Items (1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2061990)