1 citations · 1 across the 3 of their papers we have counts for
6 papers
On the Runtime of Chemical Reaction Networks Beyond Idealized Conditions
Anne Condon, Yuval Emek, Noga Harlev
This paper studies the (discrete) \emph{chemical reaction network (CRN)} computational model that emerged in the last two decades as an abstraction for molecular programming. The c…
Isometric Hamming embeddings of weighted graphs
Joseph Berleant, Kristin Sheridan, Anne Condon +2
A mapping from the vertex set of one graph to another graph is an isometric embedding if the shortest path distance between any two vertices in equal…
Factorization and pseudofactorization of weighted graphs
Kristin Sheridan, Joseph Berleant, Mark Bathe +2
For unweighted graphs, finding isometric embeddings is closely related to decompositions of into Cartesian products of smaller graphs. When is isomorphic to a Cartesian gra…
The pathway elaboration method for mean first passage time estimation in large continuous-time Markov chains with applications to nucleic acid kinetics
Sedigheh Zolaktaf, Frits Dannenberg, Mark Schmidt +2
For predicting the kinetics of nucleic acid reactions, continuous-time Markov chains (CTMCs) are widely used. The rate of a reaction can be obtained through the mean first passage…
Output-Oblivious Stochastic Chemical Reaction Networks
Ben Chugg, Anne Condon, Hooman Hashemi
We classify the functions which are stably computable by output-oblivious Stochastic Chemical Reaction Networks (CRNs), i.e., systems of rea…
The complexity of string partitioning
Anne Condon, Ján Maňuch, Chris Thachuk
Given a string over a finite alphabet and an integer , can be partitioned into strings of length at most , such that there are no \emph{collisions}? We refer to t…