Wing-Kin Sung

According to our database1, Wing-Kin Sung authored at least 163 papers between 1996 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Faster algorithms for 1-mappability of a sequence.
Theor. Comput. Sci., 2020

2019
Off-line and on-line algorithms for closed string factorization.
Theor. Comput. Sci., 2019

Guest Editors' Foreword.
J. Graph Algorithms Appl., 2019

An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees.
Journal of Computational Biology, 2019

A Weakly Supervised Learning Based Clustering Framework.
CoRR, 2019

An integrated package for bisulfite DNA methylation data analysis with Indel-sensitive mapping.
BMC Bioinformatics, 2019

Greedy Consensus Tree and Maximum Greedy Consensus Tree Problems.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

A Linear Time Algorithm for the r-Gathering Problem on the Line (Extended Abstract).
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Computing the Rooted Triplet Distance Between Phylogenetic Networks.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2018
Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree.
IEEE/ACM Trans. Comput. Biology Bioinform., 2018

Determining the Consistency of Resolved Triplets and Fan Triplets.
Journal of Computational Biology, 2018

A Faster Construction of Greedy Consensus Trees.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
On finding the Adams consensus tree.
Inf. Comput., 2017

A Faster Construction of Phylogenetic Consensus Trees.
CoRR, 2017

BATVI: Fast, sensitive and accurate detection of virus integrations.
BMC Bioinformatics, 2017

Computing Asymmetric Median Tree of Two Trees via Better Bipartite Matching Algorithm.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Efficient Identification of k-Closed Strings.
Proceedings of the Engineering Applications of Neural Networks, 2017

2016
Indexed Approximate String Matching.
Encyclopedia of Algorithms, 2016

Maximum Agreement Supertree.
Encyclopedia of Algorithms, 2016

Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network.
Encyclopedia of Algorithms, 2016

Improved Algorithms for Constructing Consensus Trees.
J. ACM, 2016

Faster Algorithms for Computing the R* Consensus Tree.
Algorithmica, 2016

Minimal Phylogenetic Supertrees and Local Consensus Trees.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015
An O(m, log m)-Time Algorithm for Detecting Superbubbles.
IEEE/ACM Trans. Comput. Biology Bioinform., 2015

Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space.
Algorithmica, 2015

2014
Fast relative Lempel-Ziv self-index for similar sequences.
Theor. Comput. Sci., 2014

Guest Editorial for the International Conference on Genome Informatics (GIW 2013).
IEEE/ACM Trans. Comput. Biology Bioinform., 2014

CWig: compressed representation of Wiggle/BedGraph format.
Bioinformatics, 2014

2013
Compact Data structures for Big Data (NII Shonan Meeting 2013-10).
NII Shonan Meet. Rep., 2013

3D Chromosome Modeling with Semi-Definite Programming and Hi-C Data.
Journal of Computational Biology, 2013

Simultaneously Learning DNA Motif Along with Its Position and Sequence Rank Preferences Through Expectation Maximization Algorithm.
Journal of Computational Biology, 2013

The 24th International Conference on genome Informatics, Giw2013, in Singapore.
J. Bioinformatics and Computational Biology, 2013

International Conference on Genome Informatics (GIW 2013) in Singapore: introduction to the systems biology contributions.
BMC Systems Biology, 2013

Constructing the R* Consensus Tree of Two Trees in Subcubic Time.
Algorithmica, 2013

Compressed Directed Acyclic Word Graph with Application in Local Alignment.
Algorithmica, 2013

Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree.
Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

Inference of Spatial Organizations of Chromosomes Using Semi-definite Embedding Approach and Hi-C Data.
Proceedings of the Research in Computational Molecular Biology, 2013

An Optimal Algorithm for Building the Majority Rule Consensus Tree.
Proceedings of the Research in Computational Molecular Biology, 2013

Reconstructing k-Reticulated Phylogenetic Network from a Set of Gene Trees.
Proceedings of the Bioinformatics Research and Applications, 9th International Symposium, 2013

2012
More efficient periodic traversal in anonymous undirected graphs.
Theor. Comput. Sci., 2012

