Variable length local decoding and alignment-free sequence comparison

DOI10.1016/j.tcs.2012.08.005zbMath1252.68359OpenAlexW1992056504WikidataQ106468862 ScholiaQ106468862MaRDI QIDQ690447

Ivan Laprevotte, Gilles Didier, Claudine Landès-Devauchelle, Eduardo Corel, Alexander Grossmann

Publication date: 27 November 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.08.005

zbMATH Keywords

algorithmcodingprefix codegenetic sequences comparison

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Related Items (2)

Sequence graph transform (SGT): a feature embedding function for sequence data mining ⋮ Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches

Uses Software

• DIALIGN
• DIALIGN-TX
• phyloXML

Cites Work

• Coding with variable block maps
• The characterization of \(N\)-écritures and applications to the study of sequences of finally \(n+c^{st}\) complexity
• A universal data compression system

This page was built for publication: Variable length local decoding and alignment-free sequence comparison