49 citations · 74 across the 40 of their papers we have counts for
15 papers · 1 filter
Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-Assembly Systems
Ho-Lin Chen, Ming-Yang Kao
DNA tile self-assembly has emerged as a rich and promising primitive for nano-technology. This paper studies the problems of minimizing assembly time and error rate by changing the…
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
Ming-Yang Kao, Henry C. M. Leung, He Sun +1
Designing short DNA words is a problem of constructing a set (i.e., code) of n DNA strings (i.e., words) with the minimum length such that the Hamming distance between each pair of…
Randomized Fast Design of Short DNA Words
Ming-Yang Kao, Manan Sanghi, Robert Schweller
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati…
Improved Phylogeny Comparisons: Non-Shared Edges Nearest Neighbor Interchanges, and Subtree Transfers
Wing-Kai Hon, Ming-Yang Kao, Tak-Wah Lam +2
The number of the non-shared edges of two phylogenies is a basic measure of the dissimilarity between the phylogenies. The non-shared edges are also the building block for approxim…
Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications
Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu
We study an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (a_i,w_i) for i = 1,..,n and w_i>0, a segment A(i,j) is a consecuti…
Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time
Tsan-sheng Hsu, Ming-Yang Kao
A graph is componentwise biconnected if every connected component either is an isolated vertex or is biconnected. We present a linear-time algorithm for the problem of adding the s…