A computational framework for the discovery of novel biotransformations
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Formation building and keeping among vehicles has been studied for many years, since 1987 with Reynold's rules. This paper presents a control algorithm, based on recent work in graph theory, able to reconfigure static formations of non-holonomic vehicles e ...
Graph theory is an important topic in discrete mathematics. It is particularly interesting because it has a wide range of applications. Among the main problems in graph theory, we shall mention the following ones: graph coloring and the Hamiltonian circuit ...
Daughter crystals in orientation relationship with a parent crystal are called variants. They can be created by a structural phase transition (Landau or reconstructive), by twinning or by precipitation. Internal and external classes of transformations defi ...
The graph coloring problem is one of the most famous problems in graph theory and has a large range of applications. It consists in coloring the vertices of an undirected graph with a given number of colors such that two adjacent vertices get different col ...
Homing endonucleases (HE) are double-stranded DNAses that target large recognition sites (12-40 bp). HE-encoding sequences are usually embedded in either introns or inteins. Their recognition sites are extremely rare, with none or only a few of these sites ...
Proteolysis with proteases preloaded within nanopores of porous material is a very fast process, where proteins can be digested in minutes compared to the conventional bulk enzyme reactions taking place over hours. To model this surprising phenomenon, a mo ...
This paper is motivated by a method used for DNA sequencing by hybridization presented in [Jacek Blazewicz, Marta Kasprzak, Computational complexity of isothernnic DNA sequencing by hybridization, Discrete Appl. Math. 154 (5) (2006) 718-7291. This paper pr ...
We present two variants of Moler and Stewart's algorithm for reducing a matrix pair to Hessenberg-triangular (HT) form with increased data locality in the access to the matrices. In one of these variants, a careful reorganization and accumulation of Givens ...
We consider the problem of finding in a graph a set R of edges to be colored in red so that there are maximum matchings having some prescribed numbers of red edges. For regular bipartite graphs with n nodes on each side, we give sufficient conditions f ...
A novel reactive perstraction system has been developed based on liq.-core capsules, involving an enzyme-catalyzed reaction coupled with simultaneous in situ product recovery. Lipase-catalyzed reactions, hydrolysis of triprionin and nitrophenyl laurate, we ...
