BRAID SOLUTIONS TO THE ACTION OF THE GIN ENZYME

2010 ◽  
Vol 19 (08) ◽  
pp. 1051-1074 ◽  
Author(s):  
HUGO CABRERA-IBARRA ◽  
DAVID A. LIZÁRRAGA-NAVARRO

The topological analysis of enzymes, an active research topic, has allowed the application of the tangle model of Ernst and Sumners to deduce the action mechanism of several enzymes, modeled as 2-string tangles. By first deriving some results in the theory of 3-braids, in this paper we analyze knotted and linked products of site-specific recombination mediated by the Gin DNA invertase, an enzyme that involves 3-string tangles. Provided that the 3-tangles involved are 3-braids, we determine four families of solutions to its action, two families for each of the directly and inversely repeated site cases. For each case, one of the given solutions had not previously been reported in the related literature. These solutions were found using a computer algorithm, based on our theoretical results, which allows one to solve tangle equations under the assumption that the product of two or more rounds of recombinations is known.

2012 ◽  
Vol 34 (8) ◽  
pp. 1003-1008
Author(s):  
De-Qiao TIAN ◽  
Yu-Min WANG ◽  
Tao ZHENG

Author(s):  
Radu Boţ ◽  
Guozhi Dong ◽  
Peter Elbau ◽  
Otmar Scherzer

AbstractRecently, there has been a great interest in analysing dynamical flows, where the stationary limit is the minimiser of a convex energy. Particular flows of great interest have been continuous limits of Nesterov’s algorithm and the fast iterative shrinkage-thresholding algorithm, respectively. In this paper, we approach the solutions of linear ill-posed problems by dynamical flows. Because the squared norm of the residual of a linear operator equation is a convex functional, the theoretical results from convex analysis for energy minimising flows are applicable. However, in the restricted situation of this paper they can often be significantly improved. Moreover, since we show that the proposed flows for minimising the norm of the residual of a linear operator equation are optimal regularisation methods and that they provide optimal convergence rates for the regularised solutions, the given rates can be considered the benchmarks for further studies in convex analysis.


1994 ◽  
Vol 13 (8) ◽  
pp. 1844-1855 ◽  
Author(s):  
R. McCulloch ◽  
L.W. Coggins ◽  
S.D. Colloms ◽  
D.J. Sherratt

Sign in / Sign up

Export Citation Format

Share Document