Chen, X., Kwong, S., & Li, M. (2001). A compression algorithm for DNA Sequences IEEE Engineering in Medicine and Biology Magazine, (Special Issue on Bioinformatics) 20:4, 61-66.
References
Filter by:
2001
Lin, G., Ma, B., & Zhang, K. (2001). Edit Distance between Two RNA Structures
2000
Jiang, T., Lin, G., Ma, B., & Zhang, K. (2000). The Longest Common Subsequence Problem for Arc-Annotated Sequences
McConkey, B., Mezey, P., Dixon, D., & Greenberg, B. (2000). Fractional simplex designs for interaction screening in complex mixtures Biometrics, 56:824-832.
DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., & Zhang, L. (2000). On computing the neares t neighbor interchange distance in D.Z. Du, P.M. Pardalos and J. Wang (eds.), Proceedings of the DIMACS Workshop on Discrete Problems With Medical Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AmericanMathematical Society, Vol. 55, Pp. 125-143.
Vision, T., Brown, D., & Tanksley, S. (2000). The origins of genomic duplications in Arabidopsis The Origins of Genomic Duplications in Arabidopsis.
Bryant, D., Tsang, J., Kearney, P., & Li, M. (2000). Computing the quartet difference between two trees
Bryant, D., Berry, V., Kearney, P., Jiang, T., Li, M., Wareham, T., & Zhang, H. (2000). A practical algorithm for recovering the best supported edges of an evolutionary tree