Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Automation pipeline”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5Linked to original sources

Clustering of protein domains in the human genome.

We present a systematic study of the clustering of genes within the human genome based on homology inferred from both sequence and structural similarity. The 3D-Genomics automated proteome annotation pipeline () was utilised to infer homology for each protein domain in the genome, for the 26 superfamilies most highly represented in the Structural Classification Of Proteins (SCOP) database. This approach enabled us to identify homologues that could not be detected by sequence-based methods alone. For each superfamily, we investigated the distribution, both within and among chromosomes, of genes encoding at least one domain within the superfamily. The results indicate a diversity of clustering behaviours: some superfamilies showed no evidence of any clustering, and others displayed significant clustering either within or among chromosomes, or both. Removal of tandem repeats reduced the levels of clustering observed, but some superfamilies still displayed highly significant clustering. Thus, our study suggests that either the process of gene duplication, or the evolution of the resulting clusters, differs between structural superfamilies.

Cadherins↗

Mapping SNPs to protein sequence and structure data.

MOTIVATION: Data on both single nucleotide polymorphisms and disease-related mutations are being collected at ever-increasing rates. To understand the structural effects of missense mutations, we consider both classes under the term single amino acid polymorphisms (SAAPs) and we wish to map these to protein structure where their effects can be analyzed. Our initial aim therefore is to create a completely automatically maintained database of SAAPs mapped to individual residues in the Protein Data Bank (PDB) updated as new mutations or structures become available. RESULTS: We present an integrated pipeline for the automated mapping of SAAP data from HGVbase to individual PDB residues. Achieving this in a completely automated and reliable manner is a complex task. Data extracted from HGVbase are mapped to EMBL entries to confirm whether the mutation occurs in an exon and, if so, where in the sequence it occurs. From there we map to Swiss-Prot entries and thence to the PDB. AVAILABILITY: The resulting database may be accessed over the web at http://www.bioinf.org.uk/saap/ or http://acrmwww.biochem.ucl.ac.uk/saap/ CONTACT: a.martin@biochem.ucl.ac.uk.

Algorithms↗

Crystallographic protein model-building on the web.

UNLABELLED: X-ray crystallography is the most widely used method to determine the 3D structure of protein molecules. One of the most difficult steps in protein crystallography is model-building, which consists of constructing a backbone and then amino acid side chains into an electron density map. Interpretation of electron density maps represents a major bottleneck in protein structure determination pipelines, and thus, automated techniques to interpret maps can greatly improve the throughput. We have developed WebTex, a simple and yet powerful web interface to TEXTAL, a program that automates this process of fitting atoms into electron density maps. TEXTAL can also be downloaded for local installation. AVAILABILITY: Web interface, downloadable binaries and documentation at http://textal.tamu.edu

Algorithms↗

Exegesis: a procedure to improve gene predictions and its use to find immunoglobulin superfamily proteins in the human and mouse genomes.

Exegesis is a procedure to refine the gene predictions that are produced for complex genomes, e.g. those of humans and mice. It uses the program Genewise, sequences determined by experiment, experimental maps of gene segment libraries and a new browser that allows the user to rapidly inspect and compare multiple gene maps to regions of genomic sequences. The procedure should be of general use. Here, we use the procedure to find members of the immunoglobulin superfamily in the human and mouse genomes. To do this, Exegesis was used to process the original gene predictions from the automated Ensembl annotation pipeline. Exegesis produced (i) many more complete genes and new transcripts and (ii) a mapping of the immunoglobulin and T cell receptor gene libraries to the genome, which are largely absent in the Ensembl set.

Animals↗

Protein coding potential of retroviruses and other transposable elements in vertebrate genomes.

We suggest an annotation strategy for genes encoded by retroviruses and transposable elements (RETRA genes) based on a set of marker protein domains. Usually RETRA genes are masked in vertebrate genomes prior to the application of automated gene prediction pipelines under the assumption that they provide no selective advantage to the host. Yet, we show that about 1000 genes in four vertebrate gene sets analyzed contain at least one RETRA gene marker domain. Using the conservation of genomic neighborhood (synteny), we were able to discriminate between RETRA genes with putative functionality in the vertebrates and those that probably function only in the context of mobile elements. We identified 35 such genes in human, along with their corresponding mouse and rat orthologs; which included almost all known human genes with similarity to mobile elements. The results also imply that the vast majority of the remaining RETRA genes in current gene sets are unlikely to encode vertebrate functions. To automatically annotate RETRA genes in other vertebrate genomes, we provide as a tool a set of marker protein domains and a manually refined list of domesticated or ancestral RETRA genes for rescuing genes with vertebrate functions.

