Publication

A Rosetta-based protein design protocol converging to natural sequences

Related publications (80)

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.

Structural Studies and Protein Engineering of Human O6-Alkylguanine-DNA Alkyltransferase

Birgit Mollwitz

The specific labeling of proteins with synthetic probes is a powerful approach to study protein function and protein tags have been widely used for this purpose. A well-established example for a self-labeling protein tag is SNAP-tag. It specifically reacts ...

EPFL2012

A computational framework for the design of optimal protein synthesis

Vassily Hatzimanikatis, Julien Racle, Jan Overney

Despite the establishment of design principles to optimize codon choice for heterologous expression vector design, the relationship between codon sequence and final protein yield remains poorly understood. In this work, we present a computational framework ...

Wiley-Blackwell2012

A Provably Starvation-Free Distributed Directory Protocol

Vincent Gramoli, Hagit Albo Attiya

This paper presents Combine, a distributed directory protocol for shared objects, designed for large-scale distributed systems. Directory protocols support move requests, allowing to write the object locally, as well as lookup requests, providing a read-on ...

Springer-Verlag2010

COMBINE: An Improved Directory-Based Consistency Protocol

Vincent Gramoli, Hagit Albo Attiya

This paper presents COMBINE, a directory-based consistency protocol for shared objects, designed for large-scale distributed systems with unreliable links. Directory-based consistency protocols support move requests, allowing to write the object locally, a ...

2010

Joint Identity-Message Coding for Sensor Networks

Christina Fragouli, Suhas Diggavi, Lorenzo Keller, Mahdi Jafari Siavoshani

In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit—for instance, in many cases, sensors are used to detect ...

Institute of Electrical and Electronics Engineers2010

The Next 700 BFT Protocols

Rachid Guerraoui, Marko Vukolic, Nikola Knezevic

Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20,000 lines of challenging C++ code encompassing synchronization, networking and cryptography. They are notoriously difficult to develop, test and prove. We present a ...

2010

A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks

Atefeh Mashatan

We examine the problem of message recognition by reviewing the definitions and the security model in the literature. In particular, we examine the Jane Doe protocol, which was proposed by Lucks et al., more closely and note its inability to recover in case ...

Springer2009

Palladium-catalyzed annulation of acyloximes with arynes (or alkynes): synthesis of phenanthridines and isoquinolines

Jieping Zhu

A palladium-catalyzed domino aminopalladation/C-H functionalization sequence has been developed, and provides access to functionalized phenanthridines and isoquinolines. The use of butyronitrile as the solvent is determinant to the success of the domino pr ...

2009

Zebrafish: Methods and Protocols

In the last 20 years, research activity using the zebrafish Danio rerio has increased dramatically, due in part to the ease of breeding and raising them, their genetic tractability, embryonic accessibility, and their imaging potential. In Zebrafish: Method ...

Humana Press2009

The Next 700 BFT Protocols

Rachid Guerraoui, Marko Vukolic, Nikola Knezevic

Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20.000 lines of challenging C++ code encompassing synchronization, networking and cryptography. They are notoriously difficult to develop, test and prove. We present a ...

2008