Then, I did one-year postdoc research at University of Waterloo . Currently, my research activities focus on bioinformatics and algorithm designing. Here is one of my pictures . This software was written by me to find approximate patterns from a DNA sequence efficiently. This is the online version.
Source code is provided.
T. Jiang, G. Lin, B. Ma, and K. Zhang, The longest common subsequence problem for arc-annotated sequences , to appear in special issue of Journal of Discrete Algorithms, accepted Dec. 2000. L. Wang, B. Ma, and M. Li, Fixed topology alignment with recombination , Discrete Applied Mathematics, vol. Charles Bennett, Ming Li, Bin Ma, Linking chain letters , to appear in Scientific American , accepted May. 2000. B. Ma and L. Wang, On the Inapproximability of Disjoint Paths and Minimum Steiner Forest with Bandwidth Constraints , Journal of Computer and System Sciences , vol. K. Lanctot, M. Li, B. Ma, S. Wang, and L. Zhang, Distinguishing string search problems , to appear in Information and Computation , accepted Jan. 2000.