A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem. - W. Henry Suters; Faisal N. Abu-Khzam; Yun Zhang 013; Christopher T. Symons; Nagiza F. Samatova; Michael A. Langston (COCOON, 2005)

Genome-Scale Computational Approaches to Memory-Intensive Applications in Systems Biology. - Yun Zhang 013; Faisal N. Abu-Khzam; Nicole E. Baldwin; Elissa J. Chesler; Michael A. Langston; Nagiza F. Samatova (SC, 2005)

The Cluster Editing Problem: Implementations and Experiments. - Frank K. H. A. Dehne; Michael A. Langston; Xuemei Luo; Sylvain Pitre; Peter Shaw 001; Yun Zhang 013 (IWPEC, 2006)

A Systematic Comparison of Genome Scale Clustering Algorithms - (Extended Abstract). - Jeremy J. Jay; John D. Eblen; Yun Zhang 013; Mikael Benson; Andy D. Perkins; Arnold M. Saxton; Brynn H. Voy; Elissa J. Chesler; Michael A. Langston (ISBRA, 2011)

A systematic comparison of genome-scale clustering algorithms. - Jeremy J. Jay; John D. Eblen; Yun Zhang 013; Mikael Benson; Andy D. Perkins; Arnold M. Saxton; Brynn H. Voy; Elissa J. Chesler; Michael A. Langston (BMC Bioinform., 2012)

On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. - Yun Zhang 013; Charles A. Phillips; Gary L. Rogers; Erich J. Baker; Elissa J. Chesler; Michael A. Langston (BMC Bioinform., 2014)