We consider the problem of jumbled matching where the objective is to find all permuted occurrences of a pattern in a text. Besides exact matching we study approximate matching where each occurrence is allowed to cont...
详细信息
We consider the problem of jumbled matching where the objective is to find all permuted occurrences of a pattern in a text. Besides exact matching we study approximate matching where each occurrence is allowed to contain at most k wrong or superfluous characters. We present online algorithms applying bit-parallelism to both types of jumbled matching. Two of our algorithms are filtration methods applying simd (Single Instruction Multiple Data) computation. Most of the other new algorithms are variations of earlier methods. We show by practical experiments that our algorithms are competitive with previous solutions. (C) 2018 Elsevier B.V. All rights reserved.
作者：
EFE, KCenter for Adv. Comput. Studies
Southwestern Louisiana Univ. Lafayette LA USA Abstract Authors References Cited By Keywords Metrics Similar Download Citation Email Print Request Permissions
A new interconnection structure is proposed as a basis for distributed memory parallel computer architectures. The network is a variation from the hypercube and preserves many of its desirable properties. It has the s...
详细信息
A new interconnection structure is proposed as a basis for distributed memory parallel computer architectures. The network is a variation from the hypercube and preserves many of its desirable properties. It has the same node and link complexity, but has a diameter only about half of that of the hypercube. After a discussion of the basic properties of the proposed network, efficient routing and broadcasting algorithms are presented.
暂无评论