dblp.uni-trier.dewww.uni-trier.de

Mohamed Ibrahim Abouelhoda Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
15EEMohamed Ibrahim Abouelhoda, Hisham Mohamed: WinBioinfTools: Bioinformatics Tools for Windows High Performance Computing Server 2008 CoRR abs/0905.0586: (2009)
14EEMohamed Ibrahim Abouelhoda, Robert Giegerich, Behshad Behzadi, Jean-Marc Steyaert: Alignment of Minisatellite Maps Based on Run-Length Encoding Scheme. J. Bioinformatics and Computational Biology 7(2): 287-308 (2009)
2008
13EEMohamed Ibrahim Abouelhoda, Robert Giegerich, Behshad Behzadi, Jean-Marc Steyaert: Alignment of Minisatellite Maps: A Minimum Spanning Tree-based Approach. APBC 2008: 261-272
12EEMartin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohlebusch: A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions. BMC Bioinformatics 9: (2008)
11EEMohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch: CoCoNUT: an efficient system for the comparison and analysis of genomes. BMC Bioinformatics 9: (2008)
2007
10EEMohamed Ibrahim Abouelhoda: A Chaining Algorithm for Mapping cDNA Sequences to Multiple Genomic Sequences. SPIRE 2007: 1-13
9EEEnno 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
8EEEnno 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
6EEMohamed Ibrahim Abouelhoda, Enno Ohlebusch: Chaining algorithms for multiple genome comparison. J. Discrete Algorithms 3(2-4): 321-341 (2005)
2004
5EEMohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch: Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2(1): 53-86 (2004)
2003
4EEMohamed Ibrahim Abouelhoda, Enno Ohlebusch: Multiple Genome Alignment: Chaining Algorithms Revisited. CPM 2003: 1-16
3EEMohamed Ibrahim Abouelhoda, Enno Ohlebusch: A Local Chaining Algorithm and Its Applications in Comparative Genomics. WABI 2003: 1-16
2002
2EEMohamed Ibrahim Abouelhoda, Enno Ohlebusch, Stefan Kurtz: Optimal Exact Strring Matching Based on Suffix Arrays. SPIRE 2002: 31-43
1EEMohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch: The Enhanced Suffix Array and Its Applications to Genome Analysis. WABI 2002: 449-463

Coauthor Index

1Martin Bader [12]
2Behshad Behzadi [13] [14]
3Robert Giegerich [13] [14]
4Kathrin Hockel [8] [9]
5Stefan Kurtz [1] [2] [5] [11]
6Hisham Mohamed [15]
7Enno Ohlebusch [1] [2] [3] [4] [5] [6] [7] [8] [9] [11] [12]
8Jan Stallkamp [8]
9Jean-Marc Steyaert [13] [14]
10Christian Wawra [7]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)