Lower Bounds for Maximum Parsimony with Gene Order Data (2005)
Abraham Bachrach, Kevin Chen, Chris Harrelson, Radu Mihaescu, Satish Rao, Apurva Shah
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n 3) time dynamic programming...
Distributed network attack detection (2005)
John Mark Agosta, Branislav Kveton, Abraham Bachrach, Alex Newman, Denver Dash, Eve Schooler
We consider the problem of identifying a network attack that provides evidence of its existence through the presence of weak, distributed information. One example of weak distributed information,...