Faster Approximate Pattern Matching in Compressed Repetitive Texts
From MaRDI portal
Publication:3104667
DOI10.1007/978-3-642-25591-5_67zbMath1350.68301arXiv1109.2930OpenAlexW1834563926MaRDI QIDQ3104667
Paweł Gawrychowski, Simon J. Puglisi, Travis Gagie
Publication date: 16 December 2011
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.2930
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Algorithms on strings (68W32)
Related Items (8)
Block graphs in practice ⋮ Compressed matching for feature vectors ⋮ Block trees ⋮ Pattern Matching on Elastic-Degenerate Text with Errors ⋮ Approximate pattern matching on elastic-degenerate text ⋮ LZ-End Parsing in Linear Time ⋮ Approximate pattern matching in LZ77-compressed texts ⋮ Lazy Lempel-Ziv Factorization Algorithms
This page was built for publication: Faster Approximate Pattern Matching in Compressed Repetitive Texts
