• 2379 Citations
1988 …2017

Research output per year

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

Research Output

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

2 Scopus citations

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

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

Aspnes, J., Hartling, J., Kao, M-Y., Kim, J. & Shah, G., Dec 1 2002, In : Journal of Computational Biology. 9, 5, p. 721-741 21 p.

Research output: Contribution to journalArticle

1 Scopus citations

Address generation for nanowire decoders

Wang, J., Kao, M-Y. & Zhou, H., Oct 1 2007, GLSVLSI'07: Proceedings of the 2007 ACM Great Lakes Symposium on VLSI. p. 525-528 4 p. 1228909. (Proceedings of the ACM Great Lakes Symposium on VLSI, GLSVLSI).

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

A decomposition theorem for maximum weight bipartite matchings

Kao, M. Y., Lam, T. W., Sung, W. K. & Ting, H. F., Jan 1 2001, In : SIAM Journal on Computing. 31, 1, p. 18-26 9 p.

Research output: Contribution to journalArticle

38 Scopus citations

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

21 Scopus citations

A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry

Chen, T., Tepel, M., Rush, J., Church, G. M. & Kao, M. Y., Aug 2001, In : Journal of Computational Biology. 8, 3, p. 325-337 13 p.

Research output: Contribution to journalArticle

188 Scopus citations

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

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

4 Scopus citations

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

He, X., Kao, M. Y. & Lu, H. I., Jan 1 2000, In : SIAM Journal on Computing. 30, 3, p. 838-846 9 p.

Research output: Contribution to journalArticle

39 Scopus citations

Algorithmic DNA Self-assembly: Second International Conference, AAIM 2006, Hong Kong, China, June 2006, Proceedings

Kao, M-Y., 2006, Algorithmic Aspects in Information and Management: Second International Conference, AAIM 2006, Hong Kong, China, June 2006, Proceedings. New York, NY: Springer-Verlag

Research output: Chapter in Book/Report/Conference proceedingChapter

Algorithmic Issues in DNA Barcoding Problems

DasGupta, B., Kao, M-Y. & Mǎndoiu, I., Dec 23 2010, Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications. John Wiley and Sons, p. 129-142 14 p.

Research output: Chapter in Book/Report/Conference proceedingChapter

Algorithmic Issues in DNA Barcoding Problems: Techniques, Approaches, and Applications

Kao, M-Y., 2011, Algorithms in Computational Molecular Biology: Techniques, Approaches, and Applications. Hoboken, NJ: Wiley-Interscience, p. 129-142

Research output: Chapter in Book/Report/Conference proceedingChapter

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

13 Scopus citations

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

13 Scopus citations

A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis

Johnsen, A., Kao, M-Y. & Seki, S., Feb 1 2017, In : Journal of Combinatorial Optimization. 33, 2, p. 496-529 34 p.

Research output: Contribution to journalArticle

2 Scopus citations

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

2 Scopus citations

An approximation algorithm for a bottleneck traveling salesman problem

Kao, M-Y. & Sanghi, M., Sep 1 2009, In : Journal of Discrete Algorithms. 7, 3, p. 315-326 12 p.

Research output: Contribution to journalArticle

9 Scopus citations

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

Kao, M. Y., Lam, T. W., Sung, W. K. & Ting, H. F., Jan 1 2001, In : Journal of Algorithms. 40, 2, p. 212-233 22 p.

Research output: Contribution to journalArticle

44 Scopus citations

An optimal parallel algorithm for planar cycle separators

Kao, M. Y., Teng, S. H. & Toyama, K., Nov 1 1995, In : Algorithmica. 14, 5, p. 398-408 11 p.

Research output: Contribution to journalArticle

5 Scopus citations

A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity

Hsu, T. S. & Kao, M. Y., Jan 1 1998, In : Journal of Combinatorial Optimization. 2, 3, p. 237-256 20 p.

Research output: Contribution to journalArticle

8 Scopus citations

Average case analysis for tree labelling schemes

Kao, M-Y., Li, X. Y. & Wang, W., Jun 9 2007, In : Theoretical Computer Science. 378, 3, p. 271-291 21 p.

Research output: Contribution to journalArticle

2 Scopus citations

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

1 Scopus citations

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

7 Scopus citations

Cavity matchings, label compressions, and unrooted evolutionary trees

Kao, M. Y., Lam, T. W., Sung, W. K. & Ting, H. F., Jan 1 2000, In : SIAM Journal on Computing. 30, 2, p. 602-624 23 p.

Research output: Contribution to journalArticle

9 Scopus citations

Closed-form mortgage pricing formula with outstanding principal as prepayment value

Tsai, Y. C., Chen, Z. H., Ho, J. M., Kao, M-Y., Lei, C. L. & Liao, S. L., Nov 27 2012, 2012 IEEE Conference on Computational Intelligence for Financial Engineering and Economics, CIFEr 2012 - Proceedings. p. 100-106 7 p. 6327778. (2012 IEEE Conference on Computational Intelligence for Financial Engineering and Economics, CIFEr 2012 - Proceedings).

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

Common-face embeddings of planar graphs

