Berry, V., Jiang, T., Kearney, P., Li, M., & Wareham, T. (1999). Quartet cleaning: improved algorithms and simulations
Reference author: T. Jiang
First name
T.
Last name
Jiang
DasGupta, B., He, X., Jiang, T., Li, M., & Tromp, J. (1999). On the linear-cost subtree-transfer distance between phylogenetic trees Algorithmica, 25, 176-195.
DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Wang, L., & Zhang, L. (1999). Computing distances between evolutionary trees In In Handbook in Combinatorial Optimization. Springer.
Jiang, T., Kearney, P., & Li, M. (1999). Some open questions in computational molecular biology Journal of Algorithms, 34:1(2000), 194-201; And SIGACT News, 30:3, 43-49.
Kearney, P., Li, M., Tsang, J., & Jiang, T. (1999). Recovering branches on the tree of life: an approximation algorithm
DasGupta, B., Jiang, T., Kannan, S., Li, M., & Sweedyk, Z. (1998). On the complexity and approximation of syntenic distance On the Complexity and Approximation of Syntenic Distance.
Jiang, T., Kearney, P., & Li, M. (1998). Orchestrating quartets: approximation and data correction
DasGupta, B., Jiang, T., Kannan, S., Li, M., & Sweedyk, Z. (1997). On the complexity and approximation of syntenic distance
DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., & Zhang, L. (1997). On distances between phylogenetic trees
Jiang, T., & Li, M. (1997). Shortest common superstring Shortest common superstring.
- Previous page
- Currently on page 3 3
- Next page