Bridging Lossy and Lossless Compression by Motif Pattern Discovery

DOI10.1007/11889342_51zbMath1158.68389OpenAlexW4254565208MaRDI QIDQ5504228

Alberto Apostolico, Matteo Comin, Laxmi Parida

Publication date: 22 January 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11889342_51

zbMATH Keywords

motifpattern matchinggrammatical inferencepattern discoverygrammar based codeslossy and lossless data compressionoff-line textual substitution

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (4)

Motif trie: an efficient text index for pattern discovery with don't cares ⋮ Textual data compression in computational biology: algorithmic techniques ⋮ Filtering degenerate patterns with application to protein sequence analysis ⋮ Extracting string motif bases for quorum higher than two

This page was built for publication: Bridging Lossy and Lossless Compression by Motif Pattern Discovery