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
A Unified View to String Matching Algorithms
SOFSEM '96 Proceedings of the 23rd Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Faster Bit-Parallel Approximate String Matching
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
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
Faster generation of super condensed neighbourhoods using finite automata
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is one in which any node of a network only has information on nodes at distance ...