COMPASS: the COMPletely Arbitrary Sequence Simulator.
Ontology highlight
ABSTRACT: Summary
Simulated sequence alignments are frequently used to test bioinformatics tools, but current sequence simulators are limited to defined state spaces. Here, we present the COMPletely Arbitrary Sequence Simulator (COMPASS), which is able to simulate the evolution of absolutely any discrete state space along a tree, for any form of time-reversible model.Availability and implementation
COMPASS is implemented in Python 2.7, and is freely available for all platforms with the Supplementary Information, as well as at http://labs.carleton.ca/eme/software-and-data.Contact
alex_wong@carleton.ca.Supplementary information
Supplementary data are available at Bioinformatics online.
SUBMITTER: Low A
PROVIDER: S-EPMC5870535 | biostudies-literature | 2017 Oct
REPOSITORIES: biostudies-literature
Publications
COMPASS: the COMPletely Arbitrary Sequence Simulator.
Low Andrew A Rodrigue Nicolas N Wong Alex A
Bioinformatics (Oxford, England) 20171001 19
<h4>Summary</h4>Simulated sequence alignments are frequently used to test bioinformatics tools, but current sequence simulators are limited to defined state spaces. Here, we present the COMPletely Arbitrary Sequence Simulator (COMPASS), which is able to simulate the evolution of absolutely any discrete state space along a tree, for any form of time-reversible model.<h4>Availability and implementation</h4>COMPASS is implemented in Python 2.7, and is freely available for all platforms with the Sup ...[more]
Similar Datasets
Project description:BIOLOGY IS ENCODED IN MOLECULAR SEQUENCES: deciphering this encoding remains a grand scientific challenge. Functional regions of DNA, RNA, and protein sequences often exhibit characteristic but subtle motifs; thus, computational discovery of motifs in sequences is a fundamental and much-studied problem. However, most current algorithms do not allow for insertions or deletions (indels) within motifs, and the few that do have other limitations. We present a method, GLAM2 (Gapped Local Alignment of Motifs), for discovering motifs allowing indels in a fully general manner, and a companion method GLAM2SCAN for searching sequence databases using such motifs. glam2 is a generalization of the gapless Gibbs sampling algorithm. It re-discovers variable-width protein motifs from the PROSITE database significantly more accurately than the alternative methods PRATT and SAM-T2K. Furthermore, it usefully refines protein motifs from the ELM database: in some cases, the refined motifs make orders of magnitude fewer overpredictions than the original ELM regular expressions. GLAM2 performs respectably on the BAliBASE multiple alignment benchmark, and may be superior to leading multiple alignment methods for "motif-like" alignments with N- and C-terminal extensions. Finally, we demonstrate the use of GLAM2 to discover protein kinase substrate motifs and a gapped DNA motif for the LIM-only transcriptional regulatory complex: using GLAM2SCAN, we identify promising targets for the latter. GLAM2 is especially promising for short protein motifs, and it should improve our ability to identify the protein cleavage sites, interaction sites, post-translational modification attachment sites, etc., that underlie much of biology. It may be equally useful for arbitrarily gapped motifs in DNA and RNA, although fewer examples of such motifs are known at present. GLAM2 is public domain software, available for download at http://bioinformatics.org.au/glam2.
| S-EPMC2323616 | biostudies-literature
Project description:Summary:Ancient DNA has emerged as a remarkable tool to infer the history of extinct species and past populations. However, many of its characteristics, such as extensive fragmentation, damage and contamination, can influence downstream analyses. To help investigators measure how these could impact their analyses in silico , we have developed gargammel, a package that simulates ancient DNA fragments given a set of known reference genomes. Our package simulates the entire molecular process from post-mortem DNA fragmentation and DNA damage to experimental sequencing errors, and reproduces most common bias observed in ancient DNA datasets. Availability and Implementation:The package is publicly available on github: https://grenaud.github.io/gargammel/ and released under the GPL. Contact:gabriel.renaud@snm.ku.dk. Supplementary information:Supplementary data are available at Bioinformatics online.
| S-EPMC5408798 | biostudies-literature
Project description:Background Simulating DNA evolution has been done through coevolution-agnostic probabilistic frameworks for the past 3 decades. The most common implementation is by using the converse of the probabilistic approach used to infer phylogenies which, in the simplest form, simulates a single sequence at a time. However, biological systems are multi-genic, and gene products can affect each other’s evolutionary paths through coevolution. These crucial evolutionary dynamics still remain to be simulated, and we believe that modelling them can lead to profound insights for comparative genomics. Results Here we present CastNet, a genome evolution simulator that assumes each genome is a collection of genes with constantly evolving regulatory interactions in between them. The regulatory interactions produce a phenotype in the form of gene expression profiles, upon which fitness is calculated. A genetic algorithm is then used to evolve a population of such entities through a user-defined phylogeny. Importantly, the regulatory mutations are a response to sequence mutations, thus making a 1–1 relationship between the rate of evolution of sequences and of regulatory parameters. This is, to our knowledge, the first time the evolution of sequences and regulation have been explicitly linked in a simulation, despite there being a multitude of sequence evolution simulators, and a handful of models to simulate Gene Regulatory Network (GRN) evolution. In our test runs, we see a coevolutionary signal among genes that are active in the GRN, and neutral evolution in genes that are not included in the network, showing that selective pressures imposed on the regulatory output of the genes are reflected in their sequences. Conclusion We believe that CastNet represents a substantial step for developing new tools to study genome evolution, and more broadly, coevolutionary webs and complex evolving systems. This simulator also provides a new framework to study molecular evolution where sequence coevolution has a leading role. Supplementary Information The online version contains supplementary material available at 10.1186/s12859-023-05366-1.
| S-EPMC10259028 | biostudies-literature
Project description:We introduce Grinder (http://sourceforge.net/projects/biogrinder/), an open-source bioinformatic tool to simulate amplicon and shotgun (genomic, metagenomic, transcriptomic and metatranscriptomic) datasets from reference sequences. This is the first tool to simulate amplicon datasets (e.g. 16S rRNA) widely used by microbial ecologists. Grinder can create sequence libraries with a specific community structure, ? and ? diversities and experimental biases (e.g. chimeras, gene copy number variation) for commonly used sequencing platforms. This versatility allows the creation of simple to complex read datasets necessary for hypothesis testing when developing bioinformatic software, benchmarking existing tools or designing sequence-based experiments. Grinder is particularly useful for simulating clinical or environmental microbial communities and complements the use of in vitro mock communities.
| S-EPMC3384353 | biostudies-literature
Project description:BackgroundThere are many programs available for generating simulated whole-genome shotgun sequence reads. The data generated by many of these programs follow predefined models, which limits their use to the authors' original intentions. For example, many models assume that read lengths follow a uniform or normal distribution. Other programs generate models from actual sequencing data, but are limited to reads from single-genome studies. To our knowledge, there are no programs that allow a user to generate simulated data following non-parametric read-length distributions and quality profiles based on empirically-derived information from metagenomics sequencing data.ResultsWe present BEAR (Better Emulation for Artificial Reads), a program that uses a machine-learning approach to generate reads with lengths and quality values that closely match empirically-derived distributions. BEAR can emulate reads from various sequencing platforms, including Illumina, 454, and Ion Torrent. BEAR requires minimal user input, as it automatically determines appropriate parameter settings from user-supplied data. BEAR also uses a unique method for deriving run-specific error rates, and extracts useful statistics from the metagenomic data itself, such as quality-error models. Many existing simulators are specific to a particular sequencing technology; however, BEAR is not restricted in this way. Because of its flexibility, BEAR is particularly useful for emulating the behaviour of technologies like Ion Torrent, for which no dedicated sequencing simulators are currently available. BEAR is also the first metagenomic sequencing simulator program that automates the process of generating abundances, which can be an arduous task.ConclusionsBEAR is useful for evaluating data processing tools in genomics. It has many advantages over existing comparable software, such as generating more realistic reads and being independent of sequencing technology, and has features particularly useful for metagenomics work.
| S-EPMC4168713 | biostudies-literature
Project description:BackgroundThe MinION sequencing instrument from Oxford Nanopore Technologies (ONT) produces long read lengths from single-molecule sequencing - valuable features for detailed genome characterization. To realize the potential of this platform, a number of groups are developing bioinformatics tools tuned for the unique characteristics of its data. We note that these development efforts would benefit from a simulator software, the output of which could be used to benchmark analysis tools.ResultsHere, we introduce NanoSim, a fast and scalable read simulator that captures the technology-specific features of ONT data and allows for adjustments upon improvement of nanopore sequencing technology. The first step of NanoSim is read characterization, which provides a comprehensive alignment-based analysis and generates a set of read profiles serving as the input to the next step, the simulation stage. The simulation stage uses the model built in the previous step to produce in silico reads for a given reference genome. NanoSim is written in Python and R. The source files and manual are available at the Genome Sciences Centre website: http://www.bcgsc.ca/platform/bioinfo/software/nanosim.ConclusionIn this work, we model the base-calling errors of ONT reads to inform the simulation of sequences with similar characteristics. We showcase the performance of NanoSim on publicly available datasets generated using the R7 and R7.3 chemistries and different sequencing kits and compare the resulting synthetic reads to those of other long-sequence simulators and experimental ONT reads. We expect NanoSim to have an enabling role in the field and benefit the development of scalable next-generation sequencing technologies for the long nanopore reads, including genome assembly, mutation detection, and even metagenomic analysis software.
| S-EPMC5530317 | biostudies-literature
Project description:The vast amount of sequence data generated to analyze complex traits is posing new challenges in terms of the analysis and interpretation of the results. Although simulation is a fundamental tool to investigate the reliability of genomic analyses and to optimize experimental design, existing software cannot realistically simulate complete genomes. To remedy this, we have developed a new strategy (Sequence-Based Virtual Breeding, SBVB) that uses real sequence data and simulates new offspring genomes and phenotypes in a very efficient and flexible manner. Using this tool, we studied the efficiency of full sequence in genomic prediction compared to SNP arrays. We used real porcine sequences from three breeds as founder genomes of a 2500-animal pedigree and two genetic architectures: "neutral" and "selective." In the neutral architecture, frequencies and allele effects were sampled independently whereas, in the selective case, SNPs were sites putatively under selection after domestication and a negative correlation between effect and frequency was induced. We compared the effectiveness of different genotyping strategies for genomic selection, including the use of full sequence commercial arrays or randomly chosen SNP sets in both outbred and crossbred experimental designs. We found that accuracy increases using sequence instead of commercial chips but modestly, perhaps by ≤ 4%. This result was robust to extreme genetic architectures. We conclude that full sequence is unlikely to offset commercial arrays for predicting genetic value when the number of loci is relatively large and the prior given to each SNP is uniform. Using sequence to improve selection thus requires optimized prior information and, likely, increased population sizes. The code and manual for SBVB are available at https://github.com/mperezenciso/sbvb0.
| S-EPMC5289861 | biostudies-literature
Project description:Strains of the species Bacillus licheniformis are widely used in biotechnology for the production of enzymes and antibiotics (M. Schallmey, A. Singh, and O. P. Ward, Can. J. Microbiol. 50:1-17, 2004). However, research and application of B. licheniformis strains are adversely affected by poor genetic accessibility. Thus, for a closer inspection of natural competence in B. licheniformis, the genome of strain 9945A, of which derivatives are known to be naturally competent (C. B. Thorne and H. B. Stull, J. Bacteriol. 91:1012-1020, 1966), was completely sequenced and manually annotated.
| S-EPMC3731831 | biostudies-literature
Project description:Magnetic resonance fingerprinting (MRF) is a novel quantitative MR technique that simultaneously provides multiple tissue property maps. When optimizing MRF scans, modeling undersampling errors and field imperfections in cost functions for direct measurement of quantitative errors will make the optimization results more practical and robust. However, optimizing such cost function is computationally expensive and impractical for MRF optimization with tens of thousands of iterations. Here, we introduce a fast MRF simulator to simulate aliased images from actual scan scenarios including undersampling and system imperfections, which substantially reduces computational time and allows for direct error estimation of the quantitative maps and efficient sequence optimization. We evaluate the performance and computational speed of the proposed approach by simulations and in vivo experiments. The simulations from the proposed method closely approximate the signals and MRF maps from in vivo scans, with 158 times shorter processing time than the conventional simulation method using Non-uniform Fourier transform. We also demonstrate the power of applying the fast MRF simulator in MRF sequence optimization. The optimized sequences are validated with in vivo scans to assess the image quality and accuracy. The optimized sequences produce artifact-free T1 and T2 maps in 2D and 3D scans with equivalent mapping accuracy as the human-designed sequence but at shorter scan times. Incorporating the proposed simulator in the MRF optimization framework makes direct estimation of undersampling errors during the optimization process feasible, and provide optimized MRF sequences that are robust against undersampling artifacts and field inhomogeneity.
| S-EPMC10002151 | biostudies-literature
Project description: Not available
| S-EPMC317908 | biostudies-literature