Tak Wah Lam

Michael C. Schatz

Int. J. Comput. Biol. Drug Des., 2020

MegaPath-Nano: Accurate Compositional Analysis and Drug-level Antimicrobial Resistance Detection Software for Oxford Nanopore Long-read Metagenomics.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2020

ChromSeg: Two-Stage Framework for Overlapping Chromosome Segmentation and Reconstruction.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2020

Translocator: local realignment and global remapping enabling accurate translocation detection using single-molecule sequencing long reads.

[BibT_eX]

[DOI]

Proceedings of the BCB '20: 11th ACM International Conference on Bioinformatics, 2020

2019

RENET: A Deep Learning Approach for Extracting Gene-Disease Associations from Literature.

[BibT_eX]

[DOI]

Proceedings of the Research in Computational Molecular Biology, 2019

2018

AC-DIAMOND v1: accelerating large-scale DNA-protein alignment.

[BibT_eX]

[DOI]

Bioinform., 2018

Dictionary Matching with a Bounded Gap in Pattern or in Text.

[BibT_eX]

[DOI]

Algorithmica, 2018

MegaPath: Low-Similarity Pathogen Detection from Metagenomic NGS Data (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 8th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2018

2017

Accurate annotation of metagenomic data without species-level references.

[BibT_eX]

[DOI]

Int. J. Data Min. Bioinform., 2017

MegaGTA: a sensitive and accurate metagenomic gene-targeted assembler using iterative de Bruijn graphs.

[BibT_eX]

[DOI]

BMC Bioinform., 2017

2016

Parallel Connectivity and Minimum Spanning Trees.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

PnpProbs: a better multiple sequence alignment tool by better handling of guide trees.

[BibT_eX]

[DOI]

Yongtao Ye

BMC Bioinform., 2016

AC-DIAMOND: Accelerating Protein Alignment via Better SIMD Parallelization and Space-Efficient Indexing.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics and Biomedical Engineering, 2016

2015

GLProbs: Aligning Multiple Sequences Adaptively.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2015

Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models.

[BibT_eX]

[DOI]

Jianqiao Zhu

Theory Comput. Syst., 2015

Improving multiple sequence alignment by using better guide trees.

[BibT_eX]

[DOI]

BMC Bioinform., 2015

MICA: A fast short-read aligner that takes full advantage of Many Integrated Core Architecture (MIC).

[BibT_eX]

[DOI]

BMC Bioinform., 2015

database.bio: a web application for interpreting human variations.

[BibT_eX]

[DOI]

Bioinform., 2015

MEGAHIT: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph.

[BibT_eX]

[DOI]

Bioinform., 2015

Compressing Dictionary Matching Index via Sparsification Technique.

[BibT_eX]

[DOI]

Algorithmica, 2015

Guest Editors Foreword.

[BibT_eX]

[DOI]

Leizhen Cai

Siu-Wing Cheng

Algorithmica, 2015

Predicting RNA Secondary Structures: One-grammar-fits-all Solution.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics Research and Applications - 11th International Symposium, 2015

A simple and economical method for improving whole-genome alignment.

[BibT_eX]

[DOI]

Huijun Mai

Proceedings of the 5th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2015

Dictionary Matching with Uneven Gaps.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014

GPU-Accelerated BWT Construction for Large Collection of Short Reads.

[BibT_eX]

[DOI]

Chi-Man Liu

Ruibang Luo

CoRR, 2014

MICA: A fast short-read aligner that takes full advantage of Intel Many Integrated Core Architecture (MIC).

[BibT_eX]

[DOI]

CoRR, 2014

SOAPdenovo-Trans: de novo transcriptome assembly with short RNA-Seq reads.

[BibT_eX]

[DOI]

Bioinform., 2014

FaSD-somatic: a fast and accurate somatic SNV detection algorithm for cancer genome sequencing data.

[BibT_eX]

[DOI]

Bioinform., 2014

2013

Scheduling for weighted flow time and energy with rejection penalty.

[BibT_eX]

[DOI]

Sze-Hang Chan

Lap-Kei Lee

Theor. Comput. Sci., 2013

SOAPfusion: a robust and effective computational fusion discovery tool for RNA-seq reads.

[BibT_eX]

[DOI]

Bioinform., 2013

Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy.

[BibT_eX]

[DOI]

Algorithmica, 2013

Nonclairvoyant sleep management and flow-time scheduling on multiple processors.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

A Local Structural Prediction Algorithm for RNA Triple Helix Structure.

[BibT_eX]

[DOI]

Proceedings of the Pattern Recognition in Bioinformatics, 2013

LCR_Finder: A de Novo Low Copy Repeat Finder for Human Genome.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics Research and Applications, 9th International Symposium, 2013

Competitive Online Algorithms for Multiple-Machine Power Management and Weighted Flow Time.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Computing: The Australasian Theory Symposium, 2013

2012

Memory Efficient Algorithms for Structural Alignment of RNAs with Pseudoknots.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2012

An Efficient Alignment Algorithm for Searching Simple Pseudoknots over Long Genomic Sequence.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Improved multi-processor scheduling for flow time and energy.

[BibT_eX]

[DOI]

J. Sched., 2012

COPE: an accurate k-mer-based pair-end reads connection tool to facilitate genome assembly.

[BibT_eX]

[DOI]

Bioinform., 2012

SOAP3: ultra-fast GPU-based parallel alignment tool for short reads.

[BibT_eX]

[DOI]

Bioinform., 2012

Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window.

[BibT_eX]

[DOI]

Algorithmica, 2012

Non-clairvoyant weighted flow time scheduling with rejection penalty.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Efficient SNP-sensitive alignment and database-assisted SNP calling for low coverage samples.

[BibT_eX]

[DOI]

Proceedings of the ACM International Conference on Bioinformatics, 2012

Online Flow Time Scheduling in the Presence of Preemption Overhead.

[BibT_eX]

[DOI]

Rongbin Li

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011

Cache-oblivious index for approximate string matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Tradeoff between energy and throughput for online deadline scheduling.

[BibT_eX]

[DOI]

Alberto Marchetti-Spaccamela

Rongbin Li

Sustain. Comput. Informatics Syst., 2011

A linear size index for approximate pattern matching.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2011

Structural Alignment of RNA with Complex Pseudoknot Structure.

[BibT_eX]

[DOI]

J. Comput. Biol., 2011

Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 2011

RNASAlign: RNA Structural Alignment System.

[BibT_eX]

[DOI]

Bioinform., 2011

Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window.

[BibT_eX]

[DOI]

Algorithms, 2011

Nonclairvoyant Speed Scaling for Flow and Energy.

[BibT_eX]

[DOI]

Kirk Pruhs

Algorithmica, 2011

Energy-Efficient Due Date Scheduling.

[BibT_eX]

[DOI]

Rongbin Li

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Edit Distance to Monotonicity in Sliding Windows.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Sleep Management on Multiple Machines for Energy and Flow Time.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Algorithms for pseudoknot classification.

[BibT_eX]

[DOI]

Proceedings of the ACM International Conference on Bioinformatics, 2011

Detection of novel tandem duplication with next-generation sequencing.

[BibT_eX]

[DOI]

Proceedings of the ACM International Conference on Bioinformatics, 2011

2010

Deadline scheduling and power management for speed bounded processors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Improving the accuracy of signal transduction pathway construction using level-2 neighbours.

[BibT_eX]

[DOI]

Int. J. Bioinform. Res. Appl., 2010

Compressed Indexes for Approximate String Matching.

[BibT_eX]

[DOI]

Algorithmica, 2010

Online Tracking of the Dominance Relationship of Distributed Multi-dimensional Data.

[BibT_eX]

[DOI]

Chi-Man Liu

Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Local Structural Alignment of RNA with Affine Gap Model.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics Research and Applications, 6th International Symposium, 2010

Non-clairvoyant Speed Scaling for Weighted Flow Time.

[BibT_eX]

[DOI]

Sze-Hang Chan

Lap-Kei Lee

Proceedings of the Algorithms, 2010

Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors.

[BibT_eX]

[DOI]

Proceedings of the Theory of Computing 2010, 2010

Indexing Similar DNA Sequences.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009

Optimizing throughput and energy in online deadline scheduling.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

Correcting short reads with high error rates for improved sequencing result.

[BibT_eX]

[DOI]

Int. J. Bioinform. Res. Appl., 2009

SOAP2: an improved ultrafast tool for short read alignment.

[BibT_eX]

[DOI]

Bioinform., 2009

Structural Alignment of RNA with Complex Pseudoknot Structure.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

Succinct Text Indexing with Wildcards.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2009

Succinct Index for Dynamic Dictionary Matching.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Sleep with Guilt and Work Faster to Minimize Flow Plus Energy.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

The 2-Interval Pattern Matching Problems and Its Application to ncRNA Scanning.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics and Computational Biology, 2009

High Throughput Short Read Alignment via Bi-directional BWT.

[BibT_eX]

[DOI]

Proceedings of the 2009 IEEE International Conference on Bioinformatics and Biomedicine, 2009

2008

Parallel Connectivity and Minimum Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Nonmigratory Multiprocessor Scheduling for Response Time and Energy.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2008

Dynamic bin packing of unit fractions items.

[BibT_eX]

[DOI]

Joseph Wun-Tat Chan

Prudence W. H. Wong

Theor. Comput. Sci., 2008

Extra Unit-Speed Machines Are Almost as Powerful as Speedy Machines for Flow Time Scheduling.

[BibT_eX]

[DOI]

Kin-Shing Liu

SIAM J. Comput., 2008

Non-overlapping Common Substrings Allowing Mutations.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2008

Finding Alternative Splicing Patterns with Strong Support from expressed Sequences on Individual exons/introns.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2008

Compressed indexing and local alignment of DNA.

[BibT_eX]

[DOI]

Bioinform., 2008

Improved Approximate String Matching Using Compressed Suffix Data Structures.

[BibT_eX]

[DOI]

Wing-Kin Sung

Swee-Seong Wong

Algorithmica, 2008

Competitive non-migratory scheduling for flow time and energy.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Scheduling for Speed Bounded Processors.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

Compressed Index for Dictionary Matching.

[BibT_eX]

[DOI]

Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

A Memory Efficient Algorithm for Structural Alignment of RNAs with Embedded Simple Pseudoknots.

[BibT_eX]

[DOI]

Proceedings of the 6th Asia-Pacific Bioinformatics Conference, 2008

2007

Compressed indexes for dynamic text collections.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

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

[BibT_eX]

[DOI]

Algorithmica, 2007

Online Deadline Scheduling with Bounded Energy Efficiency.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2007

Energy efficient online deadline scheduling.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Space Efficient Indexes for String Matching with Don't Cares.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Energy Efficient Deadline Scheduling in Two Processor Systems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

An Experimental Study of Compressed Indexing and Local Alignments of DNA.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2007

Finding Alternative Splicing Patterns with Strong Support From Expressed Sequences.

[BibT_eX]

Proceedings of the International Conference on Bioinformatics & Computational Biology, 2007

Efficiency of Data Distribution in BitTorrent-Like Systems.

[BibT_eX]

[DOI]

Prudence W. H. Wong

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

Approximate string matching using compressed suffix arrays.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2006

Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling.

[BibT_eX]

[DOI]

Kin-Shing Liu

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

A More Accurate and Efficient Whole Genome Phylogeny.

[BibT_eX]

[DOI]

P. Y. Chan

Siu-Ming Yiu

Proceedings of 4th Asia-Pacific Bioinformatics Conference. 13-16 February 2006, 2006

2005

Nonmigratory Online Deadline Scheduling on Multiprocessors.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

On-line Stream Merging with Max Span and Min Coverage.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2005

A Tighter Extra-Resource Analysis of Online Deadline Scheduling.

[BibT_eX]

[DOI]

Tsuen-Wan Ngan

J. Comb. Optim., 2005

Efficient Constrained Multiple Sequence Alignment with Performance Guarantee.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2005

Filtering of Ineffective siRNAs and Improved siRNA Design Tool.

[BibT_eX]

[DOI]

Bioinform., 2005

The mutated subsequence problem and locating conserved genes.

[BibT_eX]

[DOI]

Bioinform., 2005

Dynamic dictionary matching and compressed suffix trees.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Allowing mismatches in anchors for wholw genome alignment: Generation and effectiveness.

[BibT_eX]

[DOI]

Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

2004

Extra Processors versus Future Information in Optimal Deadline Scheduling.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2004

Performance guarantee for EDF under overload.

[BibT_eX]

[DOI]

Tsuen-Wan Ngan

J. Algorithms, 2004

Non-shared edges and nearest neighbor interchanges revisited.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

Subtree Transfer Distance For Degree-D Phylogenies.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2004

Aggressive Online Deadline Scheduling.

[BibT_eX]

[DOI]

Proceedings of Computing: The Australasian Theory Symposium, 2004

An efficient algorithm for optimizing whole genome alignment with noise.

[BibT_eX]

[DOI]

Bioinform., 2004

Non-migratory online deadline scheduling on multiprocessors.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Finding motifs for insufficient number of sequences with strong binding to transcription facto.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004

Compressed Index for Dynamic Text.

[BibT_eX]

[DOI]

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

Compressed Index for a Dynamic Collection of Texts.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

A Mutation-Sensitive Approach for Locating Conserved Gene Pairs between Related Species.

[BibT_eX]

[DOI]

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.

[BibT_eX]

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003

On-line scheduling with tight deadlines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

On-line stream merging in a general setting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Competitive Deadline Scheduling via Additional or Faster Processors.

[BibT_eX]

[DOI]

J. Sched., 2003

Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs.

[BibT_eX]

[DOI]

J. Comput. Biol., 2003

Improving the efficiency of parallel minimum spanning tree algorithms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Efficient Algorithms for Optimizing Whole Genome Alignment with Noise.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Constructing Compressed Suffix Arrays with Large Alphabets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Efficient Constrained Multiple Sequence Alignment with Performance Guarantee.

[BibT_eX]

[DOI]

Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003

2002

Automatic construction of online catalog topologies.

[BibT_eX]

[DOI]

IEEE Trans. Syst. Man Cybern. Part C, 2002

On-line load balancing of temporary tasks revisited.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

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

[BibT_eX]

[DOI]

CoRR, 2002

A unified analysis of hot video schedulers.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Competitive Analysis of On-line Stream Merging Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

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

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

A Decomposition Theorem for Maximum Weight Bipartite Matchings.

[BibT_eX]

[DOI]

SIAM J. Comput., 2001

An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings.

[BibT_eX]

[DOI]

J. Algorithms, 2001

Concurrent threads and optimal parallel minimum spanning trees algorithm.

[BibT_eX]

[DOI]

Yijie Han

J. ACM, 2001

Approximating the Nearest Neighbor Intercharge Distance for Non-Uniform-Degree Evolutionary Trees.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2001

Optimal Edge Ranking of Trees in Linear Time.

[BibT_eX]

[DOI]

Fung Ling Yue

Algorithmica, 2001

Performance guarentee for online deadline scheduling in the presence of overload.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

On-Line Scheduling with Tight Deadlines.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

On the speed requirement for optimal deadline scheduling in overloaded systems.

[BibT_eX]

[DOI]

Tsuen-Wan Ngan

Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

An 5-competitive on-line scheduler for merging video streams.

[BibT_eX]

[DOI]

Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

Improved On-Line Stream Merging: From a Restricted to a General Setting.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

Selecting the k largest elements with parity tests.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

Construction of Online Catalog Topologies Using Decision Trees.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers.

[BibT_eX]

[DOI]

Ming-Yang Kao

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

A Faster and Unifying Algorithm for Comparing Trees.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1999

Trade-offs Between Speed and Processor in Hard-Deadline Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees.

[BibT_eX]

[DOI]

Yijie Han

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1999

Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform Degrees.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

Improving Parallel Computation with Fast Integer Sorting.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

Requirement-Based Data Cube Schema Design.

[BibT_eX]

[DOI]

Proceedings of the 1999 ACM CIKM International Conference on Information and Knowledge Management, 1999

1998

An Improved Scheme for Set Equality Testing and Updating.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Edge Ranking of Graphs Is Hard.

[BibT_eX]

[DOI]

Fung Ling Yue

Discret. Appl. Math., 1998

Approximating Biconnectivity in Parallel.

[BibT_eX]

[DOI]

Algorithmica, 1998

Default-Sensitive PreProcessings for Finding Maxima.

[BibT_eX]

Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1997

Dynamic Suffix Tree and Two-Dimensional Texts Management.

[BibT_eX]

[DOI]

Ying Choi

Inf. Process. Lett., 1997

General Techniques for Comparing Unrooted Evolutionary Trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

All-Cavity Maximum Matchings.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996

Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time.

[BibT_eX]

Wing-Kin Sung

Nord. J. Comput., 1996

Improving Biconnectivity Approximation via Local Optimization.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Towards More Precise Parallel Biconnectivity Approximation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Two-Dimensional Dynamic Dictionary Matching.

[BibT_eX]

[DOI]

Ying Choi

Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

1995

Finding Connected Components in O(log n log log n) Time on the EREW PRAM.

[BibT_eX]

[DOI]

J. Algorithms, 1995

Two-Dimensional Pattern Matching on a Dynamic Library of Texts.

[BibT_eX]

[DOI]

Ying Choi

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

Efficient Equality-Testing and Updating of Sets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

1994

On Set Equality-Testing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994

1993

An on-line algorithm for navigating in unknown environment.

[BibT_eX]

[DOI]

Kwong-fai Chan

Int. J. Comput. Geom. Appl., 1993

Finding Least-Weight Subsequences with Fewer Processors.

[BibT_eX]

[DOI]

Kwong-fai Chan

Algorithmica, 1993

1992

Trade-Offs between Communication and Space.

[BibT_eX]

[DOI]

Prasoon Tiwari

Martin Tompa

J. Comput. Syst. Sci., 1992

Results on Communication Complexity Classes.

[BibT_eX]

[DOI]

Walter L. Ruzzo

J. Comput. Syst. Sci., 1992

The Implicit Dictionary Problem Revisited.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991

An On-Line Algorithm for Navigating in Unknown Terrain.

[BibT_eX]

[DOI]

Kwong-fai Chan

Proceedings of the ISA '91 Algorithms, 1991

1989

Tradeoffs Between Communication and Space

[BibT_eX]

[DOI]

Prasoon Tiwari

Martin Tompa

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

The Power of Parallel Pointer Manipulation.

[BibT_eX]

[DOI]

Walter L. Ruzzo

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

An Optimal EREW Parallel Algorithm for Parenthesis Matching.

[BibT_eX]

Wai Wan Tsang