Efficient string matching with k mismatches
Theoretical Computer Science
Fast string matching with k-differences
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
High-order entropy-compressed text indexes
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
SIAM Journal on Computing
Algorithms on Strings
Algorithmic Aspects of Bioinformatics (Natural Computing Series)
Algorithmic Aspects of Bioinformatics (Natural Computing Series)
A new succinct representation of RMQ-information and improvements in the enhanced suffix array
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
An index structure for spaced seed search
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
| Hi-index | 0.00 |
Approximate searching using an index is an important application in many fields. In this paper we introduce a new data structure called the gapped suffix array for approximate searching in the Hamming distance model. Building on the well known filtration approach for approximate searching, the use of the gapped suffix array can improve search speed by avoiding the merging of position lists.