2 papers
cs.DS2017
Optimum Search Schemes for Approximate String Matching Using Bidirectional FM-Index
Kiavash Kianfar, Christopher Pockrandt, Bahman Torkamandi +2
Finding approximate occurrences of a pattern in a text using a full-text index is a central problem in bioinformatics and has been extensively researched. Bidirectional indices hav…
cs.DS2016
EPR-dictionaries: A practical and fast data structure for constant time searches in unidirectional and bidirectional FM-indices
Christopher Pockrandt, Marcel Ehrhardt, Knut Reinert
We introduce a new, practical method for conducting an exact search in a uni- and bidirectional FM index in time per step while using bits o…