Ming-Yang Kao - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Discovering almost any hidden motif from multiple sequencesBin Fu, Ming-Yang Kao, Lusheng Wang. talg, 7(2):26, 2011. [doi]

2010

2009

On approximating four covering and packing problemsMary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ming-Yang Kao. jcss, 75(5):287-302, 2009. [doi]

Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating LoopsMee Yee Chan, Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao. siamcomp, 38(6):2179-2197, 2009. [doi]

Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success ProbabilityBin Fu, Ming-Yang Kao, Lusheng Wang. tamc 2009: 231-240 [doi]

Probabilistic Analysis of a Motif Discovery Algorithm for Multiple SequencesBin Fu, Ming-Yang Kao, Lusheng Wang. siamdm, 23(4):1715-1737, 2009. [doi]

Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)Pei-Chi Huang, Hsin-Wen Wei, Yen-Chiu Chen, Ming-Yang Kao, Wei Kuan Shih, Tsan-sheng Hsu. isaac 2009: 1195-1204 [doi]

An approximation algorithm for a bottleneck traveling salesman problemMing-Yang Kao, Manan Sanghi. jda, 7(3):315-326, 2009. [doi]

Randomized fast design of short DNA wordsMing-Yang Kao, Manan Sanghi, Robert T. Schweller. talg, 5(4), 2009. [doi]

The Closest Pair Problem under the Hamming MetricKerui Min, Ming-Yang Kao, Hong Zhu. cocoon 2009: 205-214 [doi]

2008

Efficient Algorithms for Model-Based Motif Discovery from Multiple SequencesBin Fu, Ming-Yang Kao, Lusheng Wang. tamc 2008: 234-245 [doi]

Randomized Self-assembly for Approximate ShapesMing-Yang Kao, Robert T. Schweller. icalp 2008: 370-384 [doi]

Reconstructing phylogenies from noisy quartets in polynomial time with a high success probabilityGang Wu, Ming-Yang Kao, Guohui Lin, Jia-Huai You. almob, 3, 2008. [doi]

2007

On constructing an optimal consensus clustering from multiple clusteringsPiotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie Wang. ipl, 104(4):137-145, 2007. [doi]

Using Nash Implementation to Achieve Better Frugality RatiosChien-Chung Huang, Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang. isaac 2007: 377-389 [doi]

Algorithmic Aspects in Information and Management, Third International Conference, AAIM 2007, Portland, OR, USA, June 6-8, 2007, ProceedingsMing-Yang Kao, Xiang-Yang Li, editors, Volume 4508 of Lecture Notes in Computer Science, Springer, 2007.

Average case analysis for tree labelling schemesMing-Yang Kao, Xiang-Yang Li, Weizhao Wang. TCS, 378(3):271-291, 2007. [doi]

Reversible sketches: enabling monitoring and analysis over high-speed data streamsRobert T. Schweller, Zhichun Li, Yan Chen, Yan Gao, Ashish Gupta, Yin Zhang, Peter A. Dinda, Ming-Yang Kao, Gokhan Memik. ton, 15(5):1059-1072, 2007. [doi]

Address generation for nanowire decodersJia Wang, Ming-Yang Kao, Hai Zhou. glvlsi 2007: 525-528 [doi]

2006

A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan TreesKiyoko F. Aoki-Kinoshita, Minoru Kanehisa, Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang. isaac 2006: 100-110 [doi]

Linear-Time Haplotype Inference on Pedigrees Without RecombinationsBethany Man-Yee Chan, Joseph Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao. wabi 2006: 56-67 [doi]

An Approximation Algorithm for a Bottleneck Traveling Salesman ProblemMing-Yang Kao, Manan Sanghi. ciac 2006: 223-235 [doi]

Algorithmic DNA Self-assemblyMing-Yang Kao. AAIM 2006: 10 [doi]

Reducing tile complexity for self-assembly through temperature programmingMing-Yang Kao, Robert T. Schweller. soda 2006: 571-580 [doi]

Flexible Word Design and Graph LabelingMing-Yang Kao, Manan Sanghi, Robert T. Schweller. isaac 2006: 48-60 [doi]

Hamsa: Fast Signature Generation for Zero-day PolymorphicWorms with Provable Attack ResilienceZhichun Li, Manan Sanghi, Yan Chen, Ming-Yang Kao, Brian Chavez. sp 2006: 32-47 [doi]

Reverse Hashing for High-Speed Network Monitoring: Algorithms, Evaluation, and ApplicationsRobert T. Schweller, Zhichun Li, Yan Chen, Yan Gao, Ashish Gupta, Yin Zhang, Peter A. Dinda, Ming-Yang Kao, Gokhan Memik. infocom 2006: [doi]

2005

Complexities for Generalized Models of Self-AssemblyGagan Aggarwal, Qi Cheng, Michael H. Goldwasser, Ming-Yang Kao, Pablo Moisset de Espanés, Robert T. Schweller. siamcomp, 34(6):1493-1515, 2005. [doi]