Ultra-succinct representation of ordered trees with applications.
J. Comput. Syst. Sci., 2012

Polynomial-Time Algorithms for Building a Consensus MUL-Tree.
Journal of Computational Biology, 2012

Bioinformatics Applications in Genomics.
IEEE Computer, 2012

BatMis: a fast algorithm for k-mismatch mapping.
Bioinformatics, 2012

Simultaneously Learning DNA Motif along with Its Position and Sequence Rank Preferences through EM Algorithm.
Proceedings of the Research in Computational Molecular Biology, 2012

CRAM: Compressed Random Access Memory.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Succinct data structures for Searchable Partial Sums with optimal worst-case performance.
Theor. Comput. Sci., 2011

Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets.
IEEE/ACM Trans. Comput. Biology Bioinform., 2011

Partial convex recolorings of trees and galled networks: Tight upper and lower bounds.
ACM Trans. Algorithms, 2011

CENTDIST: discovery of co-associated factors by motif distribution.
Nucleic Acids Research, 2011

A linear size index for approximate pattern matching.
J. Discrete Algorithms, 2011

Structural Alignment of RNA with Complex Pseudoknot Structure.
Journal of Computational Biology, 2011

Opera: Reconstructing Optimal Genomic Scaffolds with High-Throughput Paired-End Sequences.
Journal of Computational Biology, 2011

PE-Assembler: de novo assembler using short paired-end reads.
Bioinformatics, 2011

Improved Algorithms for Maximum Agreement and Compatible Supertrees.
Algorithmica, 2011

Algorithms for Building Consensus MUL-trees.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Mining transcriptional association rules from breast cancer profile data.
Proceedings of the IEEE International Conference on Information Reuse and Integration, 2011

2010
Compressed random access memory
CoRR, 2010

A signal-noise model for significance analysis of ChIP-seq with negative control.
Bioinformatics, 2010

SLiM on Diet: finding short linear motifs on domain interaction interfaces in Protein Data Bank.
Bioinformatics, 2010

Localized motif discovery in gene regulatory sequences.
Bioinformatics, 2010

Compressed Indexes for Approximate String Matching.
Algorithmica, 2010

Indexing Similar DNA Sequences.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices.
SIAM J. Comput., 2009

Brief Overview of Bioinformatics Activities in Singapore.
PLoS Computational Biology, 2009

Clustering-Based Approach for Predicting Motif Pairs from protein Interaction Data.
J. Bioinformatics and Computational Biology, 2009

Structural Alignment of RNA with Complex Pseudoknot Structure.
Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

The 2-Interval Pattern Matching Problems and Its Application to ncRNA Scanning.
Proceedings of the Bioinformatics and Computational Biology, 2009

2008
Maximum Agreement Supertree.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Indexed Approximate String Matching.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Constructing a Galled Phylogenetic Network.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Non-overlapping Common Substrings Allowing Mutations.
Mathematics in Computer Science, 2008

RB-Finder: An Improved Distance-Based Sliding Window Method to Detect Recombination Breakpoints.
Journal of Computational Biology, 2008

Spectrum-Based De Novo Repeat Detection in Genomic Sequences.
Journal of Computational Biology, 2008

Using Indirect protein-protein Interactions for protein Complex Prediction.
J. Bioinformatics and Computational Biology, 2008

LOMA: A fast method to generate efficient tagged-random primers despite amplification bias of random PCR on pathogens.
BMC Bioinformatics, 2008

An HMM approach to genome-wide identification of differential histone modification sites from ChIP-seq data.
Bioinformatics, 2008

MotifVoter: a novel ensemble method for fine-grained integration of generic motif finders.
Bioinformatics, 2008

Compressed indexing and local alignment of DNA.
Bioinformatics, 2008

Improved Approximate String Matching Using Compressed Suffix Data Structures.
Algorithmica, 2008

Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees.
Proceedings of the STACS 2008, 2008

A Streamlined and Generalized Analysis of Chromatin ImmunoPrecipitation Paired-End diTag Data.
Proceedings of the Computational Science, 2008

