Mohamed Ibrahim Abouelhoda

Publication Activity (10 Years)

Years Active: 2002-2014
Publications (10 Years): 0

Top Venues

CPM

J. Discrete Algorithms

Universität Ulm (PHD)

Education History

Universität Ulm

PHD

Publications

Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda
Computing the Burrows-Wheeler transform of a string and its reverse in parallel. J. Discrete Algorithms 25 (2014)
Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda
Computing the Burrows-Wheeler Transform of a String and Its Reverse. CPM (2012)
Mohamed Ibrahim Abouelhoda, Hisham Mohamed
Parallel Chaining Algorithms. EuroMPI (2010)
Hisham Mohamed, Mohamed Ibrahim Abouelhoda
WinBioinfTools: Bioinformatics tools for Windows cluster. CLUSTER (2009)
Mohamed Ibrahim Abouelhoda, Robert Giegerich, Behshad Behzadi, Jean-Marc Steyaert
Alignment of Minisatellite Maps Based on Run-Length Encoding Scheme. J. Bioinform. Comput. Biol. 7 (2) (2009)
Mohamed Ibrahim Abouelhoda, Hisham Mohamed
WinBioinfTools: Bioinformatics Tools for Windows High Performance Computing Server 2008 CoRR (2009)
Mohamed Ibrahim Abouelhoda, Robert Giegerich, Behshad Behzadi, Jean-Marc Steyaert
Alignment of Minisatellite Maps: A Minimum Spanning Tree-based Approach. APBC (2008)
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions. BMC Bioinform. 9 (2008)
Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch
CoCoNUT: an efficient system for the comparison and analysis of genomes. BMC Bioinform. 9 (2008)
Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel
A linear time algorithm for the inversion median problem in circular bacterial genomes. J. Discrete Algorithms 5 (4) (2007)
Mohamed Ibrahim Abouelhoda
A Chaining Algorithm for Mapping cDNA Sequences to Multiple Genomic Sequences. SPIRE (2007)
Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
Chaining algorithms for multiple genome comparison. J. Discrete Algorithms 3 (2-4) (2005)
Mohamed Ibrahim Abouelhoda
Algorithmen und Softwarewerkzeuge für Vergleichende Genomanalyse. Ausgezeichnete Informatikdissertationen (2005)
Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel, Jan Stallkamp
The Median Problem for the Reversal Distance in Circular Bacterial Genomes. CPM (2005)
Christian Wawra, Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
Efficient mapping of large cDNA/EST databases to genomes: A comparison of two different strategies. German Conference on Bioinformatics (2005)
Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch
Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2 (1) (2004)
Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
A Local Chaining Algorithm and Its Applications in Comparative Genomics. WABI (2003)
Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
Multiple Genome Alignment: Chaining Algorithms Revisited. CPM (2003)
Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch
The Enhanced Suffix Array and Its Applications to Genome Analysis. WABI (2002)
Mohamed Ibrahim Abouelhoda, Enno Ohlebusch, Stefan Kurtz
Optimal Exact Strring Matching Based on Suffix Arrays. SPIRE (2002)

Mohamed Ibrahim Abouelhoda.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mohamed Ibrahim Abouelhoda