Animals↗

Probabilistic annotation of protein sequences based on functional classifications.

BACKGROUND: One of the most evident achievements of bioinformatics is the development of methods that transfer biological knowledge from characterised proteins to uncharacterised sequences. This mode of protein function assignment is mostly based on the detection of sequence similarity and the premise that functional properties are conserved during evolution. Most automatic approaches developed to date rely on the identification of clusters of homologous proteins and the mapping of new proteins onto these clusters, which are expected to share functional characteristics. RESULTS: Here, we inverse the logic of this process, by considering the mapping of sequences directly to a functional classification instead of mapping functions to a sequence clustering. In this mode, the starting point is a database of labelled proteins according to a functional classification scheme, and the subsequent use of sequence similarity allows defining the membership of new proteins to these functional classes. In this framework, we define the Correspondence Indicators as measures of relationship between sequence and function and further formulate two Bayesian approaches to estimate the probability for a sequence of unknown function to belong to a functional class. This approach allows the parametrisation of different sequence search strategies and provides a direct measure of annotation error rates. We validate this approach with a database of enzymes labelled by their corresponding four-digit EC numbers and analyse specific cases. CONCLUSION: The performance of this method is significantly higher than the simple strategy consisting in transferring the annotation from the highest scoring BLAST match and is expected to find applications in automated functional annotation pipelines.

Algorithms↗

A guide to building image-centric databases.

There is a paucity of image-centric neuroinformatics infrastructure within the individual investigator's laboratory despite the obvious need for automation and integration of experimental results. Yet, solutions can often be readily built using off-the-shelf databases and associated tools. Doing so simplifies day-to-day research operation and increases throughput. Proper construction of in-house solutions may also expedite community-wide integration of private and public data repositories. Here we describe neuroinformatics approaches at different levels of functionality, required expertise, and size of image datasets. The simplest approach offers ease of image browsing and rudimentary searching. More sophisticated systems provide powerful search capabilities, a means of tracking analysis, and even automated serial processing pipelines. In this practicum, we provide guidance in selecting among the different options.

Animals↗

The high-throughput protein-to-structure pipeline at SECSG.

Using a high degree of automation, the crystallography core at the Southeast Collaboratory for Structural Genomics (SECSG) has developed a high-throughput protein-to-structure pipeline. Various robots and automation procedures have been adopted and integrated into a pipeline that is capable of screening 40 proteins for crystallization and solving four protein structures per week. This pipeline is composed of three major units: crystallization, structure determination/validation and crystallomics. Coupled with the protein-production cores at SECSG, the protein-to-structure pipeline provides a two-tiered approach for protein production at SECSG. In tier 1, all protein samples supplied by the protein-production cores pass through the pipeline using standard crystallization screening and optimization procedures. The protein targets that failed to yield diffraction-quality crystals (resolution better than 3.0 A) become tier 2 or salvaging targets. The goal of tier 2 target salvaging, carried out by the crystallomics core, is to produce the target proteins with increased purity and homogeneity, which would render them more likely to yield well diffracting crystals. This is performed by alternative purification procedures and/or the introduction of chemical modifications to the proteins (such as tag removal, methylation, surface mutagenesis, selenomethionine labelling etc.). Details of the various procedures in the pipeline for protein crystallization, target salvaging, data collection/processing and high-throughput structure determination/validation, as well as some examples, are described.

Crystallization↗

PROSPECT-PSPP: an automatic computational pipeline for protein structure prediction.

Knowledge of the detailed structure of a protein is crucial to our understanding of the biological functions of that protein. The gap between the number of solved protein structures and the number of protein sequences continues to widen rapidly in the post-genomics era due to long and expensive processes for solving structures experimentally. Computational prediction of structures from amino acid sequence has come to play a key role in narrowing the gap and has been successful in providing useful information for the biological research community. We have developed a prediction pipeline, PROSPECT-PSPP, an integration of multiple computational tools, for fully automated protein structure prediction. The pipeline consists of tools for (i) preprocessing of protein sequences, which includes signal peptide prediction, protein type prediction (membrane or soluble) and protein domain partition, (ii) secondary structure prediction, (iii) fold recognition and (iv) atomic structural model generation. The centerpiece of the pipeline is our threading-based program PROSPECT. The pipeline is implemented using SOAP (Simple Object Access Protocol), which makes it easier to share our tools and resources. The pipeline has an easy-to-use user interface and is implemented on a 64-node dual processor Linux cluster. It can be used for genome-scale protein structure prediction. The pipeline is accessible at http://csbl.bmb.uga.edu/protein_pipeline.

Computational Biology↗

