Zhang, L., Ma, B., & Wang, L. (2002). Efficient Methods for Inferring Tandem Duplication History
Reference author: L. Wang
First name
L.
Last name
Wang
Chen, Z., Ma, B., & Wang, L. (2014). Randomized and Parameterized Algorithms for the Closest String Problem Presented at the The 25th Symposium on Combinatorial Pattern Matching. 100-109 conference.
Chen, Z., Ma, B., & Wang, L. (2016). Randomized Fixed-Parameter Algorithms for the Closest String Problem Algorithmica 74(1): 466-484.
Yuasa, S., Chen, Z., Ma, B., & Wang, L. (2017). Designing and Implementing Algorithms for the Closest String Problem Presented at the International Workshop on Frontiers in Algorithmics. 79-90 conference.
Li, M., Ma, B., & Wang, L. (2000). Near Optimal Multiple Alignment within a Band in Polynomial Time
DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Wang, L., & Zhang, L. (1999). Computing distances between evolutionary trees In In Handbook in Combinatorial Optimization. Springer.
Ma, B., Wang, L., & Zhang, L. (1999). Fitting Distances by Tree Metrics with Incremental Errors Fitting Distances by Tree Metrics With Incremental Errors.
Ma, B., Wang, L., & Zhang, L. (1999). Fitting Distances by Tree Metrics with Incremental Errors Journal of Combinatorial Optimization 3: 213-225.