Faster subsequence recognition in compressed strings
From MaRDI portal
Publication:843615
DOI10.1007/s10958-009-9396-0zbMath1187.68507OpenAlexW1571081892MaRDI QIDQ843615
Publication date: 15 January 2010
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-009-9396-0
Pattern recognition, speech recognition (68T10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (7)
Straight-line programs: a practical test (extended abstract) ⋮ Unified compression-based acceleration of edit-distance computation ⋮ Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition ⋮ Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts ⋮ Compressed subsequence matching and packed tree coloring ⋮ Unnamed Item ⋮ Fast distance multiplication of unit-Monge matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multidimensional divide-and-conquer
- Approximately matching context-free languages
- Multiple serial episodes matching
- Semi-local string comparison: algorithmic techniques and applications
- Semi-local longest common subsequences in subquadratic time
- A faster algorithm computing string edit distances
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Approximate string matching on Ziv--Lempel compressed text
- A taxonomy of sublinear multiple keyword pattern matching algorithms
- Window Subsequence Problems for Compressed Texts
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Algorithms on Strings, Trees and Sequences
- A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
- Querying and Embedding Compressed Texts
This page was built for publication: Faster subsequence recognition in compressed strings
