J. Bahi

Learn More
Among the unsolved problems in computational biology, protein folding is one of the most interesting challenges. To study this folding, tools like neural networks and genetic algorithms have received a lot of attention, mainly due to the NP completeness of the folding process. The background idea that has given rise to the use of these algorithms is(More)
In this paper, we aim at exploiting the power computing of a graphics processing unit (GPU) cluster for solving large sparse linear systems. We implement the parallel algorithm of the generalized minimal residual iterative method using the Compute Unified Device Architecture programming language and the MPI parallel environment. The experiments show that a(More)
In this paper, we present a new pseudorandom number generator (PRNG) on graphics processing units (GPU). This PRNG is based on the so-called chaotic iterations. It is firstly proven to be chaotic according to the Devaney’s formulation. We, thus, propose an efficient implementation for GPU that successfully passes the BigCrush tests, deemed to be the hardest(More)
Self-avoiding walks (SAW) are the source of very difficult problems in probabilities and enumerative combinatorics. They are also of great interest as they are, for instance, the basis of protein structure prediction in bioin-formatics. Authors of this article have previously shown that, depending on the prediction algorithm, the sets of obtained(More)
112 Tunisian patients with rapidly progressing breast cancer (RPBC) were entered into a clinical trial evaluating combination chemotherapy as a primary form of treatment before surgery or radiotherapy. Three cycles of cyclophosphamide, methotrexate, and 5-fluorouracil (CMF) were administered at monthly intervals; patients were then randomized to surgery or(More)
Various genome evolutionary models have been proposed these last decades to predict the evolution of a DNA sequence over time, essentially described using a mutation matrix. By essence, all of these models relate the evolution of DNA sequences to the computation of the successive powers of the mutation matrix. To make this computation possible, hypotheses(More)