Microcomputer programs for DNA sequence analysis.

Computer programs are described which allow (a) analysis of DNA sequences to be performed on a laboratory microcomputer or (b) transfer of DNA sequences between a laboratory microcomputer and another computer system, such as a DNA library. The sequence analysis programs are interactive, do not require prior experience with computers and in many other respects resemble programs which have been written for larger computer systems (1-7). The user enters sequence data into a text file, accesses this file with the programs, and is then able to (a) search for restriction enzyme sites or other specified sequences, (b) translate in one or more reading frames in one or both directions in order to find open reading frames, or (c) determine codon usage in the sequence in one or more given reading frames. The results are given in table format and a restriction map is generated. The modem program permits collection of large amounts of data from a sequence library into a permanent file on the microcomputer disc system, or transfer of laboratory data in the reverse direction to a remote computer system.     

Computer programs for the assembly of DNA sequences.

A collection of user-interactive computer programs is described which aid in the assembly of DNA sequences. This is achieved by searching for the positions of overlapping common nucleotide sequences within the blocks of sequence obtained as primary data. Such overlapping segments are then melded into one continuous string of nucleotides. Strategies for determining the accuracy of the sequence being analyzed and reducing the error rate resulting from the manual manipulation of sequence data are discussed. Sequences mapping from 97.3 to 100% of the Ad2 virus genome were used to demonstrate the performance of these programs.     

Computer programs for nucleic acid sequence manipulation

Computer programs are described which help during the collection and analysis of nucleic acid sequence data. They are written in FORTRAN and have been implemented on a PDP 11/60 computer.     

Identification of the gene whose mutation leads to the appearance of recessive lethal germlings in Arabidopsis thaliana

The data are presented on genetic and molecular-genetic analysis of a mutant from the collection of morphological insertion mutants of Arabidopsis thaliana we obtained earlier, which belongs to the phenotypic class of recessive lethal germlings. A nucleotide DNA sequence, 147 bp in size, was identified, which adheres to the left border area of T-DNA insertion. The site of localization of the insertion was determined using computer analysis.     

A general database for DNA sequence changes induced by mutagenesis of several bacterial and mammalian genes.

This electronic database is a collection of 225 sets of data on mutations in more than twenty-three thousand mutants (October, 1995) in eleven bacterial genes, five mammalian genes and one gene in yeast cells. Each dataset consists of the changes in DNA sequence in the mutants, typically tens to hundreds, induced by mutagenesis of a particular cell line under specific conditions. The database is available on the Internet and on diskettes, and is periodically updated. Researchers are invited to submit additional data. A data entry program, MUTSIN, is available that diagrams each mutation on the computer screen as entered and alerts the user to any inconsistency between the entry and the wild type gene sequence.     

GeneRecords: a relational database for GenBank flat file parsing and data manipulation in personal computers

Extracting the desired data from a database entry for later analysis is a constant need in the biological sequence analysis community; GeneRecords 1.0 is a solution for GenBank biological flat file parsing, as it implements a structured representation of each feature and feature qualifier in GenBank following import in a common database managing system usable in a personal computer (Macintosh and Windows environments). This collection of related databases enables the local management of GenBank records, allowing indexing, retrieval and analysis of both information and sequences on a personal computer. AVAILABILITY: The current release, including the FileMaker Pro runtime application (built for Windows and Macintosh environments), is freely available at http://apollo11.isto.unibo.it/software/     

Murray James Barrett, dental anthropologist: Yuendumu and beyond

