If you made any changes in Pure, your changes will be visible here soon.

Research Output 1988 2017

Filter
Conference contribution
1988
12 Citations (Scopus)

All graphs have cycle separators and planar directed depth-first search is in DNC

Kao, M. Y., Jan 1 1988, VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings. Reif, J. H. (ed.). Springer Verlag, p. 53-63 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 319 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Depth-first Search
Separator
Separators
Directed graphs
Cycle
1989
7 Citations (Scopus)

Local reorientation, global order, and planar topology

Kao, M. Y. & Shannon, G. E., Dec 1 1989, Proc Twenty First Annu ACM Symp Theory Comput. Publ by ACM, p. 286-296 11 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Topology
Data storage equipment
18 Citations (Scopus)

Parallel depth-first search in general directed graphs

Aggarwal, A., Anderson, R. J. & Kao, M. Y., Dec 1 1989, Proc Twenty First Annu ACM Symp Theory Comput. Publ by ACM, p. 297-308 12 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Directed graphs
Separators
1990
11 Citations (Scopus)

Towards overcoming the transitive-closure bottleneck. Efficient parallel algorithms for planar digraphs

Kao, M. Y. & Klein, P. N., Jan 1 1990, Proc 22nd Annu ACM Symp Theory Comput. Publ by ACM, p. 181-192 12 p. (Proc 22nd Annu ACM Symp Theory Comput).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Parallel algorithms
Decomposition
1992
4 Citations (Scopus)

O(n log log n)-work parallel algorithms for straight-line grid embeddings of planar graphs

Fuerer, M., He, X., Kao, M. Y. & Raghavachari, B., Dec 1 1992, 4th Annual ACM Symposium on Parallel Algorithms and Architectures. Publ by ACM, p. 410-419 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Parallel algorithms
Joining
Data storage equipment
1993

Improved parallel depth-first search in undirected planar graphs

Kao, M. Y., Teng, S. H. & Toyama, K., Jan 1 1993, Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings. Dehne, F., Sack, J-R., Santoro, N. & Whitesides, S. (eds.). Springer Verlag, p. 409-420 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 709 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Depth-first Search
Undirected Graph
Planar graph
Separator
Search Trees
33 Citations (Scopus)

Optimal online scheduling of parallel jobs with dependencies

Feldmann, A., Kao, M. Y., Sgall, J. & Teng, S. H., Jun 1 1993, Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993. Association for Computing Machinery, p. 642-651 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129585).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Scheduling
Scheduling algorithms
Communication
3 Citations (Scopus)

Parallel construction of canonical ordering and convex drawing of triconnected planar graphs

He, X. & Kao, M. Y., Jan 1 1993, Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings. Chin, F. Y. L., Raghavan, P., Balasubramanian, N. V. & Ng, K. W. (eds.). Springer Verlag, p. 303-312 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 762 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Planar graph
Drawing
40 Citations (Scopus)

Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem

Kao, M. Y., Reif, J. H. & Tate, S. R., Jan 1 1993, Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Publ by ACM, p. 441-447 7 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cost functions
Computer science
Costs
Robotics
1994
4 Citations (Scopus)

Data compression techniques for stock market prediction

Azhar, S., Badros, G. J., Glodjo, A., Kao, M. Y. & Reif, J. H., Jan 1 1994, Proceedings of the Data Compression Conference. Storer, J. A. & Cohn, M. (eds.). Publ by IEEE, p. 72-82 11 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Data compression
Correlation theory
Finance
Taxation
Costs
11 Citations (Scopus)

Optimal constructions of hybrid algorithms

Kao, M. Y., Ma, Y., Sipser, M. & Yin, Y., Jan 1 1994, Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. Publ by ACM, p. 372-381 10 p. (Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hybrid Algorithm
Randomized Algorithms
Competitive Ratio
Deterministic Algorithm
Resolve
2 Citations (Scopus)

Simple and efficient graph compression schemes for dense and complement graphs

Kao, M. Y. & Teng, S. H., Jan 1 1994, Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings. Du, D-Z., Du, D-Z. & Zhang, X-S. (eds.). Springer Verlag, p. 451-459 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 834 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Compression
Complement
Graph in graph theory
Adjacency
Optimal Algorithm

Total protection of analytic invariant information in cross tabulated tables

Kao, M. Y., Jan 1 1994, STACS 1994 - 11th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Mayr, E. W., Wagner, K. W. & Enjalbert, P. (eds.). Springer Verlag, p. 723-734 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 775 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tables
Invariant
Cell
Table
Testing
1995
2 Citations (Scopus)

Minimal linear invariants

Kao, M. Y., Jan 1 1995, Algorithms, Concurrency and Knowledge - 1995 Asian Computing Science Conference, ACSC 1995, Proceedings. Levy, J-J. & Kanchanasut, K. (eds.). Springer Verlag, p. 23-33 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1023).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Invariant
Table
Correspondence
Cell
Linear-time Algorithm
11 Citations (Scopus)

