Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “data reproducibility”

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 829 records · Page 46Linked to original sources

Measurement of serum folate by 75Se-selenofolate radioassay. Results of a multi-institutional clinical trial.

The authors report the multi-institutional evaluation of a radioassay for serum folate utilizing a gamma-labeled folate analog (75Se-pteroyl-L-methylselenocysteine). The assay is run as a one-step simultaneous addition at ambient temperature and is completed within 45 minutes. The assay data were reproducible within four study centers and correlated with both the Lactobacillus casei diagnostic groups and the clinical pictures.

Biological Assay↗

A dynamic model of poliomyelitis outbreaks: learning from the past to help inform the future.

Policy-makers now face important questions regarding the tradeoffs among different strategies for managing poliomyelitis risks after they succeed with polio eradication. To estimate the potential consequences of reintroductions of polioviruses and the resulting outbreaks, the authors developed a dynamic disease transmission model that can simulate many aspects of outbreaks for different posteradication conditions. In this paper, the authors identify the issues related to prospective modeling of future outbreaks using such a model, including the reality that accurate prediction of conditions and associated model inputs prior to future outbreaks remains challenging. The authors explored the model's behavior in the context of three recent outbreaks resulting from importation of poliovirus into previously polio-free countries and found that the model reproduced reported data on the incidence of cases. The authors expect that this model can provide important insights into the dynamics of future potential poliomyelitis outbreaks and in this way serve as a useful tool for risk assessment.

Adolescent↗

TranScout: prediction of gene expression regulatory proteins from their sequences.

MOTIVATION: The advent of genomics yields thousands of reading frames in search of function. Identification of conserved functional motifs in protein sequences can be helpful for function prediction. RESULTS: A database and a classification of reported DNA-binding protein motifs has been designed. A program ('TranScout') has been developed for the detection and evaluation of conserved motifs in prokaryotic and eukaryotic sequences of proteins with a gene regulatory function. The efficiency of the program is shown in a benchmark against a database obtained from SWISS-PROT without the protein sequences used to train the program. All motifs were detected with a mean average sensitivity of 0.98 and a mean average specificity of 0.92. AVAILABILITY: The program is freely available for use on the internet at http://luz.uab.es/transcout/. The user can find additional information at this site.

Algorithms↗

The use of structure information to increase alignment accuracy does not aid homologue detection with profile HMMs.

MOTIVATION: The best quality multiple sequence alignments are generally considered to derive from structural superposition. However, no previous work has studied the relative performance of profile hidden Markov models (HMMs) derived from such alignments. Therefore several alignment methods have been used to generate multiple sequence alignments from 348 structurally aligned families in the HOMSTRAD database. The performance of profile HMMs derived from the structural and sequence-based alignments has been assessed for homologue detection. RESULTS: The best alignment methods studied here correctly align nearly 80% of residues with respect to structure alignments. Alignment quality and model sensitivity are found to be dependent on average number, length, and identity of sequences in the alignment. The striking conclusion is that, although structural data may improve the quality of multiple sequence alignments, this does not add to the ability of the derived profile HMMs to find sequence homologues. SUPPLEMENTARY INFORMATION: A list of HOMSTRAD families used in this study and the corresponding Pfam families is available at http://www.sanger.ac.uk/Users/sgj/alignments/map.html CONTACT: sgj@sanger.ac.uk

Amino Acid Sequence↗

Marginalized kernels for biological sequences.

MOTIVATION: Kernel methods such as support vector machines require a kernel function between objects to be defined a priori. Several works have been done to derive kernels from probability distributions, e.g., the Fisher kernel. However, a general methodology to design a kernel is not fully developed. RESULTS: We propose a reasonable way of designing a kernel when objects are generated from latent variable models (e.g., HMM). First of all, a joint kernel is designed for complete data which include both visible and hidden variables. Then a marginalized kernel for visible data is obtained by taking the expectation with respect to hidden variables. We will show that the Fisher kernel is a special case of marginalized kernels, which gives another viewpoint to the Fisher kernel theory. Although our approach can be applied to any object, we particularly derive several marginalized kernels useful for biological sequences (e.g., DNA and proteins). The effectiveness of marginalized kernels is illustrated in the task of classifying bacterial gyrase subunit B (gyrB) amino acid sequences.

Algorithms↗

Amaranth: enhanced single-cell transcript assembly via discriminative modelling of UMI reads and internal reads.

