A faster algorithm for the computation of string convolutions using LZ78 parsing
From MaRDI portal
Publication:765493
DOI10.1016/j.ipl.2010.05.010zbMath1234.68475OpenAlexW1971884004MaRDI QIDQ765493
Valerio Freschi, Alessandro Bogliolo
Publication date: 19 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.010
Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Speeding up HMM decoding and training by exploiting sequence repetitions
- Simple deterministic wildcard matching
- Indexing text using the Ziv--Lempel trie
- Let sleeping files lie: Pattern matching in Z-compressed files.
- Matching with don't-cares and a small number of mismatches
- Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
- k-Mismatch with Don’t Cares
- Compression of individual sequences via variable-rate coding
- Algorithms on Strings, Trees and Sequences
- A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
This page was built for publication: A faster algorithm for the computation of string convolutions using LZ78 parsing
