MOTIVATION
Maximum-likelihood methods for solving the consensus sequence identification (CSI) problem on DNA sequences may only find a local optimum rather than the global optimum. Additionally, such methods do not allow logical constraints to be imposed on their models. This study develops a linear programming technique to solve CSI problems by finding an optimum consensus sequence. This method is computationally more efficient and is guaranteed to reach the global optimum. The developed method can also be extended to treat more complicated CSI problems with ambiguous conserved patterns.
RESULTS
A CSI problem is first formulated as a non-linear mixed 0-1 optimization program, which is then converted into a linear mixed 0-1 program. The proposed method provides the following advantages over maximum-likelihood methods: (1) It is guaranteed to find the global optimum. (2) It can embed various logical constraints into the corresponding model. (3) It is applicable to problems with many long sequences. (4) It can find the second and the third best solutions. An extension of the proposed linear mixed 0-1 program is also designed to solve CSI problems with an unknown spacer length between conserved regions. Two examples of searching for CRP-binding sites and for FNR-binding sites in the Escherichia coli genome are used to illustrate and test the proposed method.
AVAILABILITY
A software package, Global Site Seer for the Microsoft Windows operating system is available by http://www.iim.nctu.edu.tw/~cjfu/gss.htm
[1]
G. Stormo,et al.
Identifying protein-binding sites from unaligned DNA fragments.
,
1989,
Proceedings of the National Academy of Sciences of the United States of America.
[2]
Gary D. Stormo,et al.
Identification of consensus patterns in unaligned DNA sequences known to be functionally related
,
1990,
Comput. Appl. Biosci..
[3]
Michael Kupferschmid,et al.
An application of nonlinear optimization in molecular biology
,
2002,
Eur. J. Oper. Res..
[4]
E. Balas,et al.
Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
,
1996
.
[5]
BalasEgon,et al.
Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
,
1996
.
[6]
A. A. Reilly,et al.
An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences
,
1990,
Proteins.
[7]
Gary D. Stormo,et al.
DNA binding sites: representation and discovery
,
2000,
Bioinform..
[8]
Denis Thieffry,et al.
RegulonDB: a database on transcriptional regulation in Escherichia coli
,
1998,
Nucleic Acids Res..
[9]
David R. Gilbert,et al.
Approaches to the Automatic Discovery of Patterns in Biosequences
,
1998,
J. Comput. Biol..
[10]
G D Stormo,et al.
A comparative genomics approach to prediction of new members of regulons.
,
2001,
Genome research.