Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Sung, Wing-Kin Ken" - School of Computing, National University of Singapore
Constructing Compressed Sux Arrays with Large Alphabets ?
A Linear Size Index for Approximate Pattern Matching
International Journal of Foundations of Computer Science # World Scientific Publishing Company
Model gene network by semi-fixed Bayesian network Tie-Fei Liu a
Practical Aspects of Compressed Su#x Arrays and FMindex in Searching DNA Sequences
Fast and Accurate Probe Selection Algorithm for Large Genomes WingKin Sung
Improved Approximate String Matching using Compressed Suffix Data Structures
Succinct Data Structures for Searchable Partial Wing-Kai Hon 1 , Kunihiko Sadakane 2 , and Wing-Kin Sung 3
Ultra-succinct Representation of Ordered Trees Jesper Jansson
The Maximum Agreement of Two Nested Phylogenetic Networks
Breaking a TimeandSpace Barrier in Constructing FullText Indices
Compressed Indexes for Approximate String Matching
SIAM J. COMPUT. c 2006 Society for Industrial and Applied Mathematics Vol. 35, No. 5, pp. 10981121
A Space and Time Ecient Algorithm for Constructing Compressed Sux Arrays
Vol. 22 no. 13 2006, pages 16231630 doi:10.1093/bioinformatics/btl145BIOINFORMATICS ORIGINAL PAPER
DOI: 10.1007/s00453-004-1147-5 Algorithmica (2005) 293307
A Correlated Motif Approach for Finding Short Linear Motifs from Protein-Protein Interaction Data
ConstrainedMotif: A Periodicity Constraint Based Algorithm to Predict Cell-cycle Associated Promoter Motifs using Time-course Gene Expression Data
Constructing a Smallest Refining Galled Phylogenetic Network
