Hazem M. Bahig

Learn More
We consider the problem of sorting n integers when the elements are drawn from the restricted domain [1...n]. A new deterministic parallel algorithm for sorting n integers is obtained. Its running time is O(lognlog(n/logn)) using n/logn processors on EREW (exclusive read exclusive write) PRAM (parallel random access machine). Also, our algorithm was(More)
Given a set of DNA sequences s1, ..., s t , the (l, d) motif problem is to find an l-length motif sequence M , not necessary existing in any of the input sequences, such that for each sequence s i , 1 ≤ i ≤ t, there is at least one subsequence differing with at most d mismatches from M. Many exact algorithms have been developed to solve the motif finding(More)
We consider the planted (l,d)-motif search problem, which consists of finding a substring of length l that occurs in each s ( i ) in a set of input sequences {s (1),…,s ( t )} with at most d substitutions. In this paper, we study the effect of using Balla, Davila, and Rajasekaran strategy on voting algorithm practically. We call this technique, modified(More)
Restriction site analysis involves determining the locations of restriction sites after the process of digestion by reconstructing their positions based on the lengths of the cut DNA. Using different reaction times with a single enzyme to cut DNA is a technique known as a partial digestion. Determining the exact locations of restriction sites following a(More)
We consider the planted (l, d) motif search problem, which consists of finding a substring of length l that occurs in a set of input sequences &#x007B;s<inf>1</inf>, s<inf>2</inf>, &#x2026;, s<inf>n</inf>&#x007D; with maximum Hamming distance, d, around the similar substring. In this paper, we present an experimental comparison between voting algorithm and(More)
In this paper, we study the merging of two sorted arrays $A=(a_{1},a_{2},\ldots, a_{n_{1}})$ and $B=(b_{1},b_{2},\ldots,b_{n_{2}})$ on EREW PRAM with two restrictions: (1) The elements of two arrays are taken from the integer range [1,n], where n=Max(n 1,n 2). (2) The elements are taken from either uniform distribution or non-uniform distribution such that(More)