Masking Algorithms In Literature
2
0
Entering edit mode
12.4 years ago
Anima Mundi ★ 2.9k

Hi all,

I would like you to point me out some good articles regarding the use of algorithms to mask low complexity regions in DNA strings. My purpose is to clean up sequences in order to search for putative TFBS (by the way, I an not so sure this is a good idea, but this is another topic), so I also welcome literature about the use of such algorithms in the TFBS search. In particular, I would like you to explain me how did you organize your search in Pubmed et similia, as I failed to find something by my self.

algorithm literature transcription binding • 2.8k views
ADD COMMENT
0
Entering edit mode

I rather thought Repeatmasker was still pretty much the accepted way to do this: http://www.repeatmasker.org/

ADD REPLY
0
Entering edit mode

Anima, I think this "I would like you to explain me how did you organize your search in Pubmed et similia, as I failed to find something by my self." should be a separate question.

ADD REPLY
2
Entering edit mode
12.4 years ago
Gjain 5.8k

Hi,

programs to screen and mask low complexity regions:

  • Repbase: is a collection of repetitive DNA elements broken up along organismal lines
  • RepeatMasker: screens DNA sequences for interspersed repeats and low complexity DNA sequences. It can be used to mask regions of low complexity. It can also be used to identify and mask-out contaminating sequences as well
  • DUST: A fast and symmetric DUST implementation to mask low-complexity DNA sequences.
  • SEG: the protein counterpart for filtering low complexity regions in amino acid sequences

Suggested Reading

This link (DNA Patterns & Motifs) should help you find a right tool for further analysis.

A helpful article: Discovering Sequence Motifs by Timothy L. Bailey

I hope this helps.

ADD COMMENT
1
Entering edit mode
12.4 years ago
Christian ★ 3.0k

I did get some good results with TANTAN: http://nar.oxfordjournals.org/content/early/2010/11/24/nar.gkq1212.full

ADD COMMENT

Login before adding your answer.

Traffic: 2193 users visited in the last hour
Help About
FAQ
Access RSS
API
Stats

Use of this site constitutes acceptance of our User Agreement and Privacy Policy.

Powered by the version 2.3.6