MOTIVATION: Single-cell RNA sequencing (scRNA-seq) has transformed transcriptome profiling at cellular resolution, yet accurate reconstruction of full-length transcripts for individual cells remains a central challenge. Emerging scRNA-seq protocols can produce reads that span entire transcripts, enabling isoform-level expression analysis. For example, Smart-seq protocols combine unique molecular identifier (UMI)-linked reads that index and stitch together multiple reads from the same molecule, with internal reads filling coverage gaps. We demonstrate that these read types exhibit markedly different biological and statistical properties in strandness, 5'/3' coverage bias, and genomic locality. Existing assemblers fail to leverage these distinctions, yielding suboptimal assembly. RESULTS: We developed Amaranth, a novel single-cell assembler that discriminatively models UMI and internal reads. Amaranth implements heuristics specifically designed to address the distinct biases of UMI-linked and internal reads, enabling accurate strandness assignment for internal reads, reliable splicing graph refinement, and precise transcript start site determination. We also developed Amaranth-meta, which integrates information across cells to enhance individual cell assemblies. Benchmarked on Smart-seq3 datasets from human HEK293T and mouse fibroblast cells, Amaranth outperformed other state-of-the-art assemblers in assembling individual cells and in meta-assembly. Amaranth advances isoform-level analysis in single-cell transcriptomics, facilitating detailed studies at cellular resolution. AVAILABILITY AND IMPLEMENTATION: Amaranth is implemented in C++ and is freely available at https://github.com/Shao-Group/amaranth under the BSD-3-Clause license. Scripts, documentation, and data for reproducing experiments in this manuscript are available at https://github.com/Shao-Group/amaranth-test.

Single-Cell Gene Expression Analysis↗

Greedy mixture learning for multiple motif discovery in biological sequences.

MOTIVATION: This paper studies the problem of discovering subsequences, known as motifs, that are common to a given collection of related biosequences, by proposing a greedy algorithm for learning a mixture of motifs model through likelihood maximization. The approach adds sequentially a new motif to a mixture model by performing a combined scheme of global and local search for appropriately initializing its parameters. In addition, a hierarchical partitioning scheme based on kd-trees is presented for partitioning the input dataset in order to speed-up the global searching procedure. The proposed method compares favorably over the well-known MEME approach and treats successfully several drawbacks of MEME. RESULTS: Experimental results indicate that the algorithm is advantageous in identifying larger groups of motifs characteristic of biological families with significant conservation. In addition, it offers better diagnostic capabilities by building more powerful statistical motif-models with improved classification accuracy.

Algorithms↗

Probabilistic scoring measures for profile-profile comparison yield more accurate short seed alignments.

MOTIVATION: The development of powerful automatic methods for the comparison of protein sequences has become increasingly important. Profile-to-profile comparisons allow for the use of broader information about protein families, resulting in more sensitive and accurate comparisons of distantly related sequences. A key part in the comparison of two profiles is the method for the calculation of scores for the position matches. A number of methods based on various theoretical considerations have been proposed. We implemented several previously reported scoring functions as well as our own functions, and compared them on the basis of their ability to produce accurate short ungapped alignments of a given length. RESULTS: Our results suggest that the family of the probabilistic methods (log-odds based methods and prof_sim) may be the more appropriate choice for the generation of initial 'seeds' as the first step to produce local profile-profile alignments. The most effective scoring systems were the closely related modifications of functions previously implemented in the COMPASS and Picasso methods.

Algorithms↗

TM or not TM: transmembrane protein prediction with low false positive rate using DAS-TMfilter.

UNLABELLED: Web-based servers implementing the DAS-TMfilter algorithm have been launched at three mirror sites and their usage is described. The underlying computer program is an upgraded and modified version of the DAS-prediction method. The new server is (approximately 1 among 100 unrelated queries) while the high efficiency of the original algorithm locating TM segments in queries is preserved (sensitivity of approximately 95% among documented proteins with helical TM regions). AVAILABILITY: The server operates at three mirror sites: http://mendel.imp.univie.ac.at/sat/DAS/DAS.html, http://wooster.bip.bham.ac.uk/DAS.html and http://www.enzim.hu/DAS/DAS.html. The program is available on request.

Algorithms↗

STAM: simple transmembrane alignment method.

MOTIVATION: The database of transmembrane protein (TMP) structures is still very small. At the same time, more and more TMP sequences are being determined. Molecular modeling is an interim answer that may bridge the gap between the two databases. The first step in homology modeling is to achieve a good alignment between the target sequences and the template structure. However, since most algorithms to obtain the alignments were constructed with data derived from globular proteins, they perform poorly when applied to TMPs. In our application, we automate the alignment procedure and design it specifically for TMP. We first identify segments likely to form transmembrane alpha-helices. We then apply different sets of criteria for transmembrane and non-transmembrane segments. For example, the penalty for insertion/deletions in the transmembrane segments is much higher than that of a penalty in the loop region. Different substitution matrices are used since the frequencies of occurrence of the various amino acids differ for transmembrane segments and water-soluble domains. RESULTS: This program leads to better models since it does not treat the protein as a single entity with the same properties, but accounts for the different physical properties of the various segments. STAM is the first multisequence alignment program that is directly targeted at transmembrane proteins. AVAILABILITY: Source code and installation package are available on request from the authors. Web access is currently implemented.