Online perfect matching and mobile computing

Grove, E. F., Kao, M. Y., Krishnan, P. & Vitter, J. S., Jan 1 1995, Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings. Akl, S. G., Dehne, F., Sack, J-R. & Santoro, N. (eds.). Springer Verlag, p. 194-205 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 955).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mobile computing
Mobile Computing
Perfect Matching
Customers
Switches
4 Citations (Scopus)

Regular edge labelings and drawings of planar graphs

He, X. & Kao, M. Y., Jan 1 1995, Graph Drawing - DIMACS International Workshop, GD 1994, Proceedings. Springer Verlag, p. 96-103 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 894).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Edge Labeling
Planar graph
Labeling
Labels
Graph Drawing
1996
6 Citations (Scopus)

Optimal augmentation for bipartite componentwise biconnectivity in linear time

Hsu, T. S. & Kao, M. Y., Jan 1 1996, Algorithms and Computation - 7th International Symposium, ISAAC 1996, Proceedings. Nagamochi, H., Miyano, S., Asano, T., Igarashi, Y. & Suri, S. (eds.). Springer Verlag, p. 213-222 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1178).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Augmentation
Linear Time
Linear-time Algorithm
Connected Components
Bipartite Graph
1997
13 Citations (Scopus)

All-cavity maximum matchings

Kao, M. Y., Lam, T. W., Sung, W. K. & Ting, H. F., Jan 1 1997, Algorithms and Computation - 8th International Symposium, ISAAC 1997, Proceedings. Leong, H. W., Jain, S. & Imai, H. (eds.). Springer Verlag, p. 364-373 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1350).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Maximum Matching
Cavity
Count
Vertex of a graph
Denote
1 Citation (Scopus)

On-line difference maximization

Kao, M. Y. & Tate, S. R., Jan 1 1997, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Anon (ed.). ACM, p. 175-182 8 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Stochastic Games
Optimal Algorithm
Maximise
Distinct
Arbitrary

Optimal bidding algorithms against cheating in multiple-object auctions

Kao, M. Y., Qi, J. & Tan, L., Jan 1 1997, Computing and Combinatorics - 3rd Annual International Conference COCOON 1997, Proceedings. Springer Verlag, p. 192-201 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1276).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bidding
Auctions
Closed-form Solution
Object
Multivariate Distribution
6 Citations (Scopus)

Security problems for statistical databases with general cell suppressions

Hsu, T. S. & Kao, M. Y., Jan 1 1997, Scientific and Statistical Database Management - Proceedings of the International Working Conference. IEEE, p. 155-164 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Security of data
Cell
Table
Data Security
Invariant

Tree contractions and evolutionary trees

Kao, M. Y., Jan 1 1997, Algorithms and Complexity - 3rd Italian Conference, CIAC 1997, Proceedings. Bongiovanni, G., Bovet, D. P. & Di Battista, G. (eds.). Springer Verlag, p. 299-310 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1203).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Evolutionary Tree
Contraction
Leaves
Rooted Trees
Maximum Degree
1998
56 Citations (Scopus)

Compact encodings of planar graphs via canonical orderings and multiple parentheses

Chuang, R. C. N., Garg, A., He, X., Kao, M. Y. & Lu, H. I., Dec 1 1998, Automata, Languages and Programming - 25th International Colloquium, ICALP 1998, Proceedings. p. 118-129 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1443 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Planar graph
Decoding
Encoding
Coding
Adjacency

Computing and combinatorics: 4th annual international conference COCOON’98 Taipei, Taiwan, R.o.C., august 12-14, 1998 proceedings

Hsu, W. L. & Kao, M. Y., Jan 1 1998, Computing and Combinatorics - 4th Annual International Conference COCOON 1998, Proceedings. Springer Verlag, Vol. 1449. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1449).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Taiwan
Combinatorics
Annual
Computing
1 Citation (Scopus)

Efficient minimization of numerical summation errors

Kao, M. Y. & Wang, J., Dec 1 1998, Automata, Languages and Programming - 25th International Colloquium, ICALP 1998, Proceedings. p. 375-386 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1443 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Worst Case Error
Summation
Approximation Algorithms
Floating point
Approximation algorithms
1999
21 Citations (Scopus)

A decomposition theorem for maximum weight bipartite matchings with applications to evolutionary trees

