A new approach to text searching
Communications of the ACM
Fast text searching: allowing errors
Communications of the ACM
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Text-Retrieval: Theory and Practice
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Approximate String-Matching over Suffix Trees
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
A Faster Algorithm for Approximate String Matching
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
An efficient algorithm for generating super condensed neighborhoods
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Efficient generation of super condensed neighborhoods
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a pattern neighbourhood. These sets play an important role in the generation phase of hybrid algorithms for indexed approximate string matching. An existing algorithm for this purpose is based on a dynamic programming approach, implemented using bit-parallelism. In this work we present a bit-parallel algorithm based on automata which is faster, conceptually much simpler and uses less memory than the existing method.