2007
Reconstructing Recombination Network from Sequence Data: The Small Parsimony Problem.
IEEE/ACM Trans. Comput. Biology Bioinform., 2007

Fast algorithms for computing the tripartition-based distance between phylogenetic networks.
J. Comb. Optim., 2007

Identifying differentially expressed genes in Time-Course microarray Experiment without Replicate.
J. Bioinformatics and Computational Biology, 2007

Using indirect protein interactions for the prediction of Gene Ontology functions.
BMC Bioinformatics, 2007

Detection of generic spaced motifs using submotif pattern mining.
Bioinformatics, 2007

An efficient strategy for extensive integration of diverse biological data for protein function prediction.
Bioinformatics, 2007

A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays.
Algorithmica, 2007

The Point Placement Problem on a Line - Improved Bounds for Pairwise Distance Queries.
Proceedings of the Algorithms in Bioinformatics, 7th International Workshop, 2007

Ultra-succinct representation of ordered trees.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Space Efficient Indexes for String Matching with Don't Cares.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences.
Proceedings of the 23rd International Conference on Data Engineering, 2007

Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

An Experimental Study of Compressed Indexing and Local Alignments of DNA.
Proceedings of the Combinatorial Optimization and Applications, 2007

2006
Inferring a level-1 phylogenetic network from a dense set of rooted triplets.
Theor. Comput. Sci., 2006

Approximate string matching using compressed suffix arrays.
Theor. Comput. Sci., 2006

Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network.
SIAM J. Comput., 2006

Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs.
Journal of Computational Biology, 2006

Inferring Phylogenetic Relationships Avoiding Forbidden Rooted Triplets.
J. Bioinformatics and Computational Biology, 2006

Learning Gene Network Using Time-delayed Bayesian Network.
International Journal on Artificial Intelligence Tools, 2006

Model gene network by semi-fixed Bayesian network.
Expert Syst. Appl., 2006

Probabilistic prediction of protein-protein interactions from the protein sequences.
Comp. in Bio. and Med., 2006

A correlated motif approach for finding short linear motifs from protein interaction networks.
BMC Bioinformatics, 2006

PET-Tool: a software suite for comprehensive processing and managing of Paired-End diTag (PET) sequence data.
BMC Bioinformatics, 2006

Exploiting indirect neighbours and topological weight to predict protein function from protein-protein interactions.
Bioinformatics, 2006

A Faster and More Space-Efficient Algorithm for Inferring Arc-Annotations of RNA Sequences through Alignment.
Algorithmica, 2006

LocalMotif - An In-Silico Tool for Detecting Localized Motifs in Regulatory Sequences.
Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), 2006

Learning Gene Network Using Conditional Dependence.
Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), 2006

Differential Friendly Neighbors Algorithm for Differential Relationships Based Gene Selection and Classification using Microarray Data.
Proceedings of the 2006 International Conference on Data Mining, 2006

2005
Effective Algorithms for Tag Snp Selection.
J. Bioinformatics and Computational Biology, 2005

Adaptive Control of Hybridization Noise in Dna Sequencing-by-hybridization.
J. Bioinformatics and Computational Biology, 2005

Protein Structure and Fold Prediction Using Tree-augmented Naïve Bayesian Classifier.
J. Bioinformatics and Computational Biology, 2005

Protein subcellular localization prediction for Gram-negative bacteria using amino acid subalphabets and a combination of multiple support vector machines.
BMC Bioinformatics, 2005

The mutated subsequence problem and locating conserved genes.
Bioinformatics, 2005

Computational modeling of oligonucleotide positional densities for human promoter prediction.
Artif. Intell. Medicine, 2005

Rooted Maximum Agreement Supertrees.
Algorithmica, 2005

Finding Short Right-Hand-on-the-Wall Walks in Graphs.
Proceedings of the Structural Information and Communication Complexity, 2005

Constructing a Smallest Refining Galled Phylogenetic Network.
Proceedings of the Research in Computational Molecular Biology, 2005

Discriminative Fusion Approach for Automatic Image Annotation.
Proceedings of the IEEE 7th Workshop on Multimedia Signal Processing, 2005

