Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform

DOI10.1016/j.ipl.2019.03.003zbMath1473.68220arXiv1708.01130OpenAlexW2743382354MaRDI QIDQ2414057

Yanyan Li

Publication date: 10 May 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.01130

zbMATH Keywords

pattern matchingBurrows-Wheeler transformstring algorithmdegenerate string

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Related Items

Can Burrows-Wheeler transform be replaced in chain code compression? ⋮ Efficient pattern matching in elastic-degenerate strings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Indeterminate string factorizations and degenerate text transformations
• AN ADAPTIVE HYBRID PATTERN-MATCHING ALGORITHM ON INDETERMINATE STRINGS
• Two Efficient Algorithms for Linear Time Suffix Array Construction