Approximate String Matching Using a Bidirectional Index

DOI10.1007/978-3-319-07566-2_23zbMath1409.68356arXiv1310.1440OpenAlexW4391013395WikidataQ58064465 ScholiaQ58064465MaRDI QIDQ5165608

Gregory Kucherov, Dekel Tsur, Kamil Salikhov

Publication date: 30 June 2014

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

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

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Related Items (1)

Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds

This page was built for publication: Approximate String Matching Using a Bidirectional Index