Kao, M. Y., Lam, T. W., Sung, W. K. & Ting, H. F., Jan 1 1999, Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings. Nešetřil, J. (ed.). Springer Verlag, p. 438-449 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1643).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bipartite Matching
Evolutionary Tree
Decomposition Theorem
Decomposition
Computing
4 Citations (Scopus)

A fast general methodology for information — theoretically optimal encodings of graphs

He, X., Kao, M. Y. & Lu, H. I., Jan 1 1999, Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings. Nešetřil, J. (ed.). Springer Verlag, p. 540-549 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1643).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Encoding
Methodology
Graph in graph theory
Separators
Planar graph
7 Citations (Scopus)

Balanced randomized tree splitting with applications to evolutionary tree constructions

Kao, M. Y., Lingas, A. & Östlin, A., Jan 1 1999, STACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Springer Verlag, p. 184-196 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1563).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Evolutionary Tree
Binary trees
Approximation algorithms
Experiments
Distance Matrix

Designing proxies for stock market indices is computationally hard

Kao, M. Y. & Tate, S. R., Jan 1 1999, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Anon (ed.). SIAM

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Stock Market
Computational complexity
Financial markets
Computational Complexity
NP-complete problem
13 Citations (Scopus)

Nonplanar topological inference and political-map graphs

Chen, Z. Z., He, X. & Kao, M. Y., Jan 1 1999, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Anon (ed.). SIAM, p. 195-204 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Printed circuit boards
Polynomials
Graph in graph theory
Mixed Graphs
Inclusion Relations
1 Citation (Scopus)

On the informational asymmetry between upper and lower bounds for ultrametric evolutionary trees

Chen, T. & Kao, M. Y., Jan 1 1999, Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings. Nešetřil, J. (ed.). Springer Verlag, p. 248-256 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1643).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Evolutionary Tree
Asymmetry
Upper and Lower Bounds
Testing
Pairwise
13 Citations (Scopus)

Recovering evolutionary trees through harmonic greedy triplets

Csuros, M. & Kao, M. Y., Jan 1 1999, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Anon (ed.). SIAM, p. 261-270 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Evolutionary Tree
Harmonic
Trees (mathematics)
Topology
Polynomials
2000

A faster and unifying algorithm for comparing trees

Kao, M. Y., Lam, T. W., Sung, W. K. & Ting, H. F., Jan 1 2000, Combinatorial Pattern Matching - 11th Annual Symposium, CPM 2000, Proceedings. Sankoff, D. & Giancarlo, R. (eds.). Springer Verlag, p. 129-142 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1848).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Labeled Trees
Leaves
Evolutionary Tree
Distinct
Similarity Measure
18 Citations (Scopus)

Dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry

Chen, T., Kao, M. Y., Tepel, M., Rush, J. & Church, G. M., Jan 1 2000, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, p. 389-398 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mass Spectrometry
Dynamic programming
Peptides
Sequencing
Mass spectrometry
1 Citation (Scopus)

Improved phylogeny comparisons: Non-shared edges, nearest neighbor interchanges, and subtree transfers

Hon, W. K., Kao, M. Y. & Lam, T. W., Jan 1 2000, Algorithms and Computation - 11th International Conference, ISAAC 2000, Proceedings. Teng, S-H., Lee, D. T. & Teng, S-H. (eds.). Springer Verlag, p. 527-538 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1969).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Phylogeny
Interchanges
Nearest Neighbor
Approximation algorithms
Approximation Algorithms

Optimal bid sequences for multiple-object auctions with unequal budgets

Chen, Y., Kao, M. Y. & Lu, H. I., Jan 1 2000, Algorithms and Computation - 11th International Conference, ISAAC 2000, Proceedings. Lee, D. T., Teng, S-H. & Teng, S-H. (eds.). Springer Verlag, p. 84-95 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1969).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Auctions
Unequal
Bidding
Object
Genes
6 Citations (Scopus)

The enhanced double digest problem for dna physical mapping

Kao, M. Y., Samet, J. & Sung, W. K., Jan 1 2000, Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings. Springer Verlag, p. 383-392 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1851).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

DNA sequences
NP-complete problem
DNA Sequence
Linear Time
Restriction

Unbalanced and hierarchical bipartite matchings with applications to labeled tree comparison

Kao, M. Y., Lam, T. W., Sung, W. K. & Ting, H. F., Jan 1 2000, Algorithms and Computation - 11th International Conference, ISAAC 2000, Proceedings. Lee, D. T., Teng, S-H. & Teng, S-H. (eds.). Springer Verlag, p. 479-490 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1969).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bipartite Matching
Labeled Trees
Matching Problem
Matching Algorithm
Evolutionary Tree
2001

A combinatorial toolbox for protein sequence design and landscape analysis in the grand canonical model

