Blum, A. ., Jiang, T. ., Li, M. ., Tromp, J. ., & Yannakakis, M. . (1994). Linear approximation of shortest superstrings. Journal of the ACM, 41:4, 630-647.
Reference author: J. Tromp
First name
J.
Last name
Tromp
Ma, B. ., Tromp, J. ., & Li, M. . (2002). PatternHunter: Faster and More Sensitive Homology Search. Bioinformatics 18: 440-445.
Chen, X. ., Li, M. ., Ma, B. ., & Tromp, J. . (2002). DNACompress: fast and effective DNA sequence compression. Bioinformatics. 18, 1696-1698.
Li, M. ., Ma, B. ., Kisman, D. ., & Tromp, J. . (2004). PatternHunter II: Highly Sensitive and Fast Homology Search. Journal of Bioinformatics and Computational Biology. 2(3): 417-440.
Keich, U. ., Li, M. ., Ma, B. ., & Tromp, J. . (2004). On spaced seeds for similarity search. Discrete Applied Math.138, 253-263.
Zhang, J. ., Jiang, B. ., Li, M. ., Tromp, J. ., Zhang, X. ., & Zhang, M. . (2007). Computing exact p-values for DNA motifs. Bioinformaics, 23, 531 - 537.
DasGupta, B. ., He, X. ., Li, M. ., Tromp, J. ., & Zhang, L. . (2014). Nearest neighbor interchange and related distances. Encyclopedia of Algorithms, Springer.
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.
DasGupta, B. ., He, X. ., Jiang, T. ., Li, M. ., & Tromp, J. . (1999). On the linear-cost subtree-transfer distance between phylogenetic trees. Algorithmica, 25, 176-195.
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.