Authors:
Chen, T
Kao, MY
Tepel, M
Rush, J
Church, GM
Citation: T. Chen et al., A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry, J COMPUT BI, 8(3), 2001, pp. 325-337
Citation: My. Kao et J. Wang, Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees, THEOR COMP, 262(1-2), 2001, pp. 101-115
Citation: My. Kao et al., An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings, J ALGORITHM, 40(2), 2001, pp. 212-233
Citation: M. Csuros et My. Kao, Provably fast and accurate recovery of evolutionary trees through harmonicgreedy triplets, SIAM J COMP, 31(1), 2001, pp. 306-322
Citation: My. Kao et J. Wang, Linear-time approximation algorithms for computing numerical summation with provably small errors, SIAM J COMP, 29(5), 2000, pp. 1568-1576