References

Ma, B., & Sun, X. (2009). More Efficient Algorithm for Closest String and Substring Problems SIAM J. Computing 39(4): 1432-1443.

Li, W., Ma, B., & Zhang, K. (2009). Amino Acid Classification and Hash Seeds for Homology Search

Boucher, C., & Brown, D. (2009). Detecting motifs in a large data set: applying probabilistic insights to motif finding

Brown, D., & Golod, D. (2009). A tutorial of techniques for improving standard hidden Markov model algorithms Journal of Bioinformatics and Computational Biology 7: 737-754.

Li, M., & Vitanyi, P. (2008). An introduction to Kolmogorov complexity and its applications (Springer-Verlag, 1st Edition 1993 (xx+546 pp). 2nd Edition 1997 (xx+637 pp). 3rd Edition 2008 (xx+792 pp). 4th Edition). Springer New York. Retrieved from https://www.springer.com/gp/book/9781489984456

Ma, B., Xin, L., & Zhang, K. (2008). A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method Journal of Combinatorial Optimization 16(3): 293-306.

Lin, H., Zhang, Z., Zhang, M., Ma, B., & Li, M. (2008). ZOOM! Zillions of oligos mapped Bioinformatics. 24:21, 2431-2437.

Zhang, J., Gao, X., Xu, J., & Li, M. (2008). Rapid and accurate side chain prediction with local backbone information

Li, S., Bu, D., Xu, J., & Li, M. (2008). Fragment-HMM: a new approach to protein structure prediction Protein Science, 17 1925-1934.

Ma, B., & Yao, H. (2008). Seed Optimization Is No Easier Than Optimal Golomb Ruler Design