CFP last date
20 December 2024
Reseach Article

A Comparison Study of Transcription Factor– DNA Binding Models

by Sudha Narang
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 27
Year of Publication: 2010
Authors: Sudha Narang
10.5120/500-816

Sudha Narang . A Comparison Study of Transcription Factor– DNA Binding Models. International Journal of Computer Applications. 1, 27 ( February 2010), 42-47. DOI=10.5120/500-816

@article{ 10.5120/500-816,
author = { Sudha Narang },
title = { A Comparison Study of Transcription Factor– DNA Binding Models },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 27 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 42-47 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number27/500-816/ },
doi = { 10.5120/500-816 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:49:05.869438+05:30
%A Sudha Narang
%T A Comparison Study of Transcription Factor– DNA Binding Models
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 27
%P 42-47
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The comparison study is drawn between two widely used motif representations i.e. Positional Weight Matrices (PWM) and Consensus Sequences. In the case of motif finding, where the binding sites are not known a priori but the algorithm must search a large space of possible binding sites, the PWM model may be difficult to learn as the search space is very large even for the PWM of short length (R^N for a PWM of length N, where R is the space of real numbers between 0 to 1). Optimization methods used to search for the best PWM may converge to a local minimum. On the other hand the consensus sequence has a smaller search space (15^N for a motif of length N) which is easier to search for the global optimum.

References
  1. Gary D.Stormo (2000) DNA Binding Sites: Representation and Discovery(vol 16,16-23)
  2. Patrick D’haeseleer : What are DNA sequence motifs
  3. Patrick D’haeseleer: How does DNA sequence motif discovery work?
  4. Kenzie D. Maclsaac, Ernest Fraenkel : Practical strategies for discovering Regulatory DNA sequence motifs.
  5. Jean Michel Claverie and Stephane Audic(1996): The statistical significance of nucleotide PWM(Vol 2 no 5,431-439)
  6. Rodger Staden(1984)- Computer methods to locate signals in nucleic acid sequences
  7. Naum I. Gershenzon, Gary D. Stormo1 and Ilya P. Ioshikhes: Computational technique for improvement of the position-weight matrices for the DNA/protein binding sites.( 2290–2301 Nucleic Acids Research, 2005, Vol. 33, No. 7)
  8. Albin Sandelin, Wynand Alkema, PaÈ r EngstroÈm, Wyeth W. Wasserman1 and Boris Lenhard, JASPAR: an open-access database for eukaryotic transcription factor binding profiles. Nucleic Acids Research, 2004, Vol. 32, Database issue D91±D94
  9. Qing K. Chen1, Gerald Z. Hertz and Gary D. Stormo MATRIX SEARCH 1.0: a computer program that scans DNA sequences for transcriptional elements using a database of weight matrices Vol. 11 no. 5 1999 Pages 563-566
  10. Rodger Staden: Methods for calculating the probabilities of finding patterns in sequences Vol.5, no.2. 1989 Pages 89-96
  11. Tatsuhiko Tsunoda and Toshihisa Takagi. Estimating Transcription factor Bindability on DNA. Vol 15 no’s 7/8 1999 Pages 622-630
  12. William H.E. Day and F.R. Mc Morris : A consensus program for molecular sequences(1992, Vol 9 Pages 653-656)
  13. Regulatory Sequence Analysis Tool(RSAT)
Index Terms

Computer Science
Information Sciences

Keywords

Positional Weight Matrices Consensus Sequences Stroke Width Optimization methods