Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts

DOI10.1007/978-3-642-21458-5_27zbMath1339.68340OpenAlexW1705442494MaRDI QIDQ3011864

Shunsuke Inenaga, Masayuki Takeda, Takanori Yamamoto, Hideo Bannai

Publication date: 29 June 2011

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2324/19882

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Related Items

Compressed subsequence matching and packed tree coloring

Cites Work

• Faster subsequence recognition in compressed strings
• Compressed string-matching in standard Sturmian words
• Searching subsequences
• Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition
• Self-indexed Text Compression Using Straight-Line Programs
• Window Subsequence Problems for Compressed Texts
• Fast Pattern Matching in Strings
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Automata, Languages and Programming
• Querying and Embedding Compressed Texts
• Unnamed Item
• Unnamed Item