Revisiting cangitoxin, a sea anemone peptide: Purification and characterization of cangitoxins II and III from the venom of Bunodosoma cangicum

Sodium channel toxins from sea anemones are employed as tools for dissecting the biophysical properties of inactivation in voltage-gated sodium channels. Cangitoxin (CGTX) is a peptide containing 48 amino acid residues and was formerly purified from Bunodosoma cangicum. Nevertheless, previous works reporting, the isolation procedures for such peptide from B. cangicum secretions are controversial and may lead to incorrect information. In this paper, we report a simple and rapid procedure, consisting of two chromatographic steps, in order to obtain a CGTX analog directly from sea anemone venom. We also report a substitution of N16D in this peptide sample and the co-elution of an inseparable minor isoform presenting the R14H substitution. Peptides are named as CGTX-II and CGTX-III, and their effects over Nav1.1 channels in patch clamp experiments are demonstrated. (c) 2008 Elsevier Ltd. All rights reserved.

Paged similarity queries

An important feature of a database management systems (DBMS) is its client/server architecture, where managing shared memory among the clients and the server is always an tough issue. However, similarity queries are specially sensitive to this kind of architecture, since the answer sizes vary widely. Usually, the answers of similarity query are fully processed to be sent in full to the user, who often is interested in just parts of the answer, e.g. just few elements closer or farther to the query reference. Compelling the DBMS to retrieve the full answer, further ignoring its majority is at least a waste of server processing power. Paging the answer is a technique that splits the answer onto several pages, following client requests. Despite the success of paging on traditional queries, little work has been done to support it in similarity queries. In this work, we present a technique that not only provides paging in similarity range or k-nearest neighbor queries, but also supports them in two variations: the forward similarity query and the backward similarity query. They return elements either increasingly farther of increasingly closer to the query reference. The reported experiments show that, depending on the proportion of the interesting part over the full answer, both techniques allow answering queries much faster than it is obtained in the non-paged way. (C) 2010 Elsevier Inc. All rights reserved.

A geometric mass-preserving redistancing scheme for the level set function

In this paper we describe and evaluate a geometric mass-preserving redistancing procedure for the level set function on general structured grids. The proposed algorithm is adapted from a recent finite element-based method and preserves the mass by means of a localized mass correction. A salient feature of the scheme is the absence of adjustable parameters. The algorithm is tested in two and three spatial dimensions and compared with the widely used partial differential equation (PDE)-based redistancing method using structured Cartesian grids. Through the use of quantitative error measures of interest in level set methods, we show that the overall performance of the proposed geometric procedure is better than PDE-based reinitialization schemes, since it is more robust with comparable accuracy. We also show that the algorithm is well-suited for the highly stretched curvilinear grids used in CFD simulations. Copyright (C) 2010 John Wiley & Sons, Ltd.