Paper
6 October 2000 Parallel k-mismatching of strings using daughter-board structure
Toomas P. Plaks
Author Affiliations +
Abstract
This paper presents a family of scalable regular array structures for k-mismatches problem of a reference string of length n and a pattern of length m. The conventional regular array of size O(m) computes in O(n + m). The drawback of his solution is, first, that the performance is bounded by the length of pattern, and second, the long latency. In this paper we present regular array solutions where the array size is parameterized by the number, s, 1<=s<=n, of parallel input/output channels. The array of size O(sm) computes in O(n/s + m) time. In order to reduce the latency time, tree-like structures for computing reduction are used, reducing the time complexity to O(n/s + m^{1/r}), r is the dimensionality of array. The number of patterns can be l, while the time complexity increases to O(n/s + m^{1/r}+l) using O(sml) processors. Proposed regular arrays are suitable for teal-time applications and are efficiently mapped onto FPGAs using daughter-board structure.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Toomas P. Plaks "Parallel k-mismatching of strings using daughter-board structure", Proc. SPIE 4212, Reconfigurable Technology: FPGAs for Computing and Applications II, (6 October 2000); https://doi.org/10.1117/12.402514
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Multilayers

Algorithm development

Field programmable gate arrays

Computing systems

Algorithms

Array processing

Matrix multiplication

Back to Top