This paper addresses the problem of locally verifying global properties. Several natural questions are studied, such as “how expensive is local verification?” and more specifically “how expensive is local verification compared to computation?” A suitable model is introduced in which these questions are studied in terms of the number of bits a node needs to communicate. In addition, approaches a...

Antisense morpholino oligonucleotides (AMOs) can reprogram pre-mRNA splicing by complementary binding to a target site and regulating splice site selection, thereby offering a potential therapeutic tool for genetic disorders. However, the application of this technology into a clinical scenario has been limited by the low correction efficiency in vivo and inability of AMOs to efficiently cross t...

Flavio Seno, Cristian Micheletti, Amos Maritan and Jayanth R. Banavar (1) Dipartimento di Fisica, Università di Padova, Via Marzolo 8,35131 Padova, Italy and INFM (2) International School for Advanced Studies (S.I.S.S.A.), Via Beirut 2-4, 34014 Trieste, Italy and INFM (3) Department of Physics and Center for Materials Physics, 104 Davey Laboratory, The Pennsylvania State University, University ...

Since its launch in 2004, the open-source AMOS project has released several innovative DNA sequence analysis applications including: Hawkeye, a visual analytics tool for inspecting the structure of genome assemblies; the Assembly Forensics and FRCurve pipelines for systematically evaluating the quality of a genome assembly; and AMOScmp, the first comparative genome assembler. These applications...

Integration of data from autonomous, distributed and heterogeneous data sources poses several technical challenges. This paper overviews the data integration system AMOS II based on the wrapper-mediator approach. AMOS II consists of: (i) a mediator database engine that can process and execute queries over data stored locally and in several external data sources, and (ii) object-oriented (OO) mu...

The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults. We develop the marking algorithm, a randomized on-line algorithm for the paging problem. We prove that its expected cost on any sequence of requests is within a factor of 2Hk of optimum. (Where Hk is the kth harmonic number, which is roughly Ink.) The best such facto...