On generalized cluster algorithms for frustrated spin models

Standard Monte Carlo cluster algorithms have proven to be very effective for many different spin models, however they fail for frustrated spin systems. Recently a generalized cluster algorithm was introduced that works extremely well for the fully frustrated Ising model on a square lattice, by placing bonds between sites based on information from plaquettes rather than links of the lattice. Here we study some properties of this algorithm and some variants of it. We introduce a practical methodology for constructing a generalized cluster algorithm for a given spin model, and investigate apply this method to some other frustrated Ising models. We find that such algorithms work well for simple fully frustrated Ising models in two dimensions, but appear to work poorly or not at all for more complex models such as spin glasses.Comment: 34 pages in RevTeX. No figures included. A compressed postscript file for the paper with figures can be obtained via anonymous ftp to minerva.npac.syr.edu in users/paulc/papers/SCCS-527.ps.Z. Syracuse University NPAC technical report SCCS-52

ASPicDB: a database of annotated transcript and protein variants generated by alternative splicing

Alternative splicing is emerging as a major mechanism for the expansion of the transcriptome and proteome diversity, particularly in human and other vertebrates. However, the proportion of alternative transcripts and proteins actually endowed with functional activity is currently highly debated. We present here a new release of ASPicDB which now provides a unique annotation resource of human protein variants generated by alternative splicing. A total of 256 939 protein variants from 17 191 multi-exon genes have been extensively annotated through state of the art machine learning tools providing information of the protein type (globular and transmembrane), localization, presence of PFAM domains, signal peptides, GPI-anchor propeptides, transmembrane and coiled-coil segments. Furthermore, full-length variants can be now specifically selected based on the annotation of CAGE-tags and polyA signal and/or polyA sites, marking transcription initiation and termination sites, respectively. The retrieval can be carried out at gene, transcript, exon, protein or splice site level allowing the selection of data sets fulfilling one or more features settled by the user. The retrieval interface also enables the selection of protein variants showing specific differences in the annotated features. ASPicDB is available at http://www.caspur.it/ASPicDB/

The mepsMAP server. Mapping epitopes on protein surface: Mining annotated proteins

For a growing number of biologists DNA or protein data are typically retrieved and managed on the Web, and not in the laboratory. A large number of bioinformatics datasets from primary and (thousands of) secondary databases are scattered on the Web in various formats. A biologist end-user might need to access and use tens of databases and tools every day. For this reason, the bioinformatics community is developing more and more service-oriented architectures (SOAs): software architecture of loosely coupled software services that can be accessed without knowledge of, or control over, their internal architecture. Data-processing and analysis tasks can be automated by having free access to bioinformatics Web services (WSs) that are the building blocks of the SOAs. In this paper we introduce a new bioinformatics Web server, mepsMAP (mapping epitopes on protein surface: Mining Annotated Proteins), developed to identify the recognition sites between antibodies and their cognate antigens. In some cases, the recognition site is represented by a continuous segment of the antigen sequence, but much more often the epitope is "conformational," i.e., the antibody recognizes the location and type of exposed antigen side chains that are not necessarily contiguous in the antigen's sequence, but brought together by its three-dimensional structure. A facility on the server allows the user to search putative conformational epitopes on protein surface, querying the system for proteins with a given annotation. The mepsMAP server has been implemented as a SOA composed by a database and a set of four WSs. We present here the software architecture of the system with a detailed description of the WS dataflow that has been optimized to provide the best computing performance while maintaining the easiest end-user access to the system via a Web interface

RAP: RNA-Seq Analysis Pipeline, a new cloud-based NGS web application.

BACKGROUND: The study of RNA has been dramatically improved by the introduction of Next Generation Sequencing platforms allowing massive and cheap sequencing of selected RNA fractions, also providing information on strand orientation (RNA-Seq). The complexity of transcriptomes and of their regulative pathways make RNA-Seq one of most complex field of NGS applications, addressing several aspects of the expression process (e.g. identification and quantification of expressed genes and transcripts, alternative splicing and polyadenylation, fusion genes and trans-splicing, post-transcriptional events, etc.). METHODS: In order to provide researchers with an effective and friendly resource for analyzing RNA-Seq data, we present here RAP (RNA-Seq Analysis Pipeline), a cloud computing web application implementing a complete but modular analysis workflow. This pipeline integrates both state-of-the-art bioinformatics tools for RNA-Seq analysis and in-house developed scripts to offer to the user a comprehensive strategy for data analysis. RAP is able to perform quality checks (adopting FastQC and NGS QC Toolkit), identify and quantify expressed genes and transcripts (with Tophat, Cufflinks and HTSeq), detect alternative splicing events (using SpliceTrap) and chimeric transcripts (with ChimeraScan). This pipeline is also able to identify splicing junctions and constitutive or alternative polyadenylation sites (implementing custom analysis modules) and call for statistically significant differences in genes and transcripts expression, splicing pattern and polyadenylation site usage (using Cuffdiff2 and DESeq). RESULTS: Through a user friendly web interface, the RAP workflow can be suitably customized by the user and it is automatically executed on our cloud computing environment. This strategy allows to access to bioinformatics tools and computational resources without specific bioinformatics and IT skills. RAP provides a set of tabular and graphical results that can be helpful to browse, filter and export analyzed data, according to the user need

MitoZoa: A curated mitochondrial genome database of metazoans for comparative genomics studies

MitoZoa is a relational database collecting curated metazoan entries of complete or nearly complete mitochondrial genomes (mtDNA), specifically designed to assist comparative studies of mitochondrial genome-level features in a given taxon or in congeneric species of Metazoa. The principal novelties of MitoZoa are extensive corrections/improvements of the mtDNA annotations and the possibility of easily searching for data on: (1) gene order, a genomic feature useful as phylogenetic marker; (2) sequence, size and location of non-coding regions, likely containing the regulatory signals for mtDNA replication and transcription; (3) mt features/sequences of congeneric species, where saturation phenomena in nucleotide substitutions and gene order changes are expected to be absent or at least minimal. In addition, MitoZoa allows the exploration of basic mt features such as molecule topology, genetic code, gene content, and compositional parameters of the entire genome. Finally, in order to facilitate downstream analyses of retrieved data, MitoZoa entry lists can be visualized and downloaded in a tabular format, while sequences and gene order data are provided in FASTA and FASTA-like formats, respectively. The MitoZoa database is available at http://www.caspur.it/mitozoa. (C) 2010 Elsevier B.V. and Mitochondria Research Society. All rights reserved