Murray James Barrett (1916-1975) graduated from the University of Adelaide's Bachelor of Dental Surgery programme in 1939 and subsequently became a colleague of Professor Thomas Draper Campbell (1893-1967). Campbell's passion for dental anthropology and his special interest in food habits and dental disease inspired Barrett to commence a longitudinal growth study in the 1960s of Aboriginal Australians living at Yuendumu in the Northern Territory of Australia. This study, referred to as the Dentgro project, involved the collection of dental records, growth data and cultural information about the Wailbri people.Murray Barrett's application of computer technology enabled him to automate the entry of data derived from the Dentgro study and to develop programmes to analyse those data. The collection of dental casts (over 1700 serial casts for more than 450 individuals) and other records have provided a unique resource for research and teaching purposes. The casts have been in constant use for over 40 years providing insights into many aspects of dental development, including: the timing and sequence of tooth emergence; the nature and extent of variation in dental crown size and morphology in human populations; the patterns of growth in the dental arches over time; the range of occlusal variation between individuals; and the effects of wear on the dentition. The Yuendumu cast collection, representing a population with limited exposure to European customs and dietary habits, continues to attract the Adelaide School of Dentistry many interstate and overseas researchers interested in genetic and environmental influences on human dental development.     

The metabolic pathway collection from EMP: the enzymes and metabolic pathways database.

The Enzymes and Metabolic Pathways database (EMP) is an encoding of the contents of over 10 000 original publications on the topics of enzymology and metabolism. This large body of information has been transformed into a queryable database. An extraction of over 1800 pictorial representations of metabolic pathways from this collection is freely available on the World Wide Web. We believe that this collection will play an important role in the interpretation of genetic sequence data, as well as offering a meaningful framework for the integration of many other forms of biological data.     

酶祖先序列重建与定向进化

酶祖先序列重建是指通过计算机算法推导来自灭绝生物的祖先酶的氨基酸序列的技术。通常可分为6个步骤,依次为现代酶的核酸/氨基酸序列收集、多序列比对、系统发育树构建、祖先酶序列的计算机推测、基因克隆、酶学性质表征。该方法广泛应用于研究分子在行星时间尺度上对环境条件不断变化的适应性和进化机制。随着酶在生物催化领域中扮演越来越重要的角色,该方法逐渐成为研究酶序列、结构和功能关系的有力手段。同时,祖先酶大多具有温度稳定性、突变稳定性等特性,使其成为进一步定向进化的理想蛋白质支架。文中综述了酶祖先序列重建的计算机算法、应用和常用计算机软件,并结合最新研究进展,展望其在酶定向进化领域中的应用前景。     

DNA binding sites: representation and discovery

The purpose of this article is to provide a brief history of the development and application of computer algorithms for the analysis and prediction of DNA binding sites. This problem can be conveniently divided into two subproblems. The first is, given a collection of known binding sites, develop a representation of those sites that can be used to search new sequences and reliably predict where additional binding sites occur. The second is, given a set of sequences known to contain binding sites for a common factor, but not knowing where the sites are, discover the location of the sites in each sequence and a representation for the specificity of the protein.     

TRiFLe, a Program for In Silico Terminal Restriction Fragment Length Polymorphism Analysis with User-Defined Sequence Sets

We describe TRiFLe, a freely accessible computer program that generates theoretical terminal restriction fragments (T-RFs) from any user-supplied sequence set tailored to a particular group of organisms, sequences from clone libraries, or sequences from specific genes. The program allows a rapid identification of the most polymorphic enzymes, creates a collection of T-RFs for the data set, and can potentially identify specific T-RFs in T-RF length polymorphism (T-RFLP) patterns by comparing theoretical and experimental results. TRiFLE was used for analyzing T-RFLP data generated for the amoA and pmoA genes. The peaks identified in the T-RFLP patterns show an overlap of ammonia- and methane-oxidizing bacteria in the metalimnion of a subtropical lake.     

Improvements to a program for DNA analysis: a procedure to find homologies among many sequences

We have devised an algorithm for finding partial homologies among a set of nucleotide sequences. The algorithm and other improvements have been incorporated into a commonly used computer program for the analysis of sequence data.     

Optimal data collection for correlated mutation analysis

