Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning
From MaRDI portal
Publication:2061990
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
Cites work
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- Factorizing words over an ordered alphabet
- Free differential calculus. IV: The quotient groups of the lower central series
- In-place bijective burrows-wheeler transforms
- Inverse Lyndon words and inverse Lyndon factorizations of words
- Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words
- On Burnside's Problem
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
- The origins of combinatorics on words
Cited in
(2)
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)