activity
19992014
most citedLinear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications

49 citations · 74 across the 40 of their papers we have counts for

collaborators
Showing 2001 · cs.CEShow all

9 papers · 2 filters

cs.CE2001

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

Samuel Ieong, Ming-Yang Kao, Tak-Wah Lam +2

The paper investigates the computational problem of predicting RNA secondary structures. The general belief is that allowing pseudoknots makes the problem hard. Existing polynomial…

cs.CE2001

The Risk Profile Problem for Stock Portfolio Optimization

Ming-Yang Kao, Andreas Nolte, Stephen R. Tate

This work initiates research into the problem of determining an optimal investment strategy for investors with different attitudes towards the trade-offs of risk and profit. The pr…

cs.CE2001

The Enhanced Double Digest Problem for DNA Physical Mapping

Ming-Yang Kao, Jared Samet, Wing-Kin Sung

The double digest problem is a common NP-hard approach to constructing physical maps of DNA sequences. This paper presents a new approach called the enhanced double digest problem.…

cs.CE2001

Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets

Yuyu Chen, Ming-Yang Kao, Hsueh-I Lu

In a multiple-object auction, every bidder tries to win as many objects as possible with a bidding algorithm. This paper studies position-randomized auctions, which form a special…

cs.CE2001

Fast Pricing of European Asian Options with Provable Accuracy: Single-stock and Basket Options

Karhan Akcoglu, Ming-Yang Kao, Shuba Raghavan

This paper develops three polynomial-time pricing techniques for European Asian options with provably small errors, where the stock prices follow binomial trees or trees of higher-…

cs.CE2001

Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees

Ming-Yang Kao, Tak-Wah Lam, Wing-Kin Sung +1

We present an algorithm for computing a maximum agreement subtree of two unrooted evolutionary trees. It takes O(n^{1.5} log n) time for trees with unbounded degrees, matching the…

cs.CE2001

Tree Contractions and Evolutionary Trees

Ming-Yang Kao

An evolutionary tree is a rooted tree where each internal vertex has at least two children and where the leaves are labeled with distinct symbols representing species. Evolutionary…

cs.CE2001

A Dynamic Programming Approach to De Novo Peptide Sequencing via Tandem Mass Spectrometry

Ting Chen, Ming-Yang Kao, Matthew Tepel +2

The tandem mass spectrometry fragments a large number of molecules of the same peptide sequence into charged prefix and suffix subsequences, and then measures mass/charge ratios of…

cs.CE2001

Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model

James Aspnes, Julia Hartling, Ming-Yang Kao +2

In modern biology, one of the most important research problems is to understand how protein sequences fold into their native 3D structures. To investigate this problem at a high le…