Description Usage Arguments Value Examples
View source: R/GreedyMotifSearch.R
Given a series of DNA sequences this function will return the most probably motif in each sequence taking into account the other DNA sequences.This uses a 'Greedy" method that is very computationally simple allowing for quick fast results.
1 | GreedyMotifSearch(DNAseqs, k, t, pseudo = FALSE)
|
DNAseqs |
A vector of character strings representing a series of DNA sequences |
k |
An integer Value representing how long of kmer ins interested |
t |
An integer value representing how many of the DNAseqs one wish to incorporate |
pseudo |
A TRUE or FALSE condition, default FALSE. If TRUE will implement pseudo counts which alleviates biases against some single point mutations |
A vector of best scoring Motifs
1 | GreedyMotifSearch(sampleDNAseq,3,4)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.