Jiang, T., & Li, M. (1991). On the complexity of learning strings and sequences
Reference author: T. Jiang
First name
T.
Last name
Jiang
Jiang, T., & Li, M. (1993). On the complexity of learning strings and sequences Theoretical Computer Science, 119, 363-371.
DasGupta, B., Jiang, T., Kannan, S., Li, M., & Sweedyk, Z. (1997). On the complexity and approximation of syntenic distance
DasGupta, B., Jiang, T., Kannan, S., Li, M., & Sweedyk, Z. (1998). On the complexity and approximation of syntenic distance Discrete Applied Mathematics (special Issue in Computational Biology), 88:1-3,59-82.
Blum, A., Jiang, T., Li, M., Tromp, J., & Yannakakis, M. (1994). Linear approximation of shortest superstrings Journal of the ACM, 41:4, 630-647.
Jiang, T., Lin, G., Ma, B., & Zhang, K. (2002). A General Edit Distance between Two RNA Structures Journal of Computational Biology 9(2): 371-388.
Li, M., Jiang, T., Xu, Y., & Zhang, M. (2002). Compressing DNA sequences In Chapter 7 in Current Topics in Computational Molecular Biology. The MIT Press.
Jiang, T., & Li, M. (1994). On the approximation of shortest common supersequences and longest common subsequences
Jiang, T., & Li, M. (1995). On the approximation of shortest common supersequences and longest common subsequences SIAM J. Comput., 24:5, 1122-1139.
Jiang, T., & Li, M. (1993). Approximating shortest superstrings with constraints