Browsing by Author "Abouelhoda, Mohamed"

Now showing items 1-2 of 2

    • Parallelizing exact motif finding algorithms on multi-core 

      Abbas, Mostafa M.; Bahig, Hazem M.; Abouelhoda, Mohamed; Mohie-Eldin, M.M. ( Springer Science+Business Media , 2014 , Article)
      The motif finding problem is one of the important and challenging problems in bioinformatics. A variety of sequential algorithms have been proposed to find exact motifs, but the running time is still not suitable due to ...

    • Using the Sadakane compressed suffix tree to solve the all-pairs suffix-prefix problem 

      Rachid, Maan Haj; Malluhi, Qutaibah; Abouelhoda, Mohamed ( Hindawi , 2014 , Article)
      The all-pairs suffix-prefix matching problem is a basic problem in string processing. It has an application in the de novo genome assembly task, which is one of the major bioinformatics problems. Due to the large size of ...