MPSQ: a web tool for protein-state searching

MPSQ (multi-protein-states query) is a web-based tool for the discovery of protein states (e.g. biological interactions, covalent modifications, cellular localizations). In particular, large sets of genes can be used to search for enriched state transition network maps (NMs) and features facilitating the interpretation of genomic-scale experiments such as microarrays. One NM collects all the catalogued states of a protein as well as the mutual transitions between the states. For the returned NM, graph visualization is provided for easy understanding and to guide further analysis.     

CLAGen: a tool for clustering and annotating gene sequences using a suffix tree algorithm

Most multiple gene sequence alignment methods rely on conventions regarding the score of a multiple alignment in pairwise fashion. Therefore, as the number of sequences increases, the runtime of sequencing expands exponentially. In order to solve the problem, this paper presents a multiple sequence alignment method using a linear-time suffix tree algorithm to cluster similar sequences at one time without pairwise alignment. After searching for common subsequences, cross-matching common subsequences were generated, and sometimes inexact matching was found. So, a procedure aimed at masking the inexact cross-matching pairs was suggested here. In addition, BLAST was combined with a clustering tool in order to annotate the clusters generated by suffix tree clustering. The proposed method for clustering and annotating genes consists of the following steps: (1) construction of a suffix tree; (2) searching and overlapping common subsequences; (3) grouping subsequence pairs; (4) masking cross-matching pairs; (5) clustering gene sequences; (6) annotating gene clusters by the BLAST search. The performance of the proposed system, CLAGen, was successfully evaluated with 42 gene sequences in a TCA cycle (a citrate cycle) of bacteria. The system generated 11 clusters and found the longest subsequences of each cluster, which are biologically significant.     

HDAPD: a web tool for searching the disease-associated protein structures

Background

PCR-restriction fragment length polymorphism (RFLP) assay is a cost-effective method for SNP genotyping and mutation detection, but the manual mining for restriction enzyme sites is challenging and cumbersome. Three years after we constructed SNP-RFLPing, a freely accessible database and analysis tool for restriction enzyme mining of SNPs, significant improvements over the 2006 version have been made and incorporated into the latest version, SNP-RFLPing 2.

Results

The primary aim of SNP-RFLPing 2 is to provide comprehensive PCR-RFLP information with multiple functionality about SNPs, such as SNP retrieval to multiple species, different polymorphism types (bi-allelic, tri-allelic, tetra-allelic or indels), gene-centric searching, HapMap tagSNPs, gene ontology-based searching, miRNAs, and SNP500Cancer. The RFLP restriction enzymes and the corresponding PCR primers for the natural and mutagenic types of each SNP are simultaneously analyzed. All the RFLP restriction enzyme prices are also provided to aid selection. Furthermore, the previously encountered updating problems for most SNP related databases are resolved by an on-line retrieval system.

Conclusions

The user interfaces for functional SNP analyses have been substantially improved and integrated. SNP-RFLPing 2 offers a new and user-friendly interface for RFLP genotyping that can be used in association studies and is freely available at http://bio.kuas.edu.tw/snp-rflping2.     

PROMPT: a protein mapping and comparison tool

Background  

Comparison of large protein datasets has become a standard task in bioinformatics. Typically researchers wish to know whether one group of proteins is significantly enriched in certain annotation attributes or sequence properties compared to another group, and whether this enrichment is statistically significant. In order to conduct such comparisons it is often required to integrate molecular sequence data and experimental information from disparate incompatible sources. While many specialized programs exist for comparisons of this kind in individual problem domains, such as expression data analysis, no generic software solution capable of addressing a wide spectrum of routine tasks in comparative proteomics is currently available.     

ANDY: a general, fault-tolerant tool for database searching on computer clusters

SUMMARY: ANDY (seArch coordination aND analYsis) is a set of Perl programs and modules for distributing large biological database searches, and in general any sequence of commands, across the nodes of a Linux computer cluster. ANDY is compatible with several commonly used distributed resource management (DRM) systems, and it can be easily extended to new DRMs. A distinctive feature of ANDY is the choice of either dedicated or fair-use operation: ANDY is almost as efficient as single-purpose tools that require a dedicated cluster, but it runs on a general-purpose cluster along with any other jobs scheduled by a DRM. Other features include communication through named pipes for performance, flexible customizable routines for error-checking and summarizing results, and multiple fault-tolerance mechanisms. Availability: ANDY is freely available and can be obtained from http://compbio.berkeley.edu/proj/andy. SUPPLEMENTARY INFORMATION: Supplemental data, figures, and a more detailed overview of the software are found at http://compbio.berkeley.edu/proj/andy.     

