Research & Publications

Refereed Journal Publications

H. Buhrman, B. Hescott, S. Homer and L. Torenvliet, “Non-uniform Reductions”, in Theory of Computing Systems, 47 (2) (2010), 317-341.

B. Hescott, M.D.M. Leiserson, L. Cowen, and D. Slonim. “Evaluating Between-Pathway Models with Expression Data”, Journal of Computational Biology, 17 (3) (2010), 443-457

A. Fox, B. Hescott, M. Pellegrini, A. Blumer, and D. Slonim, “Connectedness of PPI Network Neighborhood Identifies Regulatory Hub Proteins”, Bioinformatics, 27 (8) (2011), 1135-1142

M. Leiserson, D. Tatar, L. Cowen and B. Hescott, “Inferring Mechanisms of Compensation from E-MAP and SGA Data Using Local Search Algorithms for Max Cut”, Journal of Computational Biology, 18 (11) (2011), 1399-1409

A. Gallant , M.D.M. Leiserson , M Kachalov , L. Cowen, and B. Hescott, “Genecentric: A Package to Uncover Graph-theoretic Structure in High-throughput Epistasis Data”, BMC Bioinformatics, 14(23) (2013)

M. Cao, H. Zhang, J. Park, N. Daniels, M. Crovella, L. Cowen and B. Hescott, “Going the Distance for Protein Function Prediction”, PLoS One, 8 (10) (2013)

M. Cao, C. Pietras, X. Feng, K. Doroschak, T. Schaeffer, J. Park, H. Zhang, L. Cowen and B. Hescott, “New Directions for Diffusion-Based Network Prediction of Protein Function: Incorporating Pathways with Confidence”, Bioinformatics, 30(12):i219-i227, (2014)

J. Crouser, B. Hescott, and R. Chang, “Toward Complexity Measures for Systems Involving Human Computation”, Journal of Human Computation 1(1)(2014)

B. Hescott, C. Malchik, and A. Winslow, “Tight Bounds for Active Self-Assembly Using an Insertion Primitive.”, Algorithmica (2014):1-18

G. Barequet, S. Cannon, E. Fox-Epstein, B. Hescott, D. Souvaine, C. Toth, and A. Winslow, “Diffuse Reflections Diameter in Simple Polygons”, Discrete Applied Mathematics, (2015)

B. Hescott, and R. Khardon, “The Complexity of Reasoning with FODD and GFODD”, Artificial Intelligence 229(2015):1-32

Refereed Conference Publications

B. Hescott, M.D.M. Leiserson, L. Cowen, and D. Slonim. “Evaluating Between-Pathway Models with Expression Data”, Research in Computational Molecular Biology (RECOMB) 2009. (Acceptance Rate: 22%)

M. Leiserson, D. Tatar, L. Cowen and B. Hescott, “Inferring Mechanisms of Compensation from E-MAP and SGA Data Using Local Search Algorithms for Max Cut”, Research in Computational Molecular Biology (RECOMB) 2011(Acceptance Rate: 28%)

G. Barequet, S. Cannon, E. Fox-Epstein, B. Hescott, D. Souvaine, C. Toth, and A. Winslow, “Diffuse Reflections in Simple Polygons”, The VII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS) 2013 (Acceptance Rate: 46%)

M. Cao, C. Pietras, X. Feng, K. Doroschak, T. Schaeffer, J. Park, H. Zhang, L. Cowen and B. Hescott, “New Directions for Diffusion-Based Network Prediction of Protein Function: Incorporating Pathways with Confidence”, International Conference on Intelligent Systems for Molecular Biology ISMB, 2014. (Acceptance Rate: 19%)

B. Hescott and R. Khardon, “The Complexity of Reasoning with FODD and GFODD”, Association for the Advancement of Artificial Intelligence (AAAI) Conference on Artificial Intelligence, July 2014 (Acceptance Rate: 28%)

I. Fried, A. Cannistra, C. Carter, A. Piel, M. Crovella, and B. Hescott, “CANDL: Coarsely Aligning Networks with Diffusion and Landmarks”. International Conference on Intelligent Systems for Molecular Biology (ISMB), Late Breaking Research, 2015

J. Park, B. Hescott, and D. Slonim.“Towards a More Molecular Taxonomy of Disease”, Bio-Ontologies at International Conference on Intelligent Systems for Molecular Biology (ISMB), 2016.

Technical Reports

B. Hescott, and D. Koulomzin. “On Clustering Images Using Compression”, Boston University Computer Science Department, Technical Report, 2006

K. Moran, K. Claypool, and B. Hescott. “CompositeMatch: Detecting N-ary Matches in Ontology Alignment”, Ontology Matching, 2009

J. Finkelstein and B. Hescott. “Polynomial-time Kernel Reductions”, arXiv, 2016