Mohamed Ibrahim Abouelhoda

J. Discrete Algorithms · 2004

A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 13 researchers here, as inferred from the citation graph.

Whom Mohamed Ibrahim Abouelhoda trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Stefan Kurtz
  2. Eugene W. Myers
  3. Roberto Grossi
  4. Paolo Ferragina
  5. Pang Ko
  6. Juha Kärkkäinen

Who trusts Mohamed Ibrahim Abouelhoda overall

  1. Heng Li
  2. Pang Ko
  3. Simon J. Puglisi
  4. David Ellinghaus
  5. Masumi Shirakawa
  6. Stefan Kurtz
  7. Gordon Gremme
  8. Graham Neubig
  9. Chang Liu
  10. Nils Homer

Papers from Mohamed Ibrahim Abouelhoda's perspective

Ordered by how strongly the researchers Mohamed Ibrahim Abouelhoda trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Opportunistic data structures with applications
  2. A Block-sorting Lossless Data Compression Algorithm
  3. Suffix arrays: a new method for on-line string searches
  4. Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) (Symposium on the Theory of Computing)
  5. Fast algorithms for large-scale genome alignment and comparison. (Nucleic Acids Research)
  6. The LCA Problem Revisited (Latin American Symposium on Theoretical Informatics)
  7. Simple Linear Work Suffix Array Construction
  8. Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications (Annual Symposium on Combinatorial Pattern Matching)
  9. REPuter: the manifold applications of repeat analysis on a genomic scale. (Nucleic Acids Research)
  10. Space efficient linear time construction of suffix arrays

Their papers