Li, M. (1990). Towards a DNA sequencing theory: learning a string
Reference author: M. Li
First name
M.
Last name
Li
Li, M. (1990). Towards a DNA sequencing theory (learning a string)
Ma, B., Zhang, K., Lajoie, G., Doherty-Kirby, A., Liang, C., & Li, M. (2002). PEAKS: A powerful software tool for de novo sequencing of peptides from MS/MS data
Ma, B., Tromp, J., & Li, M. (2002). PatternHunter: Faster and More Sensitive Homology Search Bioinformatics 18: 440-445.
Consortium, M. G., Brown, D., Li, M., & Ma, B. (2002). Initial sequencing and comparative analysis of the mouse genome Nature,409:6822, 520-522.
Chen, X., Li, M., Ma, B., & Tromp, J. (2002). DNACompress: fast and effective DNA sequence compression Bioinformatics. 18, 1696-1698.
Chen, X., Kwong, S., & Li, M. (2000). A compression algorithm for DNA sequences and its application in genome comparison
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.
Li, M., Ma, B., & Wang, L. (2002). On the Closest String and Substring Problems Journal of the ACM 49(2): 157-171.
Jiang, T., & Li, M. (1994). On the approximation of shortest common supersequences and longest common subsequences