University of Ulm -
Fakulty of Computer Science -
Theoretical Computer Science -
Bioinformatics AG
Papers
Mohamed Ibrahim Abouelhoda
Conference papers
- Mohamed Ibrahim Abouelhoda
Algorithmen und Ein Software System für Genomvergleich (Algorithms and a Software System for Comparative Genome Analysis)
In Ausgezeichnete Informatikdissertationen 2005, LNI-Dissertations D-6, GI, 2006
[Preprint (German)]
[(English)]
- Christian Wawra, Mohamed Ibrahim Abouelhoda,
Enno Ohlebusch
Efficient Mapping of Large cDNA/EST Databases to Genomes:
A Comparison of two Different Strategies
Proceedings of the German Conference on Bioinformatics,
pages 29-43, LNI 73, GI, 2005. [Preprint]
- Enno Ohlebusch, Mohamed Ibrahim Abouelhoda,
Kathrin Hockel, Jan Stallkamp
The Median Problem for the Reversal Distance in Circular Bacterial
Genomes
Proceedings of the 16th Annual Symposium on Combinatorial Pattern
Matching, pages 116-127, LNCS 3537, 2005.
© Springer-Verlag
[Preprint]
- Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
CHAINER: Software for Comparing Genomes
Short paper accepted at ISMB/ECCB 2004
(12th International Conference on Intelligent Systems
for Molecular Biology/3rd European Conference on Computational Biology)
- Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
A Local Chaining Algorithm and its Applications in Comparative
Genomics
Proceedings of the 3rd Workshop on Algorithms in Bioinformatics,
pages 1-16, LNBI 2812, 2003.
- Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
Multiple Genome Alignment: Chaining Algorithms Revisited
Proceedings of the 14th Annual Symposium on Combinatorial Pattern
Matching, pages 1-16, LNCS 2676, 2003.
© Springer-Verlag
- Mohamed Ibrahim Abouelhoda, Enno Ohlebusch,
Stefan Kurtz
Optimal Exact String Matching Based on Suffix Arrays
Proceedings of the 9th International Symposium on String Processing
and Information Retrieval, pages 31-43, LNCS 2476, 2002.
© Springer-Verlag
- Mohamed Ibrahim Abouelhoda, Stefan Kurtz,
Enno Ohlebusch
The Enhanced Suffix Array and its
Applications to Genome Analysis
Proceedings of the 2nd Workshop on Algorithms in Bioinformatics,
pages 449-463, LNCS 2452, 2002.
© Springer-Verlag