  We analyze the Conradi-Kahle Algorithm for detecting binomiality. We present
experiments using two implementations of the algorithm in Macaulay2 and Maple
on biological models and assess the performance of the algorithm on these
models. We compare the two implementations with each other and with Gr\"obner
bases computations up to their performance on these biological models.
