Window Subsequence Problems for Compressed Texts
From MaRDI portal
Publication:3434688
DOI10.1007/11753728_15zbMath1178.68694OpenAlexW2116513710MaRDI QIDQ3434688
Irène Guessarian, Yury Lifshits, Patrick Cégielski, Yu. V. Matiyasevich
Publication date: 2 May 2007
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11753728_15
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Related Items
Speeding up HMM decoding and training by exploiting sequence repetitions, Tree inclusions in windows and slices, Faster subsequence recognition in compressed strings, 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, Random Access to Grammar-Compressed Strings and Trees