Chen, Z. Z., He, X. & Kao, M-Y., Feb 1 2003, In : SIAM Journal on Computing. 32, 2, p. 408-434 27 p.

Research output: Contribution to journalArticle

1 Scopus citations

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

57 Scopus citations

Complexities for generalized models of self-assembly

Aggarwal, G., Cheng, Q. I., Goldwasser, M. H., Kao, M-Y., De Espanes, P. M. & Schweller, R. T., Dec 1 2005, In : SIAM Journal on Computing. 34, 6, p. 1493-1515 23 p.

Research output: Contribution to journalArticle

106 Scopus citations

Complexities for Generalized Models of Self-Assembly

Aggarwal, G., Goldwasser, M. H., Kao, M-Y. & Schweller, R. T., Apr 15 2004, p. 873-882. 10 p.

Research output: Contribution to conferencePaper

33 Scopus citations

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. Hsu, W-L. & Kao, M-Y. (eds.). Springer Verlag, (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

Computing minimum tile sets to self-assemble color patterns

Johnsen, A. C., Kao, M-Y. & Seki, S., Dec 1 2013, Algorithms and Computation - 24th International Symposium, ISAAC 2013, Proceedings. p. 699-710 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8283 LNCS).

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

6 Scopus citations

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

4 Scopus citations

Data security equals graph connectivity

Kao, M. Y., Feb 1996, In : SIAM Journal on Discrete Mathematics. 9, 1, p. 87-100 14 p.

Research output: Contribution to journalArticle

36 Scopus citations

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

Designing proxies for stock market indices is computationally hard

Kao, M-Y. & Tate, S. R., 2001, In : Quantitative Finance. 1, p. 361-371

Research output: Contribution to journalArticle

Design optimization methods for genomic DNA tiling arrays

Bertone, P., Trifonov, V., Rozowsky, J. S., Schubert, F., Emanuelsson, O., Karro, J., Kao, M-Y., Snyder, M. & Gerstein, M., Feb 1 2006, In : Genome research. 16, 2, p. 271-281 11 p.

Research output: Contribution to journalArticle

41 Scopus citations

Detecting stealthy spreaders using online outdegree histograms

Gao, Y., Zhao, Y., Schweller, R., Venkataraman, S., Chen, Y., Song, D. & Kao, M-Y., Oct 1 2007, 2007 Fifteenth IEEE International Workshop on Quality of Service, IWQoS 2007. p. 145-153 9 p. 4262465. (IEEE International Workshop on Quality of Service, IWQoS).

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

12 Scopus citations

Deterministic polynomial-time algorithms for designing short DNA words

Kao, M-Y., Leung, H. C. M., Sun, H. & Zhang, Y., Jan 1 2010, Theory and Applications of Models of Computation - 7th Annual Conference, TAMC 2010, Proceedings. Springer Verlag, p. 308-319 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6108 LNCS).

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

1 Scopus citations

Deterministic polynomial-time algorithms for designing short DNA words

Kao, M-Y., Leung, H. C. M., Sun, H. & Zhang, Y., Jul 8 2013, In : Theoretical Computer Science. 494, p. 144-160 17 p.

Research output: Contribution to journalArticle

1 Scopus citations

Discovering almost any hidden motif from multiple sequences

Fu, B., Kao, M-Y. & Wang, L., Mar 1 2011, In : ACM Transactions on Algorithms. 7, 2, 26.

Research output: Contribution to journalArticle

1 Scopus citations

Discovering almost any hidden motif from multiple sequences in polynomial time with low sample complexity and high success probability

Fu, B., Kao, M-Y. & Wang, L., Jul 16 2009, Theory and Applications of Models of Computation - 6th Annual Conference, TAMC 2009, Proceedings. p. 231-240 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5532 LNCS).

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

1 Scopus citations

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

14 Scopus citations

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

18 Scopus citations

Efficient algorithms for model-based motif discovery from multiple sequences

Fu, B., Kao, M-Y. & Wang, L., Dec 1 2008, Theory and Applications of Models of Computation - 5th International Conference, TAMC 2008, Proceedings. p. 234-245 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4978 LNCS).

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

1 Scopus citations

Efficient broadcast on hypercubes with wormhole and e-cube routings

Ho, C. T. & Kao, M. Y., Jan 1 1995, In : Parallel Processing Letters. 5, 2, p. 213-222 10 p.

Research output: Contribution to journalArticle

3 Scopus citations

Efficient combinatorial algorithms for DNA sequence processing: Techniques and Applications

Kao, M-Y., 2008, Bioinformatics Algorithms: Techniques and Applications. Hoboken, NJ: Wiley-Interscience, p. 223-239

Research output: Chapter in Book/Report/Conference proceedingChapter

Efficient Combinatorial Algorithms for DNA Sequence Processing

Dasgupta, B. & Kao, M-Y., Aug 9 2007, Bioinformatics Algorithms: Techniques and Applications. John Wiley & Sons, Inc., p. 223-239 17 p.

Research output: Chapter in Book/Report/Conference proceedingChapter

Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test

Kao, M-Y. & Gusfield, D., Aug 1993, In : SIAM Journal on Discrete Mathematics. 6, p. 460-476

Research output: Contribution to journalArticle

3 Scopus citations
5 Scopus citations