Tight approximability results for test set problems in bioinformaticsPiotr Berman, Bhaskar DasGupta, Ming-Yang Kao. jcss, 71(2):145-162, 2005. [doi]

Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applicationsMichael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu. jcss, 70(2):128-144, 2005. [doi]

Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear TimeTsan-sheng Hsu, Ming-Yang Kao. siamdm, 19(2):345-362, 2005. [doi]

Towards truthful mechanisms for binary demand games: a general frameworkMing-Yang Kao, Xiang-Yang Li, Weizhao Wang. sigecom 2005: 213-222 [doi]

Randomized Fast Design of Short DNA WordsMing-Yang Kao, Manan Sanghi, Robert T. Schweller. icalp 2005: 1275-1286 [doi]

Average Case Analysis for Tree Labelling SchemesMing-Yang Kao, Xiang-Yang Li, Weizhao Wang. isaac 2005: 136-145 [doi]

2004

Complexities for generalized models of self-assemblyGagan Aggarwal, Michael H. Goldwasser, Ming-Yang Kao, Robert T. Schweller. soda 2004: 880-889 [doi]

Fast Universalization of Investment StrategiesKarhan Akcoglu, Petros Drineas, Ming-Yang Kao. siamcomp, 34(1):1-22, 2004. [doi]

Tight Approximability Results for Test Set Problems in BioinformaticsPiotr Berman, Bhaskar DasGupta, Ming-Yang Kao. swat 2004: 39-50 [doi]

Fast Optimal Genome Tiling with Applications to Microarray Design and Homology SearchPiotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder. jcb, 11(4):766-785, 2004. [doi]

Subtree Transfer Distance For Degree-D PhylogeniesWing-Kai Hon, Tak Wah Lam, Siu-Ming Yiu, Ming-Yang Kao, Wing-Kin Sung. ijfcs, 15(6):893-909, 2004. [doi]

Non-shared edges and nearest neighbor interchanges revisitedWing-Kai Hon, Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Siu-Ming Yiu. ipl, 91(3):129-134, 2004. [doi]

2003

2002

2001

Fast Pricing of European Asian Options with Provable Accuracy: Single-Stock and Basket OptionsKarhan Akcoglu, Ming-Yang Kao, Shuba V. Raghavan. esa 2001: 404-415 [doi]

Towards understanding the predictability of stock markets from the perspective of computational complexityJames Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar. soda 2001: 745-754 [doi]

A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical ModelJames Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah. isaac 2001: 403-415 [doi]

Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily ReturnsGen-Huey Chen, Ming-Yang Kao, Yuh-Dauh Lyuu, Hsing-Kuo Wong. siamcomp, 31(2):447-459, 2001. [doi]

A Dynamic Programming Approach to De Novo Peptide Sequencing via Tandem Mass SpectrometryTing Chen, Ming-Yang Kao, Matthew Tepel, John Rush, George M. Church. jcb, 8(3):325-337, 2001.

Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy TripletsMiklós Csürös, Ming-Yang Kao. siamcomp, 31(1):306-322, 2001. [doi]

Selected papers from COCOON 1998 - ForewordWen-Lian Hsu, Ming-Yang Kao. TCS, 261(2):211, 2001. [doi]

Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking PairsSamuel Ieong, Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Siu-Ming Yiu. bibe 2001: 183-190

Content-based Music Retrieval Using Linear Scaling and Branch-and-bound Tree SearchJyh-Shing Roger Jang, Hong-Ru Lee, Ming-Yang Kao. icmcs 2001: [doi]

DNA Self-Assembly For Constructing 3D BoxesMing-Yang Kao, Vijay Ramachandran. isaac 2001: 429-440 [doi]

An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite MatchingsMing-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting. jal, 40(2):212-233, 2001.

Minimizing roundoff errors of prefix sums via dynamic construction of Huffman treesMing-Yang Kao, Jie Wang. TCS, 262(1):101-115, 2001. [doi]

A Decomposition Theorem for Maximum Weight Bipartite MatchingsMing-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting. siamcomp, 31(1):18-26, 2001. [doi]

2000

Optimal Bid Sequences for Multiple-Object Auctions with Unequal BudgetsYuyu Chen, Ming-Yang Kao, Hsueh-I Lu. isaac 2000: 84-95 [doi]

Reducing Randomness via Irrational NumbersZhi-Zhong Chen, Ming-Yang Kao. siamcomp, 29(4):1247-1256, 2000.

A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometryTing Chen, Ming-Yang Kao, Matthew Tepel, John Rush, George M. Church. soda 2000: 389-398 [doi]

A Fast General Methodology for Information-Theoretically Optimal Encodings of GraphsXin He, Ming-Yang Kao, Hsueh-I Lu. siamcomp, 30(3):838-846, 2000. [doi]

Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree TransfersWing-Kai Hon, Ming-Yang Kao, Tak Wah Lam. isaac 2000: 527-538 [doi]

Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree ComparisonMing-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting. isaac 2000: 479-490 [doi]

