Dataset Information

RMotifGen: random motif generator for DNA and protein sequences.

ABSTRACT:

Background

Detection of short, subtle conserved motif regions within a set of related DNA or amino acid sequences can lead to discoveries about important regulatory domains such as transcription factor and DNA binding sites as well as conserved protein domains. In order to help assess motif detection algorithms on motifs with varying properties and levels of conservation, we have developed a computational tool, rMotifGen, with the sole purpose of generating a number of random DNA or protein sequences containing short sequence motifs. Each motif consensus can be user-defined, randomly generated, or created from a position-specific scoring matrix (PSSM). Insertions and mutations within these motifs are created according to user-defined parameters and substitution matrices. The resulting sequences can be helpful in mutational simulations and in testing the limits of motif detection algorithms.

Results

Two implementations of rMotifGen have been created, one providing a graphical user interface (GUI) for random motif construction, and the other serving as a command line interface. The second implementation has the added advantages of platform independence and being able to be called in a batch mode. rMotifGen was used to construct sample sets of sequences containing DNA motifs and amino acid motifs that were then tested against the Gibbs sampler and MEME packages.

Conclusion

rMotifGen provides an efficient and convenient method for creating random DNA or amino acid sequences with a variable number of motifs, where the instance of each motif can be incorporated using a position-specific scoring matrix (PSSM) or by creating an instance mutated from its corresponding consensus using an evolutionary model based on substitution matrices. rMotifGen is freely available at: http://bioinformatics.louisville.edu/brg/rMotifGen/.

SUBMITTER: Rouchka EC

PROVIDER: S-EPMC1963340 | biostudies-literature | 2007 Aug

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

rMotifGen: random motif generator for DNA and protein sequences.

Rouchka Eric C EC Hardin C Timothy CT

BMC bioinformatics 20070807

<h4>Background</h4>Detection of short, subtle conserved motif regions within a set of related DNA or amino acid sequences can lead to discoveries about important regulatory domains such as transcription factor and DNA binding sites as well as conserved protein domains. In order to help assess motif detection algorithms on motifs with varying properties and levels of conservation, we have developed a computational tool, rMotifGen, with the sole purpose of generating a number of random DNA or prot ...[more]

PMID: 17683637

Similar Datasets

Project description:BackgroundMotif discovery aims to detect short, highly conserved patterns in a collection of unaligned DNA or protein sequences. Discriminative motif finding algorithms aim to increase the sensitivity and selectivity of motif discovery by utilizing a second set of sequences, and searching only for patterns that can differentiate the two sets of sequences. Potential applications of discriminative motif discovery include discovering transcription factor binding site motifs in ChIP-chip data and finding protein motifs involved in thermal stability using sets of orthologous proteins from thermophilic and mesophilic organisms.ResultsWe describe DEME, a discriminative motif discovery algorithm for use with protein and DNA sequences. Input to DEME is two sets of sequences; a "positive" set and a "negative" set. DEME represents motifs using a probabilistic model, and uses a novel combination of global and local search to find the motif that optimally discriminates between the two sets of sequences. DEME is unique among discriminative motif finders in that it uses an informative Bayesian prior on protein motif columns, allowing it to incorporate prior knowledge of residue characteristics. We also introduce four, synthetic, discriminative motif discovery problems that are designed for evaluating discriminative motif finders in various biologically motivated contexts. We test DEME using these synthetic problems and on two biological problems: finding yeast transcription factor binding motifs in ChIP-chip data, and finding motifs that discriminate between groups of thermophilic and mesophilic orthologous proteins.ConclusionUsing artificial data, we show that DEME is more effective than a non-discriminative approach when there are "decoy" motifs or when a variant of the motif is present in the "negative" sequences. With real data, we show that DEME is as good, but not better than non-discriminative algorithms at discovering yeast transcription factor binding motifs. We also show that DEME can find highly informative thermal-stability protein motifs. Binaries for the stand-alone program DEME is free for academic use and is available at http://bioinformatics.org.au/deme/

Project description:Pseudo-random number generators (PRNGs) are software algorithms generating a sequence of numbers approximating the properties of random numbers. They are critical components in many information systems that require unpredictable and nonarbitrary behaviors, such as parameter configuration in machine learning, gaming, cryptography, and simulation. A PRNG is commonly validated through a statistical test suite, such as NIST SP 800-22rev1a (NIST test suite), to evaluate its robustness and the randomness of the numbers. In this paper, we propose a Wasserstein distance-based generative adversarial network (WGAN) approach to generating PRNGs that fully satisfy the NIST test suite. In this approach, the existing Mersenne Twister (MT) PRNG is learned without implementing any mathematical programming code. We remove the dropout layers from the conventional WGAN network to learn random numbers distributed in the entire feature space because the nearly infinite amount of data can suppress the overfitting problems that occur without dropout layers. We conduct experimental studies to evaluate our learned pseudo-random number generator (LPRNG) by adopting cosine-function-based numbers with poor random number properties according to the NIST test suite as seed numbers. The experimental results show that our LPRNG successfully converted the sequence of seed numbers to random numbers that fully satisfy the NIST test suite. This study opens the way for the "democratization" of PRNGs through the end-to-end learning of conventional PRNGs, which means that PRNGs can be generated without deep mathematical know-how. Such tailor-made PRNGs will effectively enhance the unpredictability and nonarbitrariness of a wide range of information systems, even if the seed numbers can be revealed by reverse engineering. The experimental results also show that overfitting was observed after about 450,000 trials of learning, suggesting that there is an upper limit to the number of learning counts for a fixed-size neural network, even when learning with unlimited data.

Project description:The volume of securely encrypted data transmission increases continuously in modern society with all things connected. Towards this end, true random numbers generated from physical sources are highly required for guaranteeing security of encryption and decryption schemes for exchanging sensitive information. However, majority of true random number generators (TRNGs) are mechanically rigid, and thus cannot be compatibly integrated with some specific flexible platforms. Herein, we present a flexible and stretchable bionic TRNG inspired by the uniqueness and randomness of biological architectures. The flexible TRNG film is molded from the surface microstructures of natural plants (e.g., ginkgo leaf) via a simple, low-cost, and environmentally friendly manufacturing process. In our proof-of-principle experiment, the TRNG exhibits a fast generation speed of up to 1.04 Gbit/s, in which random numbers are fully extracted from laser speckle patterns with a high extraction rate of 72%. Significantly, the resulting random bit streams successfully pass all randomness test suites including NIST, TestU01, and DIEHARDER. Even after 10,000 times cyclic stretching or bending tests, or during temperature shock (-25-80 °C), the bionic TRNG still reveals robust mechanical reliability and thermal stability. Such a flexible TRNG shows a promising potential in information security of emerging flexible networked electronics.Electronic supplementary materialSupplementary material (light path diagram of transmitted laser speckle, pseudo random pattern, statistical distribution of bionic microstructures, haze of the bionic TRNG film, multi-layer circular laser intensity pattern, percentage of bit 0/1 for different hashed images, Pearson correlation coefficient between 100 different speckle images, the whole process of randomness extraction, SEM images of the flexible TRNG film after 10,000 times stretching and bending, continuous work stability of the TRNG at low or high temperature, light path diagram of reflective laser speckle, and detailed randomness test results of NIST, TestU01, and DIEHARDER) is available in the online version of this article at 10.1007/s12274-022-4109-9.