title: New scoring schema for finding motifs in DNA Sequences.
abstract: BACKGROUND
  Pattern discovery in DNA sequences is one of the most fundamental problems in molecular biology with important applications in finding regulatory signals and transcription factor binding sites. An important task in this problem is to search (or predict) known binding sites in a new DNA sequence. For this reason, all subsequences of the given DNA sequence are scored based on an scoring function and the prediction is done by selecting the best score. By assuming no dependency between binding site base positions, most of the available tools for known binding site prediction are designed. Recently Tomovic and Oakeley investigated the statistical basis for either a claim of dependence or independence, to determine whether such a claim is generally true, and they presented a scoring function for binding site prediction based on the dependency between binding site base positions. Our primary objective is to investigate the scoring functions which can be used in known binding site prediction based on the assumption of dependency or independency in binding site base positions.
  
  
  RESULTS
  We propose a new scoring function based on the dependency between all positions in biding site base positions. This scoring function uses joint information content and mutual information as a measure of dependency between positions in transcription factor binding site. Our method for modeling dependencies is simply an extension of position independency methods. We evaluate our new scoring function on the real data sets extracted from JASPAR and TRANSFAC data bases, and compare the obtained results with two other well known scoring functions.
  
  
  CONCLUSIONS
  The results demonstrate that the new approach improves known binding site discovery and show that the joint information content and mutual information provide a better and more general criterion to investigate the relationships between positions in the TFBS. Our scoring function is formulated by simple mathematical calculations. By implementing our method on several biological data sets, it can be induced that this method performs better than methods that do not consider dependencies.
authors.affiliation: Department of Bioinformatics, Institute of Biochemistry and Biophysics, University of Tehran, Tehran, Iran. zare@ibb.ut.ac.ir
authors.forename: Fatemeh
authors.initials: F
authors.lastname: Zare-Mirakabad
authors.forename: Hayedeh
authors.initials: H
authors.lastname: Ahrabian
authors.forename: Mehdei
authors.initials: M
authors.lastname: Sadeghi
authors.forename: Abbas
authors.initials: A
authors.lastname: Nowzari-Dalini
authors.forename: Bahram
authors.initials: B
authors.lastname: Goliaei
mesh_terms: D001483:Base Sequence; D001665:Binding Sites; D019295:Computational Biology / Q000379:methods*; D004247:DNA / Q000737:chemistry*; D017422:Sequence Analysis, DNA / Q000379:methods*
chemical_list: D004247:DNA