Reference author: B. DasGupta

DasGupta, B. ., Jiang, T. ., Kannan, S. ., Li, M. ., & Sweedyk, Z. . (1997). On the complexity and approximation of syntenic distance.

DasGupta, B. ., Jiang, T. ., Kannan, S. ., Li, M. ., & Sweedyk, Z. . (1998). On the complexity and approximation of syntenic distance. Discrete Applied Mathematics (special Issue in Computational biology), 88:1-3,59-82.

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.

DasGupta, B. ., Jiang, T. ., Kannan, S. ., Li, M. ., & Sweedyk, Z. . (1998). On the complexity and approximation of syntenic distance. On the Complexity and Approximation of Syntenic Distance.

DasGupta, B. ., Jiang, T. ., Kannan, S. ., Li, M. ., & Sweedyk, Z. . (1997). On the complexity and approximation of syntenic distance.

DasGupta, B. ., He, X. ., Jiang, T. ., Li, M. ., Tromp, J. ., & Zhang, L. . (1997). On distances between phylogenetic trees.

DasGupta, B. ., He, X. ., Jiang, T. ., Li, M. ., Tromp, J. ., & Zhang, L. . (1997). On distances between phylogenetic trees.