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 QIDQ2061990FDOQ2061990

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

Publication date: 21 December 2021

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

Recommendations

• Estimating sequence similarity from read sets for clustering next-generation sequencing data
• Optimizing Read Reversals for Sequence Compression
• Analysis of min-hashing for variant tolerant DNA read mapping
• Various improvements to text fingerprinting
• Variable length local decoding and alignment-free sequence comparison

zbMATH Keywords

machine learningsequence analysisLyndon factorizationsequence miningread representation

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Factorizing words over an ordered alphabet
• On Burnside's Problem
• Free differential calculus. IV: The quotient groups of the lower central series
• 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
• Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words
• In-place bijective burrows-wheeler transforms

Cited In (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)