Aspnes, J., Hartling, J., Ming-Yang, K., Kim, J. & Shah, G., Dec 1 2001, Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings. p. 403-415 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2223 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Canonical Model
Protein Sequence
Proteins
Network Flow
Protein
14 Citations (Scopus)

DNA self-assembly for constructing 3D boxes (Extended Abstract)

Kao, M-Y. & Ramachandran, V., Dec 1 2001, Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings. p. 429-441 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2223 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Self-assembly
Self assembly
DNA
Tile
Nanostructures
6 Citations (Scopus)

Fast pricing of European Asian options with provable accuracy: Single-stock and basket options?

Akcoglu, K., Kao, M. Y. & Raghavan, S. V., Jan 1 2001, Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings. Springer Verlag, p. 404-415 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2161).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Asian Options
European Options
Pricing
Polynomials
Costs
3 Citations (Scopus)

Predicting RNA secondary structures with arbitrary pseudoknots by maximizing the number of stacking pairs

Ieong, S., Kao, M-Y., Lam, T. W., Sung, W. K. & Yiu, S. M., Jan 1 2001, Proceedings - 2nd Annual IEEE International Symposium on Bioinformatics and Bioengineering, BIBE 2001. Institute of Electrical and Electronics Engineers Inc., p. 183-190 8 p. 974428. (Proceedings - 2nd Annual IEEE International Symposium on Bioinformatics and Bioengineering, BIBE 2001).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Approximation algorithms
RNA
Polynomials
3 Citations (Scopus)

Towards understanding the predictability of stock markets from the perspective of computational complexity

Aspnes, J., Fischer, D. F., Fischer, M. J., Kao, M. Y. & Kumar, A., Dec 1 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 745-754 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Predictability
Stock Market
Computational complexity
Computational Complexity
Polynomials
2002
15 Citations (Scopus)

Fast algorithms for finding maximum-density segments of a sequence with applications to bioinformatics

Goldwasser, M. H., Kao, M-Y. & Lu, H. I., Jan 1 2002, Algorithms in Bioinformatics - 2nd International Workshop,WABI 2002, Proceedings. Guigo, R. & Gusfield, D. (eds.). Springer Verlag, p. 157-171 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2452).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bioinformatics
Fast Algorithm
Sequence Analysis
Subsequence
Consecutive
3 Citations (Scopus)

Fast optimal genome tiling with applications to microarray design and homology search

Berman, P., Bertone, P., DasGupta, B., Gerstein, M., Kao, M-Y. & Snyder, M., Jan 1 2002, Algorithms in Bioinformatics - 2nd International Workshop,WABI 2002, Proceedings. Guigo, R. & Gusfield, D. (eds.). Springer Verlag, p. 419-433 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2452).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Microarrays
Tile
Tiling
Microarray
Homology
3 Citations (Scopus)

Fast universalization of investment strategies with provably good relative returns

Akcoglu, K., Drineas, P. & Kao, M-Y., Dec 1 2002, Automata, Languages and Programming - 29th International Colloquium, ICALP 2002, Proceedings. p. 888-900 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2380 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Trading Strategies
Universal Cover
Log-concave
Concave function
Exponential time
2005
1 Citation (Scopus)

Average case analysis for tree labelling schemes

Kao, M-Y., Li, X. Y. & Wang, W., Dec 1 2005, Algorithms and Computation - 16th International Symposium, ISAAC 2005, Proceedings. p. 136-145 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3827 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Average-case Analysis
Labeling Scheme
Labeling
Labels
Separator
2006
2 Citations (Scopus)

A 6-Approximation algorithm for computing smallest common AoN-supertree with application to the reconstruction of glycan trees

Aoki-Kinoshita, K. F., Kanehisa, M., Kao, M-Y., Li, X. Y. & Wang, W., Dec 1 2006, Algorithms and Computation - 17th International Symposium, ISAAC 2006, Proceedings. p. 100-110 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4288 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Approximation algorithms
Rooted Trees
Labels
Approximation Algorithms
Labeled Trees
2 Citations (Scopus)

An approximation algorithm for a bottleneck traveling salesman problem

Kao, M-Y. & Sanghi, M., Jan 1 2006, Algorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings. Springer Verlag, p. 223-235 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3998 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Traveling salesman problem
Approximation algorithms
Travelling salesman problems
Approximation Algorithms
Polynomials
3 Citations (Scopus)

Flexible word design and graph labeling

Kao, M-Y., Sanghi, M. & Schweller, R., Dec 1 2006, Algorithms and Computation - 17th International Symposium, ISAAC 2006, Proceedings. p. 48-60 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4288 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Graph Labeling
Labeling
Hamming distance
Graph in graph theory
Vertex of a graph