The SMotif algorithm is designed to allow to search for words in chromosomes, accepting ambiguities. The user must include a sequence in which ambiguous nucleotides, if present, are included within square brackets (e. g. AC[ACT]G). Ns, indicating any nucleotide, are also accepted. The program generates two files, one with the frequency of each word among those that are included in the regular expression used and a second one with the positions of each word in the analyzed DNA sequence.
|
This analysis can take a few seconds
|
Copyright © 20011 uvwordweb.uv.es
| | | | |