ParaDB: a tool for paralogy mapping in vertebrate genomes

We present ParaDB (http://abi.marseille.inserm.fr/paradb/), a new database for large-scale paralogy studies in vertebrate genomes. We intended to collect all information (sequence, mapping and phylogenetic data) needed to map and detect new paralogous regions, previously defined as Paralogons. The AceDB database software was used to generate graphical objects and to organize data. General data were automatically collated from public sources (Ensembl, GadFly and RefSeq). ParaDB provides access to data derived from whole genome sequences (Homo sapiens, Mus musculus and Drosophila melanogaster): cDNA and protein sequences, positional information, bibliographical links. In addition, we provide BLAST results for each protein sequence, InParanoid orthologs and 'In-Paralogs' data, previously established paralogy data, and, to compare vertebrates and Drosophila, orthology data.     

Autoluminescence imaging: a non-invasive tool for mapping oxidative stress

Living organisms spontaneously emit faint light, and this autoluminescence is stimulated in response to many stresses. This phenomenon is attributable to the endogenous production of excited states during oxidative reactions, particularly during peroxidation of lipids, which generates light-emitting molecules such as triplet carbonyls and singlet oxygen. Using highly sensitive cameras, it is now possible to remotely image spontaneous luminescence with a good spatial resolution, providing a new non-invasive tool for mapping oxidative stress and lipid peroxidation in plants.     

XFINGER: A tool for searching and visualising protein fingerprints and patterns

A tool for searching pattern and fingerprint databases is described.Fingerprints are groups of motifs excised from conserved regionsof sequence alignments and used for iterative database scanning.The constituent motifs are thus encoded as small alignmentsin which sequence information is maximised with each databasepass; they therefore differ from regular-expression patterns,in which alignments are reduced to single consensus sequences.Different database formats have evolved to store these disparatetypes of information, namely the PROSITE dictionary of patternsand the PRINTS fingerprint database, but programs have not beenavailable with the flexibility to search them both. We havedeveloped a facility to do this: the system allows query sequencesto be scanned against either PROSITE, the full PRINTS database,or against individual fingerprints. The results of fingerprintsearches are displayed simultaneously in both text and graphicalwindows to render them more tangible to the user. Where structuralcoordinates are available, identified motifs may be visualisedin a 3D context. The program runs on Silicon Graphics machinesusing GL graphics libraries and on machines with X servers supportingthe PEX extension: its use is illustrated here by depictingthe location of low-density lipoprotein-binding (LDL) motifsand leucine-rich repeats in a mosaic G-protein-coupled receptor(GPCR).     

Functional group and substructure searching as a tool in metabolomics

Background

A direct link between the names and structures of compounds and the functional groups contained within them is important, not only because biochemists frequently rely on literature that uses a free-text format to describe functional groups, but also because metabolic models depend upon the connections between enzymes and substrates being known and appropriately stored in databases.

Methodology

We have developed a database named “Biochemical Substructure Search Catalogue” (BiSSCat), which contains 489 functional groups, >200,000 compounds and >1,000,000 different computationally constructed substructures, to allow identification of chemical compounds of biological interest.

Conclusions

This database and its associated web-based search program (http://bisscat.org/) can be used to find compounds containing selected combinations of substructures and functional groups. It can be used to determine possible additional substrates for known enzymes and for putative enzymes found in genome projects. Its applications to enzyme inhibitor design are also discussed.     

CAFTAN: a tool for fast mapping, and quality assessment of cDNAs

Background  

The German cDNA Consortium has been cloning full length cDNAs and continued with their exploitation in protein localization experiments and cellular assays. However, the efficient use of large cDNA resources requires the development of strategies that are capable of a speedy selection of truly useful cDNAs from biological and experimental noise. To this end we have developed a new high-throughput analysis tool, CAFTAN, which simplifies these efforts and thus fills the gap between large-scale cDNA collections and their systematic annotation and application in functional genomics.     

From possessive suffix to affective demonstrative suffix in Hungarian: a grammaticalization analysis

The non-possessive uses of possessive morphology in Uralic languages have been a topic of intense debate (Fraurud 2001; Nikolaeva 2003; Gerland 2014; Janda 2015; É. Kiss and Tánczos to appear). In this paper, I focus on a special use of the poss.3sg suffix in Hungarian constructions such as a hülyéje (the stupid-poss.3sg): lit. ‘its stupid’, meaning ‘that total idiot’. My main claim is that this suffix is an affective demonstrative suffix (Lakoff 1974; Liberman 2008; Potts and Schwarz 2010), and that it has developed as a result of grammaticalization from a full-fledged possessive construction of the form a világ hülyéje (the world stupid-poss.3sg): lit. ‘the world’s stupid’, meaning: ‘the biggest idiot in the world’. I will show that this gradual process can be reconstructed fairly accurately using historical and contemporary corpora. I also claim that this grammaticalization pathway is very natural as it is based on a set-element relationship which is often expressed by possessive constructions cross-linguistically. I also identify two parameters which facilitate this grammaticalization process: the availability of (silent) pro possessors and the lack of gender agreement on the possessive suffix. Since Uralic languages in general have these parameters, I will argue that this grammaticalization pathway should at least be considered as one of the possible sources of the demonstrative (and definiteness marking) uses of poss.3sg suffixes in Uralic languages. Finally, my results are also an important contribution to the debate on whether demonstratives can be derived from other functional elements through grammaticalization (Plank 1979; Traugott 1982; Himmelmann 1997).     

Fine mapping of progressive pseudorheumatoid dysplasia: a tool for heterozygote identification

Progressive pseudorheumatoid dysplasia is a skeletal genetic disorder affecting primarily the articular cartilage, causing joint stiffness and leading to a crippling status. More than two-thirds of the reported patients belong to Arab and Mediterranean populations. The disease locus has been mapped to chromosome 6q22 in a region of 12.9 cM using a Jordanian family. We examined two additional families, one Jordanian and one Palestinian, to test for homogeneity of the disorder and the presence of a common haplotype, to fine map the disorder, and to use all the information to derive a tool for heterozygote identification. The two families showed linkage to the same previously reported locus, thus suggesting homogeneity, but they did not share a common haplotype. They also provided information that refined the genetic region for the disease locus to 2.1 cM with three microsatellite markers. The absence of a common haplotype indicates that no common ancestor mutations were inherited by our patients. Genotyping for the three-marker haplotype showed that it can be used as a heterozygote identification tool.     

PepMapper: a collaborative web tool for mapping epitopes from affinity-selected peptides

Epitope mapping from affinity-selected peptides has become popular in epitope prediction, and correspondingly many Web-based tools have been developed in recent years. However, the performance of these tools varies in different circumstances. To address this problem, we employed an ensemble approach to incorporate two popular Web tools, MimoPro and Pep-3D-Search, together for taking advantages offered by both methods so as to give users more options for their specific purposes of epitope-peptide mapping. The combined operation of Union finds as many associated peptides as possible from both methods, which increases sensitivity in finding potential epitopic regions on a given antigen surface. The combined operation of Intersection achieves to some extent the mutual verification by the two methods and hence increases the likelihood of locating the genuine epitopic region on a given antigen in relation to the interacting peptides. The Consistency between Intersection and Union is an indirect sufficient condition to assess the likelihood of successful peptide-epitope mapping. On average from 27 tests, the combined operations of PepMapper outperformed either MimoPro or Pep-3D-Search alone. Therefore, PepMapper is another multipurpose mapping tool for epitope prediction from affinity-selected peptides. The Web server can be freely accessed at: http://informatics.nenu.edu.cn/PepMapper/     

Comparative gene mapping: a valuable new tool for mammalian developmental studies

Technological advances in the 1970s encouraged the mapping of homologous gene loci in different mammalian species, including mouse and man. One hundred eighty-five homologous loci have now been mapped in these two species. Conservation of linkage is sufficient to identify substantial segments of the two genomes that have been left intact since their divergence from a common ancestor. The recognition of these conserved segments allows experimental manipulation of mouse chromosomes or chromosomal regions to produce models of human chromosomal anomalies of medical importance. Comparative gene mapping has been extended beyond mouse and man and the genomes of some species, including domestic cattle, appear to be more highly conserved relative to humans than the mouse. Such species may be particularly useful in providing models of human chromosomal anomalies that cannot be duplicated in laboratory mice.     

SEAL: a distributed short read mapping and duplicate removal tool

SUMMARY: SEAL is a scalable tool for short read pair mapping and duplicate removal. It computes mappings that are consistent with those produced by BWA and removes duplicates according to the same criteria employed by Picard MarkDuplicates. On a 16-node Hadoop cluster, it is capable of processing about 13 GB per hour in map+rmdup mode, while reaching a throughput of 19 GB per hour in mapping-only mode. AVAILABILITY: SEAL is available online at http://biodoop-seal.sourceforge.net/.