Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  introduce a new method for conducting an exact search in a uni- and bidirectional FM index in $\mathcal{O}(1)$ time per step while using $\mathcal{O}(\log \sigma \cdot n) + o(\log \sigma \cdot \sigma \cdot n)$ bits of space. This is done by replacing the wavelet tree by a new data structure, the \emph{Enhanced Prefixsum Rank dictionary} (EPR-dictionary). To our knowledge this is the first constant time method for a search step in 2FM indices and a space improvement for FM indices.  implemented this method in the SeqAn C++ library and experimentally validated our theoretical results. In addition  compared our implementation with other freely available implementations of bidirectional indices and show that  are beten $\approx 2.7-4.6$ times faster. This will have a large impact for many bioinformatics applications that rely on practical implementations of (2)FM indices e.g. for read mapping.
['Christopher Pockrandt', 'Marcel Ehrhardt', 'Knut Reinert']
I am writing a research paper on a idea Constant-time and space-efficient unidirectional and bidirectional FM-indices using EPR-dictionaries
[{"from": "human", "value": "I am writing a research paper on a idea Constant-time and space-efficient unidirectional and bidirectional FM-indices using EPR-dictionaries"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  introduce a new method for conducting an exact search in a uni- and bidirectional FM index in $\\mathcal{O}(1)$ time per step while using $\\mathcal{O}(\\log \\sigma \\cdot n) + o(\\log \\sigma \\cdot \\sigma \\cdot n)$ bits of space. This is done by replacing the wavelet tree by a new data structure, the \\emph{Enhanced Prefixsum Rank dictionary} (EPR-dictionary). To our knowledge this is the first constant time method for a search step in 2FM indices and a space improvement for FM indices.  implemented this method in the SeqAn C++ library and experimentally validated our theoretical results. In addition  compared our implementation with other freely available implementations of bidirectional indices and show that  are beten $\\approx 2.7-4.6$ times faster. This will have a large impact for many bioinformatics applications that rely on practical implementations of (2)FM indices e.g. for read mapping."}]