Pang Ko

2003

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

Whom Pang Ko trusts overall

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

  1. Mohamed Ibrahim Abouelhoda
  2. Stefan Kurtz
  3. Enno Ohlebusch

Who trusts Pang Ko overall

  1. Gonzalo Navarro
  2. Ge Nong
  3. Veli Mäkinen
  4. Juha Kärkkäinen
  5. Sen Zhang
  6. Wai Hong Chan
  7. Mohamed Ibrahim Abouelhoda

Papers from Pang Ko's perspective

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

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

Their papers