High-throughput sample handling and data collection at synchrotrons: embedding the ESRF into the high-throughput gene-to-structure pipeline.

An automatic data-collection system has been implemented and installed on seven insertion-device beamlines and a bending-magnet beamline at the ESRF (European Synchrotron Radiation Facility) as part of the SPINE (Structural Proteomics In Europe) development of an automated structure-determination pipeline. The system allows remote interaction with beamline-control systems and automatic sample mounting, alignment, characterization, data collection and processing. Reports of all actions taken are available for inspection via database modules and web services.

Data Collection↗

Automating tissue bank annotation from pathology reports - comparison to a gold standard expert annotation set.

Surgical pathology specimens are an important resource for medical research, particularly for cancer research. Although research studies would benefit from information derived from the surgical pathology reports, access to this information is limited by use of unstructured free-text in the reports. We have previously described a pipeline-based system for automated annotation of surgical pathology reports with UMLS concepts, which has been used to code over 450,000 surgical pathology reports at our institution. In addition to coding UMLS terms, it annotates values of several key variables, such as TNM stage and cancer grade. The object of this study was to evaluate the potential and limitations of automated extraction of these variables, by measuring the performance of the system against a true gold standard - manually encoded data entered by expert tissue annotators. We categorized and analyzed errors to determine the potential and limitations of information extraction from pathology reports for the purpose of automated biospecimen annotation.

Abstracting and Indexing↗

The LONI Pipeline Processing Environment.

The analysis of raw data in neuroimaging has become a computationally entrenched process with many intricate steps run on increasingly larger datasets. Many software packages exist that provide either complete analyses or specific steps in an analysis. These packages often possess diverse input and output requirements, utilize different file formats, run in particular environments, and have limited abilities with certain types of data. The combination of these packages to achieve more sensitive and accurate results has become a common tactic in brain mapping studies but requires much work to ensure valid interoperation between programs. The handling, organization, and storage of intermediate data can prove difficult as well. The LONI Pipeline Processing Environment is a simple, efficient, and distributed computing solution to these problems enabling software inclusion from different laboratories in different environments. It is used here to derive a T1-weighted MRI atlas of the human brain from 452 normal young adult subjects with fully automated processing. The LONI Pipeline Processing Environment's parallel processing efficiency using an integrated client/server dataflow model was 80.9% when running the atlas generation pipeline from a PC client (Acer TravelMate 340T) on 48 dedicated server processors (Silicon Graphics Inc. Origin 3000). The environment was 97.5% efficient when the same analysis was run on eight dedicated processors.

Brain Mapping↗

The SWISS-MODEL Repository of annotated three-dimensional protein structure homology models.

The SWISS-MODEL Repository is a database of annotated three-dimensional comparative protein structure models generated by the fully automated homology-modelling pipeline SWISS-MODEL. The Repository currently contains about 300,000 three-dimensional models for sequences from the Swiss-Prot and TrEMBL databases. The content of the Repository is updated on a regular basis incorporating new sequences, taking advantage of new template structures becoming available and reflecting improvements in the underlying modelling algorithms. Each entry consists of one or more three-dimensional protein models, the superposed template structures, the alignments on which the models are based, a summary of the modelling process and a force field based quality assessment. The SWISS-MODEL Repository can be queried via an interactive website at http://swissmodel.expasy. org/repository/. Annotation and cross-linking of the models with other databases, e.g. Swiss-Prot on the ExPASy server, allow for seamless navigation between protein sequence and structure information. The aim of the SWISS-MODEL Repository is to provide access to an up-to-date collection of annotated three-dimensional protein models generated by automated homology modelling, bridging the gap between sequence and structure databases.

Animals↗

A test of enhancing model accuracy in high-throughput crystallography.

The high throughput of structure determination pipelines relies on increased automation and, consequently, a reduction of time spent on interactive quality control. In order to meet and exceed current standards in model accuracy, new approaches are needed for the facile identification and correction of model errors during refinement. One such approach is provided by the validation and structure-improvement tools of the MOL: PROBITY: web service. To test their effectiveness in high-throughput mode, a large subset of the crystal structures from the SouthEast Collaboratory for Structural Genomics (SECSG) has used protocols based on the MOL: PROBITY: tools. Comparison of 29 working-set and 19 control-set SECSG structures shows that working-set outlier scores for updated Ramachandran-plot, sidechain rotamer, and all-atom steric criteria have been improved by factors of 5- to 10-fold (relative to the control set or to a Protein Data Bank sample), while quality of covalent geometry, R(work), R(free), electron density and difference density are maintained or improved. Some parts of this correction process are already fully automated; other parts involve manual rebuilding of conformations flagged by the tests as trapped in the wrong local minimum, often altering features of functional significance. The ease and effectiveness of this technique shows that macromolecular crystal structures from either traditional or high-throughput determinations can feasibly reach a new level of excellence in conformational accuracy and reliability.