The main objective of correlated mutation analysis (CMA) is to predict intraprotein residue-residue interactions from sequence alone. Despite considerable progress in algorithms and computer capabilities, the performance of CMA methods remains quite low. Here we examine whether, and to what extent, the quality of CMA methods depends on the sequences that are included in the multiple sequence alignment (MSA). The results revealed a strong correlation between the number of homologs in an MSA and CMA prediction strength. Furthermore, many of the current methods include only orthologs in the MSA, we found that it is beneficial to include both orthologs and paralogs in the MSA. Remarkably, even remote homologs contribute to the improved accuracy. Based on our findings we put forward an automated data collection procedure, with a minimal coverage of 50% between the query protein and its orthologs and paralogs. This procedure improves accuracy even in the absence of manual curation. In this era of massive sequencing and exploding sequence data, our results suggest that correlated mutation-based methods have not reached their inherent performance limitations and that the role of CMA in structural biology is far from being fulfilled.     

Identification of the Gene Whose Mutation Leads to the Appearance of Recessive Lethal Germlings in <Emphasis Type="Italic">Arabidopsis thaliana</Emphasis>

The data are presented on genetic and molecular-genetic analysis of a mutant from the collection of morphological insertion mutants of Arabidopsis thaliana we obtained earlier, which belongs to the phenotypic class of recessive lethal germlings. A nucleotide DNA sequence, 147 bp in size, was identified, which adheres to the left border area of T-DNA insertion. The site of localization of the insertion was determined using computer analysis.__________Translated from Ontogenez, Vol. 36, No. 3, 2005, pp. 222–224.Original Russian Text Copyright © 2005 by Ogarkova, Tomilov, Tomilova, Tarasov.     

PseqIP: a nonredundant and exhaustive protein sequence data bank generated from 4 major existing collections

Four major protein sequence data collections (NBRF-PIR, PSD-Kyoto, PGtrans, and NEWAT) have been merged into a single nonredundant data bank called PseqIP. The data bank entries were automatically matched by a heuristic computer program relying on the fast computation of the number of tetrapeptides shared by two sequences. PseqIP 1.0 includes 6,068 different protein sequences for a total of 1,357,067 residues, representing most of the available sequence information to date. During the course of this work, we found about 600 occurrences of a protein sequence recorded with a one-amino-acid variation in at least two different data banks. A flat file (ASCII computer-readable format) version of PseqIP 1.0, well-suited for exhaustive homology searches and statistical sequence analysis, is available from our laboratory.     

Getting a grip on proteomics data – Proteomics Data Collection (ProDaC)

In proteomics, rapid developments in instrumentation led to the acquisition of increasingly large data sets. Correspondingly, ProDaC was founded in 2006 as a Coordination Action project within the 6th European Union Framework Programme to support data sharing and community‐wide data collection. The objectives of ProDaC were the development of documentation and storage standards, setup of a standardized data submission pipeline and collection of data. Ending in March 2009, ProDaC has delivered a comprehensive toolbox of standards and computer programs to achieve these goals.     

Tests for the statistical significance of protein sequence similarities in data-bank searches

A suite of tests to evaluate the statistical significance of protein sequence similarities is developed for use in data bank searches. The tests are based on the Wilbur-Lipman word-search algorithm, and take into account the sequence lengths and compositions, and optionally the weighting of amino acid matches. The method is extended to allow for the existence of a sequence insertion/deletion within the region of similarity. The accuracy of statistical distributions underlying the tests is validated using randomly generated sequences and real sequences selected at random from the data banks. A computer program to perform the tests is briefly described.     

Automated analysis of NMR assignments and structures for proteins.

Recent developments in protein NMR technology have provided spectral data that are highly amenable to analysis by advanced computer software systems. Specific data collection strategies, coupled with these computer programs, allow automated analysis of extensive backbone and sidechain resonance assignments and three-dimensional structures for proteins of 50 to 200 amino acids.