| 2008 |
|---|
| 11 | EE | 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 |
|---|
| 10 | EE | Mohamed Ibrahim Abouelhoda:
A Chaining Algorithm for Mapping cDNA Sequences to Multiple Genomic Sequences.
SPIRE 2007: 1-13 |
| 9 | EE | 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) |
| 2005 |
|---|
| 8 | EE | Enno Ohlebusch,
Mohamed Ibrahim Abouelhoda,
Kathrin Hockel,
Jan Stallkamp:
The Median Problem for the Reversal Distance in Circular Bacterial Genomes.
CPM 2005: 116-127 |
| 7 | | 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 |
| 6 | EE | Mohamed Ibrahim Abouelhoda,
Enno Ohlebusch:
Chaining algorithms for multiple genome comparison.
J. Discrete Algorithms 3(2-4): 321-341 (2005) |
| 2004 |
|---|
| 5 | EE | Mohamed Ibrahim Abouelhoda,
Stefan Kurtz,
Enno Ohlebusch:
Replacing suffix trees with enhanced suffix arrays.
J. Discrete Algorithms 2(1): 53-86 (2004) |
| 2003 |
|---|
| 4 | EE | Mohamed Ibrahim Abouelhoda,
Enno Ohlebusch:
Multiple Genome Alignment: Chaining Algorithms Revisited.
CPM 2003: 1-16 |
| 3 | EE | Mohamed Ibrahim Abouelhoda,
Enno Ohlebusch:
A Local Chaining Algorithm and Its Applications in Comparative Genomics.
WABI 2003: 1-16 |
| 2002 |
|---|
| 2 | EE | Mohamed Ibrahim Abouelhoda,
Enno Ohlebusch,
Stefan Kurtz:
Optimal Exact Strring Matching Based on Suffix Arrays.
SPIRE 2002: 31-43 |
| 1 | EE | Mohamed Ibrahim Abouelhoda,
Stefan Kurtz,
Enno Ohlebusch:
The Enhanced Suffix Array and Its Applications to Genome Analysis.
WABI 2002: 449-463 |