A Faster and Unifying Algorithm for Comparing TreesMing-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting. cpm 2000: 129-142 [doi]

Cavity Matchings, Label Compressions, and Unrooted Evolutionary TreesMing-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting. siamcomp, 30(2):602-624, 2000.

The Enhanced Double Digest Problem for DNA Physical MappingMing-Yang Kao, Jared Samet, Wing-Kin Sung. swat 2000: 383-392 [doi]

Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small ErrorsMing-Yang Kao, Jie Wang. siamcomp, 29(5):1568-1576, 2000.

The risk profile problem for stock portfolio optimization (extended abstract)Ming-Yang Kao, Andreas Nolte, Stephen R. Tate. stoc 2000: 228-234 [doi]

1999

Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily ReturnsGen-Huey Chen, Ming-Yang Kao, Yuh-Dauh Lyuu, Hsing-Kuo Wong. stoc 1999: 119-128 [doi]

On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary TreesTing Chen, Ming-Yang Kao. esa 1999: 248-256 [doi]

Nonplanar Topological Inference and Political-Map GraphsZhi-Zhong Chen, Xin He, Ming-Yang Kao. soda 1999: 195-204 [doi]

Recovering Evolutionary Trees Through Harmonic Greedy TripletsMiklós Csürös, Ming-Yang Kao. soda 1999: 261-270 [doi]

Guest Editors ForewordDan Gusfield, Ming-Yang Kao. algorithmica, 25(2-3):141, 1999. [doi]

A Fast General Methodology for Information - Theoretically Optimal Encodings of GraphsXin He, Ming-Yang Kao, Hsueh-I Lu. esa 1999: 540-549 [doi]

Linear-Time Succinct Encodings of Planar Graphs via Canonical OrderingsXin He, Ming-Yang Kao, Hsueh-I Lu. siamdm, 12(3):317-325, 1999. [doi]

Guest Editors ForewordMing-Yang Kao, A. S. Kyle, P. Lakner. algorithmica, 25(1):1, 1999. [doi]

Optimal Bidding Algorithms Against Cheating in Multiple-Object AuctionsMing-Yang Kao, Junfeng Qi, Lei Tan. siamcomp, 28(3):955-969, 1999.

Balanced Randomized Tree Splitting with Applications to Evolutionary Tree ConstructionsMing-Yang Kao, Andrzej Lingas, Anna Östlin. STACS 1999: 184-196 [doi]

On-Line Difference MaximizationMing-Yang Kao, Stephen R. Tate. siamdm, 12(1):78-90, 1999. [doi]

Designing Proxies for Stock Market Indices is Computationally HardMing-Yang Kao, Stephen R. Tate. soda 1999: 933-934 [doi]

A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary TreesMing-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting. esa 1999: 438-449 [doi]

1998

Compact Encodings of Planar Graphs via Canonical Orderings and Multiple ParenthesesRichie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-I Lu. icalp 1998: 118-129 [doi]

Optimal On-Line Scheduling of Parallel Jobs with DependenciesAnja Feldmann, Ming-Yang Kao, Jiri Sgall, Shang-Hua Teng. jco, 1(4):393-411, 1998.

Efficient Submesh Permutations in Wormhole-routed meshesChing-Tien Ho, Ming-Yang Kao. isci, 107(1-4):1-13, 1998.

Computing and Combinatorics, 4th Annual International Conference, COCOON 98, Taipei, Taiwan, R.o.C., August 12-14, 1998, ProceedingsWen-Lian Hsu, Ming-Yang Kao, editors, Volume 1449 of Lecture Notes in Computer Science, Springer, 1998.

A Unifying Augmentation Algorithm for Two-Edge Connectivity and BiconnectivityTsan-sheng Hsu, Ming-Yang Kao. jco, 2(3):237-256, 1998.

Tree Contractions and Evolutionary TreesMing-Yang Kao. siamcomp, 27(6):1592-1616, 1998. [doi]

Optimal Constructions of Hybrid AlgorithmsMing-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin. jal, 29(1):142-164, 1998.

Default-Sensitive PreProcessings for Finding MaximaMing-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting. cats 1998: 107-120

Efficient Minimization of Numerical Summation ErrorsMing-Yang Kao, Jie Wang. icalp 1998: 375-386 [doi]

Simple and Efficient Graph Compression Schemes for Dense and Complement GraphsMing-Yang Kao, Neill Occhiogrosso, Shang-Hua Teng. jco, 2(4):351-359, 1998.

1997

All-Cavity Maximum MatchingsMing-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting. isaac 1997: 364-373

Total Protection of Analytic-Invariant Information in Cross-Tabulated TablesMing-Yang Kao. siamcomp, 26(1):231-242, 1997.

Optimal Bidding Algorithms Against Cheating in Multiple-Object AuctionsMing-Yang Kao, Junfeng Qi, Lei Tan. cocoon 1997: 192-201

On-Line Difference MaximizationMing-Yang Kao, Stephen R. Tate. soda 1997: 175-182

PreviousNext