Approximate string matching using a bidirectional index

DOI10.1016/j.tcs.2015.10.043zbMath1345.68304OpenAlexW1939142881WikidataQ58064453 ScholiaQ58064453MaRDI QIDQ294959

Kamil Salikhov, Dekel Tsur, Gregory Kucherov

Publication date: 16 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.10.043

zbMATH Keywords

approximate pattern matching

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Algorithms on strings (68W32)

Related Items (2)

Bidirectional Variable-Order de Bruijn Graphs ⋮ Wheeler graphs: a framework for BWT-based data structures

Uses Software

• BWA

Cites Work

• Unnamed Item
• Unnamed Item
• Bidirectional search in a string with wavelet trees and bidirectional matching statistics
• Poisson approximation for dependent trials
• Approximate string matching with compressed indexes
• Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
• Compressed representations of sequences and full-text indexes
• Fast Approximate Search in Large Dictionaries
• Faster Filters for Approximate String Matching
• Automata, Languages and Programming
• Algorithms and Computation

This page was built for publication: Approximate string matching using a bidirectional index