Algorithms↗

An evaluation of new criteria for CpG islands in the human genome as gene markers.

MOTIVATION: Recently, more stringent criteria for CpG islands have been introduced to exclude Alu repeats, thereby enabling a higher proportion of CpG islands associating with genes to be identified. Using these new criteria, several types of associations between CpG islands and genes were investigated to further establish the importance of CpG islands as gene markers. RESULTS: The CpG islands were searched by CpGIE, a java software program developed for CpG island identification. CpGIE was advanced in identification accuracy compared with other tools. According to our results, about 70% of the identified CpG islands were associating with the human genes and over half of them are in the promoters. Furthermore, the investigation of genes in the confirmed gene model showed that 56% of them had a CpG island overlapping the transcription start sites. In comparison, the new criteria were found capable of filtering a large fraction of Alu repeats that was identified as CpG islands by the generally accepted criteria within the genes, but very few CpG islands associating with the promoters were affected. The genes in the predicted gene model were not obviously associated with CpG islands, suggesting that CpG islands can be used to evaluate the accuracy of gene annotation. AVAILABILITY: http://bioinfo.hku.hk/cpgieintro

Algorithms↗

A comparison of scoring functions for protein sequence profile alignment.

MOTIVATION: In recent years, several methods have been proposed for aligning two protein sequence profiles, with reported improvements in alignment accuracy and homolog discrimination versus sequence-sequence methods (e.g. BLAST) and profile-sequence methods (e.g. PSI-BLAST). Profile-profile alignment is also the iterated step in progressive multiple sequence alignment algorithms such as CLUSTALW. However, little is known about the relative performance of different profile-profile scoring functions. In this work, we evaluate the alignment accuracy of 23 different profile-profile scoring functions by comparing alignments of 488 pairs of sequences with identity < or =30% against structural alignments. We optimize parameters for all scoring functions on the same training set and use profiles of alignments from both PSI-BLAST and SAM-T99. Structural alignments are constructed from a consensus between the FSSP database and CE structural aligner. We compare the results with sequence-sequence and sequence-profile methods, including BLAST and PSI-BLAST. RESULTS: We find that profile-profile alignment gives an average improvement over our test set of typically 2-3% over profile-sequence alignment and approximately 40% over sequence-sequence alignment. No statistically significant difference is seen in the relative performance of most of the scoring functions tested. Significantly better results are obtained with profiles constructed from SAM-T99 alignments than from PSI-BLAST alignments. AVAILABILITY: Source code, reference alignments and more detailed results are freely available at http://phylogenomics.berkeley.edu/profilealignment/

Algorithms↗

COACH: profile-profile alignment of protein families using hidden Markov models.

MOTIVATION: Alignments of two multiple-sequence alignments, or statistical models of such alignments (profiles), have important applications in computational biology. The increased amount of information in a profile versus a single sequence can lead to more accurate alignments and more sensitive homolog detection in database searches. Several profile-profile alignment methods have been proposed and have been shown to improve sensitivity and alignment quality compared with sequence-sequence methods (such as BLAST) and profile-sequence methods (e.g. PSI-BLAST). Here we present a new approach to profile-profile alignment we call Comparison of Alignments by Constructing Hidden Markov Models (HMMs) (COACH). COACH aligns two multiple sequence alignments by constructing a profile HMM from one alignment and aligning the other to that HMM. RESULTS: We compare the alignment accuracy of COACH with two recently published methods: Yona and Levitt's prof_sim and Sadreyev and Grishin's COMPASS. On two sets of reference alignments selected from the FSSP database, we find that COACH is able, on average, to produce alignments giving the best coverage or the fewest errors, depending on the chosen parameter settings. AVAILABILITY: COACH is freely available from www.drive5.com/lobster

Algorithms↗

Probabilistic nucleotide assembling method for sequencing by hybridization.

MOTIVATION: Developing a new method of assembling small sequences based on sequencing by hybridization with many positive and negative faults. First, an interpretation of a generic traveling salesman problem is provided (i.e. finding the shortest route for visiting many cities), using genetic algorithms. Second, positive errors are excluded before assembly by a sanitization process. RESULTS: The present method outperforms those described in previous studies, in terms of both time and accuracy. AVAILABILITY: http://kamit.med.u-tokai.ac.jp/~takaho/sbh/index.html

Algorithms↗

A memory-efficient algorithm for multiple sequence alignment with constraints.

