… new parallel algorithms for a set of classical string comparison problems: computation of string
… We discuss the scalability of our new parallel algorithms in computation time, in memory, …

… In this paper, we have presented an efficient coarse grained parallel algorithm for semilocal
string comparison based on a parallel highest-score matrix multiplication procedure. Our …

… The ingenuous bit-parallel LCS algorithms by … on efficient parallel hardware adders for a
tile update; we note that the design of such adders can also be expressed as a parallel prefix …

… comparisons to O(n/d) by using d computation parts, simultaneously. In Fig. 15, for example
with d=3 and m=4, CP 1 …CP 3 work in parallel and perform three diagonals of comparisons …

… The string editing problem for input strings x and y consists of … In various ways and forms,
the string editing problem arises … not least, molecular sequence comparison. For this reason, …

… Any parallel sorting algorithm which is based on comparisons can be used here. We assume
of course, some total order on the … Vishkin, "An efficient parallel biconnectivity algorithm", …

… But the proposed schemes are vulnerable to malicious attacks since in the worst case they
must frequently access the relatively slow off-chip SRAMs to launch exact string comparisons. …

… parallel string matching. In order to balance memory usage between homogeneous finite-state
machine (FSM) tiles for each string … 4.44%, in comparison with the existing bit-split string …

… Then, we noticed that the parallel algorithm yields as a byproduct … (For comparison, the space
requirement of our algorithm is O(… , Introducing efficient parallelism into approximate string …

… Therefore, we made the comparison by using the error threshold of 10% for Hobbes3. The
proposed algorithm achieved the maximum speedup of \(3.38\times\) against the Hobbes3. If …