Crystallography, X-Ray↗

Functional annotation of proteomic sequences based on consensus of sequence and structural analysis.

To maximise the assignment of function of the proteins encoded by a genome and to aid the search for novel drug targets, there is an emerging need for sensitive methods of predicting protein function on a genome-wide basis. GeneAtlas is an automated, high-throughput pipeline for the prediction of protein structure and function using sequence similarity detection, homology modelling and fold recognition methods. GeneAtlas is described in detail here. To test GeneAtlas, a 'virtual' genome was used, a subset of PDB structures from the SCOP database, in which the functional relationships are known. GeneAtlas detects additional relationships by building 3D models in comparison with the sequence searching method PSI-BLAST. Functionally related proteins with sequence identity below the twilight zone can be recognised correctly.

Consensus Sequence↗

The CATH domain structure database: new protocols and classification levels give a more comprehensive resource for exploring evolution.

We report the latest release (version 3.0) of the CATH protein domain database (http://www.cathdb.info). There has been a 20% increase in the number of structural domains classified in CATH, up to 86 151 domains. Release 3.0 comprises 1110 fold groups and 2147 homologous superfamilies. To cope with the increases in diverse structural homologues being determined by the structural genomics initiatives, more sensitive methods have been developed for identifying boundaries in multi-domain proteins and for recognising homologues. The CATH classification update is now being driven by an integrated pipeline that links these automated procedures with validation steps, that have been made easier by the provision of information rich web pages summarising comparison scores and relevant links to external sites for each domain being classified. An analysis of the population of domains in the CATH hierarchy and several domain characteristics are presented for version 3.0. We also report an update of the CATH Dictionary of homologous structures (CATH-DHS) which now contains multiple structural alignments, consensus information and functional annotations for 1459 well populated superfamilies in CATH. CATH is directly linked to the Gene3D database which is a projection of CATH structural data onto approximately 2 million sequences in completed genomes and UniProt.

Classification↗

PET-Tool: a software suite for comprehensive processing and managing of Paired-End diTag (PET) sequence data.

BACKGROUND: We recently developed the Paired End diTag (PET) strategy for efficient characterization of mammalian transcriptomes and genomes. The paired end nature of short PET sequences derived from long DNA fragments raised a new set of bioinformatics challenges, including how to extract PETs from raw sequence reads, and correctly yet efficiently map PETs to reference genome sequences. To accommodate and streamline data analysis of the large volume PET sequences generated from each PET experiment, an automated PET data process pipeline is desirable. RESULTS: We designed an integrated computation program package, PET-Tool, to automatically process PET sequences and map them to the genome sequences. The Tool was implemented as a web-based application composed of four modules: the Extractor module for PET extraction; the Examiner module for analytic evaluation of PET sequence quality; the Mapper module for locating PET sequences in the genome sequences; and the Project Manager module for data organization. The performance of PET-Tool was evaluated through the analyses of 2.7 million PET sequences. It was demonstrated that PET-Tool is accurate and efficient in extracting PET sequences and removing artifacts from large volume dataset. Using optimized mapping criteria, over 70% of quality PET sequences were mapped specifically to the genome sequences. With a 2.4 GHz LINUX machine, it takes approximately six hours to process one million PETs from extraction to mapping. CONCLUSION: The speed, accuracy, and comprehensiveness have proved that PET-Tool is an important and useful component in PET experiments, and can be extended to accommodate other related analyses of paired-end sequences. The Tool also provides user-friendly functions for data quality check and system for multi-layer data management.

Animals↗

Implementation and evaluation of a negation tagger in a pipeline-based system for information extract from pathology reports.

We have developed a pipeline-based system for automated annotation of Surgical Pathology Reports with UMLS terms that builds on GATE--an open-source architecture for language engineering. The system includes a module for detecting and annotating negated concepts, which implements the NegEx algorithm--an algorithm originally described for use in discharge summaries and radiology reports. We describe the implementation of the system, and early evaluation of the Negation Tagger. Our results are encouraging. In the key Final Diagnosis section, with almost no modification of the algorithm or phrase lists, the system performs with precision of 0.84 and recall of 0.80 against a gold-standard corpus of negation annotations, created by modified Delphi technique by a panel of pathologists. Further work will focus on refining the Negation Tagger and UMLS Tagger and adding additional processing resources for annotating free-text pathology reports.

Algorithms↗