MOTIVATION: Recently, the concept of the constrained sequence alignment was proposed to incorporate the knowledge of biologists about structures/functionalities/consensuses of their datasets into sequence alignment such that the user-specified residues/nucleotides are aligned together in the computed alignment. The currently developed programs use the so-called progressive approach to efficiently obtain a constrained alignment of several sequences. However, the kernels of these programs, the dynamic programming algorithms for computing an optimal constrained alignment between two sequences, run in (gamman2) memory, where gamma is the number of the constraints and n is the maximum of the lengths of sequences. As a result, such a high memory requirement limits the overall programs to align short sequences only. RESULTS: We adopt the divide-and-conquer approach to design a memory-efficient algorithm for computing an optimal constrained alignment between two sequences, which greatly reduces the memory requirement of the dynamic programming approaches at the expense of a small constant factor in CPU time. This new algorithm consumes only O(alphan) space, where alpha is the sum of the lengths of constraints and usually alpha << n in practical applications. Based on this algorithm, we have developed a memory-efficient tool for multiple sequence alignment with constraints. AVAILABILITY: http://genome.life.nctu.edu.tw/MUSICME.

Algorithms↗

Statistical modeling of sequencing errors in SAGE libraries.

MOTIVATION: Sequencing errors may bias the gene expression measurements made by Serial Analysis of Gene Expression (SAGE). They may introduce non-existent tags at low abundance and decrease the real abundance of other tags. These effects are increased in the longer tags generated in LongSAGE libraries. Current sequencing technology generates quite accurate estimates of sequencing error rates. Here we make use of the sequence neighborhood of SAGE tags and error estimates from the base-calling software to correct for such errors. RESULTS: We introduce a statistical model for the propagation of sequencing errors in SAGE and suggest an Expectation-Maximization (EM) algorithm to correct for them given observed sequences in a library and base-calling error estimates. We tested our method using simulated and experimental SAGE libraries. When comparing SAGE libraries, we found that sequencing errors can introduce considerable bias. High abundance tags may be falsely called as significantly differentially expressed, especially when comparing libraries with different levels of sequencing errors and/or of different size. Truly, differentially expressed tags have decreased significance as 'true'-tag counts are generally underestimated. This may alter if tags near the threshold of differential expression are called significant. Moreover, the number of different transcripts present in a library is overestimated as false tags are introduced at low abundance. Our correction method adjusts the tag counts to be closer to the true counts and is able to partly correct for biases introduced by sequencing errors. AVAILABILITY: An implementation using R is distributed as an R package. An online version is available at http://tagcalling.mbgproject.org

Algorithms↗

AgentCell: a digital single-cell assay for bacterial chemotaxis.

MOTIVATION: In recent years, single-cell biology has focused on the relationship between the stochastic nature of molecular interactions and variability of cellular behavior. To describe this relationship, it is necessary to develop new computational approaches at the single-cell level. RESULTS: We have developed AgentCell, a model using agent-based technology to study the relationship between stochastic intracellular processes and behavior of individual cells. As a test-bed for our approach we use bacterial chemotaxis, one of the best characterized biological systems. In this model, each bacterium is an agent equipped with its own chemotaxis network, motors and flagella. Swimming cells are free to move in a 3D environment. Digital chemotaxis assays reproduce experimental data obtained from both single cells and bacterial populations.

Algorithms↗

A precise and scalable method for querying genes in chromosomal banding regions based on cytogenetic annotations.

MOTIVATION: Staining the human metaphase chromosomes reveals characteristic banding patterns known as cytogenetic bands or cytobands. Using technologies based on metaphase chromosomes, researchers have accumulated much knowledge about the correlations between human diseases and specific cytoband aberrations, indicating the presence of disease-associated genes in those bands. With the progress of human genome project and techniques such as fluorescent in situ hybridization, many genes have been assigned to the cytobands and annotated in public databases, making it possible to find all genes in the disease-related cytobands through database queries. However, finding genes in cytobands remains an imprecise process, partly due to the insufficiency of current methods for cytoband queries, especially for those based on cytogenetic annotations. RESULTS: By transforming the cytoband annotations into numerical segments, a new query method is developed that is able to accurately define any cytogenetic ranges in human chromosomes. A query system (designated cytoband query sys CQS) is implemented using cytogenetic annotations in the public domain. Judged by a performance test, CQS executed as accurately as expected using cytogenetic annotations from NCBI Map Viewer. The new method is scalable and can be applied to genomes from other species. AVAILABILITY: The CQS is freely accessible over the Internet at http://moris.csie.ncku.edu.tw/cqs/ CONTACT: clh9@mail.ncku.edu.tw SUPPLEMENTARY INFORMATION: http://moris.csie.ncku.edu.tw/cqs/

Algorithms↗