default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohamed Ibrahim Abouelhoda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j7]Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda:
Computing the Burrows-Wheeler transform of a string and its reverse in parallel. J. Discrete Algorithms 25: 21-33 (2014)- 2012
- [c11]Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda:
Computing the Burrows-Wheeler Transform of a String and Its Reverse. CPM 2012: 243-256 - 2010
- [c10]Mohamed Ibrahim Abouelhoda, Hisham Mohamed:
Parallel Chaining Algorithms. EuroMPI 2010: 142-151
2000 – 2009
- 2009
- [j6]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): 287-308 (2009) - [c9]Hisham Mohamed, Mohamed Ibrahim Abouelhoda:
WinBioinfTools: Bioinformatics tools for Windows cluster. CLUSTER 2009: 1-4 - [i1]Mohamed Ibrahim Abouelhoda, Hisham Mohamed:
WinBioinfTools: Bioinformatics Tools for Windows High Performance Computing Server 2008. CoRR abs/0905.0586 (2009) - 2008
- [j5]Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch:
CoCoNUT: an efficient system for the comparison and analysis of genomes. BMC Bioinform. 9 (2008) - [j4]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) - [c8]Mohamed Ibrahim Abouelhoda, Robert Giegerich, Behshad Behzadi, Jean-Marc Steyaert:
Alignment of Minisatellite Maps: A Minimum Spanning Tree-based Approach. APBC 2008: 261-272 - 2007
- [j3]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): 637-646 (2007) - [c7]Mohamed Ibrahim Abouelhoda:
A Chaining Algorithm for Mapping cDNA Sequences to Multiple Genomic Sequences. SPIRE 2007: 1-13 - 2005
- [b1]Mohamed Ibrahim Abouelhoda:
Algorithms and a software system for comparative genome analysis. Universität Ulm, 2005, pp. I-IV, 1-191 - [j2]Mohamed Ibrahim Abouelhoda, Enno Ohlebusch:
Chaining algorithms for multiple genome comparison. J. Discrete Algorithms 3(2-4): 321-341 (2005) - [c6]Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel, Jan Stallkamp:
The Median Problem for the Reversal Distance in Circular Bacterial Genomes. CPM 2005: 116-127 - [c5]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: 29-43 - [p1]Mohamed Ibrahim Abouelhoda:
Algorithmen und Softwarewerkzeuge für Vergleichende Genomanalyse. Ausgezeichnete Informatikdissertationen 2005: 9-18 - 2004
- [j1]Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch:
Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2(1): 53-86 (2004) - 2003
- [c4]Mohamed Ibrahim Abouelhoda, Enno Ohlebusch:
Multiple Genome Alignment: Chaining Algorithms Revisited. CPM 2003: 1-16 - [c3]Mohamed Ibrahim Abouelhoda, Enno Ohlebusch:
A Local Chaining Algorithm and Its Applications in Comparative Genomics. WABI 2003: 1-16 - 2002
- [c2]Mohamed Ibrahim Abouelhoda, Enno Ohlebusch, Stefan Kurtz:
Optimal Exact Strring Matching Based on Suffix Arrays. SPIRE 2002: 31-43 - [c1]Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch:
The Enhanced Suffix Array and Its Applications to Genome Analysis. WABI 2002: 449-463
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-04 03:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
