PubMed Health⌕ Search

PubMed · 16135709

PRECISE: software for prediction of cis-acting regulatory elements.

Abstract

The regulation of gene expression at the transcription initiation level is highly complex and requires the presence of multiple transcription factors. These transcription factors are often proteins or peptides that bind to the so-called cis-acting elements, which are present in the promoter regions and conserved among different species. In order to predict these cis-acting elements, a computer program called PRECISE (Prediction of REgulatory CIS-acting Elements) was developed. The power of the tool lies in its user-friendly interface and in the possibility of using empirical motif frequency tables to filter through the many discovered motifs. The tools to create the empirical motif frequency table (e.g., from a whole genome sequence) are included in the package. In the first case study, the upstream regions of all the genes in the Arabidopsis genome were used to create an empirical motif frequency table and a set of 64 upstream sequences of genes known to be involved in starch metabolism was subjected to analysis by PRECISE. The 20 motifs with the highest specificity in the selected set were analyzed in more detail. Of these 20 motifs, 15 showed a very high or complete homology to the sequences of known cis-acting elements. These cis-acting elements are regulated by light, auxin, and abscisic acid, and confer specific expression in sink organs such as leaves and seeds. All these factors have been shown to play an important role in starch biosynthesis. In the second case study, the upstream regions of 16 genes whose transcription is induced by gibberellins (GA) in Arabidopsis were analyzed with PRECISE and compared to the motifs present in the PLACE database. Among the most promising motifs found by PRECISE were 6 of the 17 known GA motifs. These results indicate the power of the PRECISE software package in the prediction of regulatory elements.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

L M Trindade, R van Berloo, M Fiers, R G F Visser. 2005-08-31. PRECISE: software for prediction of cis-acting regulatory elements.. https://doi.org/10.1093/jhered%2Fesi094

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