ConstrainedMotif: A Periodicity Constraint Based Algorithm to Predict Cell-Cycle Associated Promoter Motifs Using Time-Course Gene Expression Data.
Proceedings of the Fifth IEEE International Symposium on Bioinformatic and Bioengineering (BIBE 2005), 2005

Multimodality as a Criterion for Feature Selection in Unsupervised Analysis of Gene Expression Data.
Proceedings of the Fifth IEEE International Symposium on Bioinformatic and Bioengineering (BIBE 2005), 2005

Allowing mismatches in anchors for wholw genome alignment: Generation and effectiveness.
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

A better gap penalty for pairwise SVM.
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

2004
Non-shared edges and nearest neighbor interchanges revisited.
Inf. Process. Lett., 2004

Subtree Transfer Distance For Degree-D Phylogenies.
Int. J. Found. Comput. Sci., 2004

Computing the Maximum Agreement of Phylogenetic Networks.
Electron. Notes Theor. Comput. Sci., 2004

G-PRIMER: greedy algorithm for selecting minimal primer set.
Bioinformatics, 2004

Protein Structure and Fold Prediction Using Tree-Augmented Bayesian Classifier.
Proceedings of the Biocomputing 2004, 2004

The Maximum Agreement of Two Nested Phylogenetic Networks.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Learning Multi-Time Delay Gene Network Using Bayesian Network Framework.
Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 2004

News sports video shot classification with sports play field and motion features.
Proceedings of the 2004 International Conference on Image Processing, 2004

Gene Network Modeling through Semi-Fixed Bayesian Network.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

Compressed Index for Dynamic Text.
Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

Discovering Novel Interacting Motif Pairs from Large Protein-Protein Interaction Datasets.
Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004

Constraint Based Method for Finding Motifs in DNA Sequences.
Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004

A Mutation-Sensitive Approach for Locating Conserved Gene Pairs between Related Species.
Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004

Practical aspects of Compressed Suffix Arrays and FM-Index in Searching DNA Sequences.
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003
The Enhanced Double Digest Problem for DNA Physical Mapping.
J. Comb. Optim., 2003

Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs.
Journal of Computational Biology, 2003

Succinct Data Structures for Searchable Partial Sums.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Constructing Compressed Suffix Arrays with Large Alphabets.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Tag SNP selection by brute-force and heuristic algorithms.
Proceedings of the German Conference on Bioinformatics, 2003

Fast and Accurate Probe Selection Algorithm for Large Genomes.
Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003

On All-Substrings Alignment Problems.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

Video Retrieval by Context-Based Interpretation of Time-to-Collision Descriptors.
Proceedings of the Computer Analysis of Images and Patterns, 10th International Conference, 2003

2002
Automatic construction of online catalog topologies.
IEEE Trans. Systems, Man, and Cybernetics, Part C, 2002

Improved Phylogeny Comparisons: Non-Shared Edges Nearest Neighbor Interchanges, and Subtree Transfers
CoRR, 2002

On the Control of Hybridization Noise in DNA Sequencing-by-Hybridization.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
A Decomposition Theorem for Maximum Weight Bipartite Matchings.
SIAM J. Comput., 2001

An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings.
J. Algorithms, 2001

Pervasive Multimedia Markup Language (PMML): an XML-based multimedia content specification for pervasive access.
Proceedings of the Poster Proceedings of the Tenth International World Wide Web Conference, 2001

2000
Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees.
SIAM J. Comput., 2000

Construction of Online Catalog Topologies Using Decision Trees.
Proceedings of the Second International Workshop on Advance Issues of E-Commerce and Web-Based Information Systems (WECWIS 2000), 2000

Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

A Faster and Unifying Algorithm for Comparing Trees.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1999
A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees.
Proceedings of the Algorithms, 1999

1998
Default-Sensitive PreProcessings for Finding Maxima.
Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1997
General Techniques for Comparing Unrooted Evolutionary Trees.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

All-Cavity Maximum Matchings.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996
Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time.
Nord. J. Comput., 1996


  Loading...