Binding Matrix: A Novel Approach for Binding Site Recognition

Kim, Jan T., Gewehr, Jan E. and Martinetz, Thomas (2004) Binding Matrix: A Novel Approach for Binding Site Recognition. Journal of Bioinformatics and Computational Biology, 2 (2). pp. 289-307. ISSN 0219-7200

Full text not available from this repository.

Abstract

Recognition of protein-DNA binding sites in genomic sequences is a crucial step for discovering biological functions of genomic sequences. Explosive growth in availability of sequence information has resulted in a demand for binding site detection methods with high specificity. The motivation of the work presented here is to address this demand by a systematic approach based on Maximum Likelihood Estimation. A general framework is developed in which a large class of binding site detection methods can be described in a uniform and consistent way. Protein-DNA binding is determined by binding energy, which is an approximately linear function within the space of sequence words. All matrix based binding word detectors can be regarded as different linear classifiers which attempt to estimate the linear separation implied by the binding energy function. The standard approaches of consensus sequences and profile matrices are described using this framework. A maximum likelihood approach for determining this linear separation leads to a novel matrix type, called the binding matrix. The binding matrix is the most specific matrix based classifier which is consistent with the input set of known binding words. It achieves significant improvements in specificity compared to other matrices. This is demonstrated using 95 sets of experimentally determined binding words provided by the TRANSFAC database.

Item Type: Article
Faculty \ School: Faculty of Science > School of Computing Sciences
Depositing User: Vishal Gautam
Date Deposited: 10 Mar 2011 11:11
Last Modified: 21 Apr 2020 20:20
URI: https://ueaeprints.uea.ac.uk/id/eprint/22693
DOI: 10.1142/S0219720004000569

Actions (login required)

View Item View Item