CA2415787A1 - Method for determining three-dimensional protein structure from primary protein sequence - Google Patents
Method for determining three-dimensional protein structure from primary protein sequence Download PDFInfo
- Publication number
- CA2415787A1 CA2415787A1 CA002415787A CA2415787A CA2415787A1 CA 2415787 A1 CA2415787 A1 CA 2415787A1 CA 002415787 A CA002415787 A CA 002415787A CA 2415787 A CA2415787 A CA 2415787A CA 2415787 A1 CA2415787 A1 CA 2415787A1
- Authority
- CA
- Canada
- Prior art keywords
- sequence
- alignment
- query
- determining
- gap
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01N—INVESTIGATING OR ANALYSING MATERIALS BY DETERMINING THEIR CHEMICAL OR PHYSICAL PROPERTIES
- G01N31/00—Investigating or analysing non-biological materials by the use of the chemical methods specified in the subgroup; Apparatus specially adapted for such methods
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16B—BIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY
- G16B15/00—ICT specially adapted for analysing two-dimensional or three-dimensional molecular structures, e.g. structural or functional relations or structure alignment
- G16B15/20—Protein or domain folding
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16B—BIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY
- G16B30/00—ICT specially adapted for sequence analysis involving nucleotides or amino acids
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16B—BIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY
- G16B30/00—ICT specially adapted for sequence analysis involving nucleotides or amino acids
- G16B30/10—Sequence alignment; Homology search
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16B—BIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY
- G16B15/00—ICT specially adapted for analysing two-dimensional or three-dimensional molecular structures, e.g. structural or functional relations or structure alignment
Abstract
A preferred embodiment of the invention is a method for determining a preferred sequence alignment between a query sequence and one or more template sequences comprising the steps of: 1) aligning at least two reference sequences to determine one or more BRIDGE/BULGE gaps; 2) determining an alignment score between each potential alignment of the query sequence and each template sequence based on whether or not a given sequence alignment between the query sequence and each template sequence creates a BRIDGE/BULGE
gap and 3) determining a preferred sequence alignment based on the alignment scores of the query sequence with each template sequence.
gap and 3) determining a preferred sequence alignment based on the alignment scores of the query sequence with each template sequence.
Description
DESCRIPTION
METHOD FOR DETERMINING THREE-DIMENSIONAL PROTEIN
STRUCTURE FROM PRIMARY PROTEIN SEQUENCE
FIELD OF THE INVENTION
The invention relates to the field of computational methods for determining protein homology relationships.
BACKGROUND
While the sequencing of the human genome is a landmark achievement in genomics, it also creates the next great challenge, namely to create an accurate structural model of each protein coded by the human genome. Since the experimental determination of all of the protein structures coded would require decades, computational methods for determining three-dimensional protein structures are essential if structural genomics is going to rapidly progress. S. K. Burley, S. C. Ahno, J. B. Bonann.o et al., Nature c~Jeh.23,151-157 (1999). This reference and all other references cited herein are incorporated by reference.
Proteins are linear polymers of amino acids. Naturally occurring proteins may contain as many as 20 different types of amino acid residues, each of which contains a distinctive side chain. The particular linear sequence of amino acid residues in a protein define the primary sequence, or primary structure, of the protein. The primary structure of a protein can be determined with relative ease using known methods.
Proteins fold into a three-dimensional structure. The folding is determined by the sequence of amino acids and by the protein's environment. Examination of the three-dimensional structure of numerous natural proteins has revealed a number of recurring patterns. Patterns known as alpha helices, parallel beta sheets, and anti-parallel beta sheets are commonly observed. A description of these common structural patterns is provided by Dickerson, R. E., et al. in The Structure and Action of Proteins, W. A.
Benjamin, Inc.
California (1969). The assignment of each amino acid residue to one of these patterns defines the secondary structure of the protein.
The biological properties of a protein depend directly on its three-dimensional (3D) conformation. The 3D conformation determines the activity of enzymes, the capacity and specificity of binding proteins, and the structural attributes of receptor molecules.
Because the three-dimensional structure of a protein molecule is so significant, it has long been recognized that a means for easily determining a protein's three-dimensional structure from its known amino acid sequence would be highly desirable. However, it has proven extremely difficult to make such a determination without experimental data.
In the past, the three-dimensional structures of proteins have been determined using a number of different experimental methods. Perhaps the recognized methods of determining protein structure involves the use of the technique of x-ray crystallography. A
general review of this technique can be found in Physical Bio-chemistry, Van Iiolde, I~. E.
(Prentice-Hall, New Jersey 1971), pp. 221-239, or in Physical Chemistry with Applications to the Life Sciences, D. Eisenberg & D. C. Crothers (Benjamin Cummings, Menlo Park 1979). Using this technique, it is possible to elucidate three-dimensional structure with precision. Additionally, protein structure may be determined through the use of neutron diffraction techniques, or by nuclear magnetic resonance (NMR).
See, e.g., Physical Chemistry, ~th Ed. Moore, W. J. (Prentice-Hall, New Jersey 1972) and NMR of Proteins and Nucleic Acids, I~. Wutr~rich (Wiley-Interscience, New York 1986).
These experimental techniques all suffer from at least one significant shortcoming.
Namely, they are labor intensive and therefore slow and expensive. Modern sequencing techniques are creating rapidly growing databases of primary sequences that need to be translated into three dimensional protein structures. Indeed, with more than 500 genomes including the human genome fully sequenced, three dimensional structures have only been determined for about 2% of these sequences. Every day the ratio of predicted-three dimensional structures to primary sequences is getting smaller.
In order to more rapidly predict three dimensional structures from primary sequences, biochemists are turning to various computational approaches that permit structure determination to be done with computers and software rather than laborious and intricate laboratory techniques. One of the most promising of these computational approaches compares the similarity of a primary sequence for which the three dimensional structure of the sequence is sought, referred to throughout as a query sequence or a query peptide against one or more primary sequences, usually a database of such sequences, referred to throughout as template sequences or template peptides, for which the three dimensional structures are known. This is one aspect of primary sequence homology modeling.
METHOD FOR DETERMINING THREE-DIMENSIONAL PROTEIN
STRUCTURE FROM PRIMARY PROTEIN SEQUENCE
FIELD OF THE INVENTION
The invention relates to the field of computational methods for determining protein homology relationships.
BACKGROUND
While the sequencing of the human genome is a landmark achievement in genomics, it also creates the next great challenge, namely to create an accurate structural model of each protein coded by the human genome. Since the experimental determination of all of the protein structures coded would require decades, computational methods for determining three-dimensional protein structures are essential if structural genomics is going to rapidly progress. S. K. Burley, S. C. Ahno, J. B. Bonann.o et al., Nature c~Jeh.23,151-157 (1999). This reference and all other references cited herein are incorporated by reference.
Proteins are linear polymers of amino acids. Naturally occurring proteins may contain as many as 20 different types of amino acid residues, each of which contains a distinctive side chain. The particular linear sequence of amino acid residues in a protein define the primary sequence, or primary structure, of the protein. The primary structure of a protein can be determined with relative ease using known methods.
Proteins fold into a three-dimensional structure. The folding is determined by the sequence of amino acids and by the protein's environment. Examination of the three-dimensional structure of numerous natural proteins has revealed a number of recurring patterns. Patterns known as alpha helices, parallel beta sheets, and anti-parallel beta sheets are commonly observed. A description of these common structural patterns is provided by Dickerson, R. E., et al. in The Structure and Action of Proteins, W. A.
Benjamin, Inc.
California (1969). The assignment of each amino acid residue to one of these patterns defines the secondary structure of the protein.
The biological properties of a protein depend directly on its three-dimensional (3D) conformation. The 3D conformation determines the activity of enzymes, the capacity and specificity of binding proteins, and the structural attributes of receptor molecules.
Because the three-dimensional structure of a protein molecule is so significant, it has long been recognized that a means for easily determining a protein's three-dimensional structure from its known amino acid sequence would be highly desirable. However, it has proven extremely difficult to make such a determination without experimental data.
In the past, the three-dimensional structures of proteins have been determined using a number of different experimental methods. Perhaps the recognized methods of determining protein structure involves the use of the technique of x-ray crystallography. A
general review of this technique can be found in Physical Bio-chemistry, Van Iiolde, I~. E.
(Prentice-Hall, New Jersey 1971), pp. 221-239, or in Physical Chemistry with Applications to the Life Sciences, D. Eisenberg & D. C. Crothers (Benjamin Cummings, Menlo Park 1979). Using this technique, it is possible to elucidate three-dimensional structure with precision. Additionally, protein structure may be determined through the use of neutron diffraction techniques, or by nuclear magnetic resonance (NMR).
See, e.g., Physical Chemistry, ~th Ed. Moore, W. J. (Prentice-Hall, New Jersey 1972) and NMR of Proteins and Nucleic Acids, I~. Wutr~rich (Wiley-Interscience, New York 1986).
These experimental techniques all suffer from at least one significant shortcoming.
Namely, they are labor intensive and therefore slow and expensive. Modern sequencing techniques are creating rapidly growing databases of primary sequences that need to be translated into three dimensional protein structures. Indeed, with more than 500 genomes including the human genome fully sequenced, three dimensional structures have only been determined for about 2% of these sequences. Every day the ratio of predicted-three dimensional structures to primary sequences is getting smaller.
In order to more rapidly predict three dimensional structures from primary sequences, biochemists are turning to various computational approaches that permit structure determination to be done with computers and software rather than laborious and intricate laboratory techniques. One of the most promising of these computational approaches compares the similarity of a primary sequence for which the three dimensional structure of the sequence is sought, referred to throughout as a query sequence or a query peptide against one or more primary sequences, usually a database of such sequences, referred to throughout as template sequences or template peptides, for which the three dimensional structures are known. This is one aspect of primary sequence homology modeling.
At a high level, many primary sequence homology modeling methods can be characterized in two steps. In the first step, referred to as the alignment step, the query sequence for which the three dimensional structure is sought, is aligned against one or more template sequences, contained in a database. The three dimensional structures for each of the template sequences are known in whole or in substantial part.
After each alignment comparison between the query peptide and a template peptide, the method gives a score. After each comparison has been made in the database, the highest scoring alignment pair reflects the optimally aligned query sequence/template sequence(s). The optimal sequence alignment may be used to generate the most accurate structural determinations regarding the query sequence. Still, a query/template alignment producing a sub-optimal score may be used to generate useful structural information regarding the query sequence.
In the second step, referred to as the modeling step, structural information of the query peptide may be predicted based upon structural information corresponding to the I S sequence or subsequences aligned in the template sequence. The most common of primary sequence homology methods use sequence homologies to predict the three dimensional structure of a query sequence based on the three dimensional structure of aligned template sequences. Still,other primary sequence homology modeling techniques seek to determine primary sequence homology relationships between one or more query sequences based on the primary sequences of aligned template sequences.
The present invention relates to an improved method of performing the first step, namely, an improved method of determining an optimal alignment between a query sequence and a template sequence.
Current, state-of the-art primary sequence homology modeling techniques such as MODELLER, A. Sali and T. L. Blundell, J. Mol. Biol. 234, 779-815 (1993) require at least 30-40% sequence identity between a query peptide and a template peptide to generate an accurate three dimensional structure. R. Sanchez and A. Sali, Proc. Natl.
Acad. Sci.
USA 95, 13597-13602 (1998). With current state-of the-art methods, less than 20% of the soluble protein residues coded in the Brewer's Yeast genome can be assigned a confident structural model. Id.
MODELLER employs a dynamic programming approach to determining a preferred alignment between a query sequence and a template sequence is typical of the many dynamic programming approaches in the art of sequence alignment. This sequence alignment is then used by MODELLER to construct a three dimensional structure of the query sequence.
Dynamic programming methodologies have been used fox determining sequence homologies since they were first introduced by Needleman and Wunsch. S. B.
Needleman and C. D. Wunsch, J. Mol. Biol 48., 443-453 (1970); T. F. Smith, M. S.
Waterman, Adv.
Appl. Math., 2, 482-489 (1981); [M. Gribskov, A. D. McLachlan, and D.
Eisenberg, Proc.
Natl. Acad. Sci. U.S.A., 84, 4355 (1987); M. Gribskov, M. Homyak, J.
Edenfield, and D.
Eisenberg, CABIOS 4, (1988); M. Gribskov, D. Eisenberg, Techniques in Protein Chemistry (T. E. Hugli, ed.), p. 108. Academic Press, San Diego, Calif., 1989;
M.
Gribskov, R. Luthy, and D. Eisenberg, Meth. in Enz. 183; 146 (1990)]. In a general sense, the dynamic programming approaches to determine sequence alignment comprise:
(1) creating a matrix composed of the similarity scores for when each pair of residues in the two sequences are matched (a sum matrix), and (2) determining the optimal alignment between the two sequences via .constructing a sum matrix using dynamic programming.
ldumerous variations to detect protein sequence similarity based on 'the Needlernan-~JVunsch dynamic programming paradigm have been developed. .
In the original Needleman-Wunsch work, only the residue identities between the two proteins were considered in the creation of the sum matrix. More contemporary methods employ a residue substitution scoring system such as point-accepted mutation (PAM) matrices, "A Model of Evolutionary Change in Proteins" in M. O. Dayhoff Ed.
Atlas of Protein Sequence and Structure Vol. 5, Suppl. 3, pp. 345-352, 1979, or BLOSUM
matrices, S. Henikoff and J. G. Henikoff, Proc. Natl. Acad. Sci. LISA 89, (1992), to generate an alignment sum matrix. Additional information that may used to create an alignment score matrix, include the information from multiple sequence alignments, residue environment profiles (so-called profile threading techniques), secondary structure predictions, and solvent accessibility predictions, to name just a few.
S. F. Altschul, T. L. Madden, A. A. Schaffer et al., Nucl. Acids Res. 25, 3389-3402 (1997);
J. U. Bowie, R. Luthy and D. Eisenberg, Science 253, 164-170 (1991); B. Rost, R.
Schneider and C. Sander, J. Mol. Biol. 270, 471-480 (1997).
While they employed a very simple sum matrix, the fundamental contribution made by the Needleman-Wunsch work was the application of dynamic programming to determine the optimal global alignment between the two proteins for a given scoring and gap hiearchies (gaps are indicated by residues that are not aligned to another residue in the final alignment, and here "global" means matching the entirety of one sequence and all possible prefixes against substrings of the other). More contemporary approaches have been developed, but they typically involve finding the optimal global, local or global-local alignment path through a sum matrix calculated from the similarity scores in conjunction 5 with gap scores for residues that are not aligned to another residue. D.
Fischer and D.
Eisenberg, Protein Sci. 5, 947-955 (1996). T. F. Smith and M. S.
Waterman,"Identification of Common Molecular Subsequences," J. Molecular Biology, 147, pp. 195-197, 1981, solved the local alignment problem by introducing a "zero trick":
if an entry of the dynamic programming table is negative, then the optimal local alignment cannot go through this entry because the first part would lower the score; one may therefore replace it with zero, in effect cutting off the prefixes. (This simple trick is known in the computer science art as the maximum subvector method.) O. Gotoh, in "An Improved Algorithm for Matching Biological Sequences," J. Molecular Biology, 162, pp.
705-708, 1982, then showed that affine gap penalty (separate costs for number and Lengths o.f gaps) is about as efficiently solved as is a linear gap penalty. The identification of multiple, similar segments was achieved by M. S. Waterman and M. Eggert in "A
New Algorithm for Best Subsequence Alignments With Application to tRNA-rRNA
Comparison," J. Molecular Biology, 197, pp. 723-728, 1987).
While 1VIODELLER uses a standard dynamic programming procedure to perform an alignment, MODELLER employs various enhancements to improve the final alignment. First, consensus alignments are determined by performing dynamic programming many times using different gap penalties. Second, gap penalties are altered based on the environment of the particular gap, for example, whether or not the gap is located within a template secondary structure (high penalization) or loop region (mild penalization). Even with these additional techniques, MODELLER typically requires at least 30% homology to obtain an alignment of sufficient quality to produce an accurate structural model for a query protein sequence. Another limitation of such homology modeling approaches is that for long loop regions not present in template structures, it is often necessary to use unreliable ab initio or database search methods for modeling such loop regions. Because of these limitations in current homology modeling techniques, there exists a need for improved protein structure prediction methods.
In addition to primary sequence homology modeling programs for predicting three dimensional protein structures such as MODELLER, primary sequence homology modeling programs such as PSI BLAST and HMM also employ sequence alignment methods and consequently have the same limitations as primary sequence homology modeling programs used for predicting three dimensional structures. S. F.
Altschul, T. L.
Madden, A. A. Schaffer et al., Nucl. Acids Res. 25, 3389-3402 (1997); K.
I~arplus, C.
Barrett and R. Hughey, Bioihfo~matics 14, 846-856 (1998). The current alignment approaches in PSI BLAST and HMM can reliably determine family homologies are structural relationships between a query sequence and a template sequence if there is at least a 30% sequence homology. This is insufficient for. many family homology determinations. Divergent evolution causes many proteins in the same structural family to have less than 30% sequence identity, S. A. Teichmann, C. Chothia, and M.
Gerstein, Curs. Opin. St~uct. Biol. 9, 390-399 (1999), and there are many proteins with sequence identities well below 20% that have very similar structures. Tt is estimated that nearly two-thirds of the proteins in the protein databank that are believed to not have any structural homologues do in fact have structural homologues. S. E. Brenner, C.
.Chothia, and T. Hubbard, Curr. Opin. Struct. Biol 7, 369-376 (1997). If these structural homologies and family relationships are to be determined, a sequence alignment method that is accurate at lower levels of sequence homologies is required.
Accordingly, one object of this invention is an improved method of primary sequence homology modeling that is effective with less than 30% sequence homologies.
Unlike sequence comparison methods that do not incorporate any structural information in their similarity determinations, the methods according to this invention utilize information from multiple reference sequence alignments with experimentally determined structures to dramatically increase the alignment accuracy between a test sequence and comparison sequence. This increased alignment accuracy greatly enhances the detection of distantly related structural homologues over the state of the art sequence comparison methods and permits accurate structural models to be created for sequences with far less than 30%
sequence identity to a sequence of known structure.
As in other alignment methods, the methods for determining a preferred alignment according to the present invention, compare the protein sequence of interest (the query sequence) to a database of comparison sequences or template sequences of known structure in an attempt to recognize a sequence similarity and subsequently construct the structure of the query sequence. However, untlike all previous alignment methods, in the methods according to the invention, a database of reference sequences is pre-analyzed to determine the location of alignment gaps, referred to throughout as bridges and bulges, within each of the templates. In the preferred embodiment, the bridge and bulge information is extracted from multiple sequence alignments between all or substantially alI
of the reference sequences in a protein structure database (e.g., the Protein Data Bank (PDB)). The database of reference sequences used to determine the bridges/bulges may contain the same sequences as the database of template sequences used for determining a preferred sequence alignment. Methods for determining a pair-wise structure alignment between two protein structures are known to one of skill in the art and include, for example, the Dali method developed by Holm and Sander. Holm, L. and Sander, C.
J.
Mol. Biol. 233: 123-138 (1993); Holm, L. and Sander, C., Science, 273, 595-602 (1996).
The methods according to the invention use the bridge and bulge information to determine an alignment score between the potential alignment sequences of a query sequence and a template sequence. These alignment scores may then be computed between a query sequence and a plurality of template sequences to determine an optimal alignment between a query sequence and a plurality of template sequences.
The alignments generated by methods according to the invention may be used in combination with well-known techniques for assembling a three-dimensional structure from a sequence alignment. One preferred embodiment uses the alignment methods according to the invention to generate a prefexTed sequence alignment and then uses the comparative modeling package MODELLER, A. Sali and T. L. Blundell, 234 J. Mol.
Biol., 779-815 (1993) to generate a predicted three dimensional structure for a query sequence based on this preferred sequence alignment. MODELLER can be understood as combining two methods: 1) first MODELLER determines a preferred sequence alignment of a query sequence to one or more template sequences in a database of template sequences with known three dimensional structures; and 2) next, MODELLER
constructs a three dimensional structure of the query sequence based on the input from step 1.
Accordingly, the preferred methods of the invention may be used in lieu of MODELLER's sequence alignment methods and in combination with its methods for three dimensional structure construction for an improved combination method for predicting three dimensional structure of a query sequence based homology modeling.
After each alignment comparison between the query peptide and a template peptide, the method gives a score. After each comparison has been made in the database, the highest scoring alignment pair reflects the optimally aligned query sequence/template sequence(s). The optimal sequence alignment may be used to generate the most accurate structural determinations regarding the query sequence. Still, a query/template alignment producing a sub-optimal score may be used to generate useful structural information regarding the query sequence.
In the second step, referred to as the modeling step, structural information of the query peptide may be predicted based upon structural information corresponding to the I S sequence or subsequences aligned in the template sequence. The most common of primary sequence homology methods use sequence homologies to predict the three dimensional structure of a query sequence based on the three dimensional structure of aligned template sequences. Still,other primary sequence homology modeling techniques seek to determine primary sequence homology relationships between one or more query sequences based on the primary sequences of aligned template sequences.
The present invention relates to an improved method of performing the first step, namely, an improved method of determining an optimal alignment between a query sequence and a template sequence.
Current, state-of the-art primary sequence homology modeling techniques such as MODELLER, A. Sali and T. L. Blundell, J. Mol. Biol. 234, 779-815 (1993) require at least 30-40% sequence identity between a query peptide and a template peptide to generate an accurate three dimensional structure. R. Sanchez and A. Sali, Proc. Natl.
Acad. Sci.
USA 95, 13597-13602 (1998). With current state-of the-art methods, less than 20% of the soluble protein residues coded in the Brewer's Yeast genome can be assigned a confident structural model. Id.
MODELLER employs a dynamic programming approach to determining a preferred alignment between a query sequence and a template sequence is typical of the many dynamic programming approaches in the art of sequence alignment. This sequence alignment is then used by MODELLER to construct a three dimensional structure of the query sequence.
Dynamic programming methodologies have been used fox determining sequence homologies since they were first introduced by Needleman and Wunsch. S. B.
Needleman and C. D. Wunsch, J. Mol. Biol 48., 443-453 (1970); T. F. Smith, M. S.
Waterman, Adv.
Appl. Math., 2, 482-489 (1981); [M. Gribskov, A. D. McLachlan, and D.
Eisenberg, Proc.
Natl. Acad. Sci. U.S.A., 84, 4355 (1987); M. Gribskov, M. Homyak, J.
Edenfield, and D.
Eisenberg, CABIOS 4, (1988); M. Gribskov, D. Eisenberg, Techniques in Protein Chemistry (T. E. Hugli, ed.), p. 108. Academic Press, San Diego, Calif., 1989;
M.
Gribskov, R. Luthy, and D. Eisenberg, Meth. in Enz. 183; 146 (1990)]. In a general sense, the dynamic programming approaches to determine sequence alignment comprise:
(1) creating a matrix composed of the similarity scores for when each pair of residues in the two sequences are matched (a sum matrix), and (2) determining the optimal alignment between the two sequences via .constructing a sum matrix using dynamic programming.
ldumerous variations to detect protein sequence similarity based on 'the Needlernan-~JVunsch dynamic programming paradigm have been developed. .
In the original Needleman-Wunsch work, only the residue identities between the two proteins were considered in the creation of the sum matrix. More contemporary methods employ a residue substitution scoring system such as point-accepted mutation (PAM) matrices, "A Model of Evolutionary Change in Proteins" in M. O. Dayhoff Ed.
Atlas of Protein Sequence and Structure Vol. 5, Suppl. 3, pp. 345-352, 1979, or BLOSUM
matrices, S. Henikoff and J. G. Henikoff, Proc. Natl. Acad. Sci. LISA 89, (1992), to generate an alignment sum matrix. Additional information that may used to create an alignment score matrix, include the information from multiple sequence alignments, residue environment profiles (so-called profile threading techniques), secondary structure predictions, and solvent accessibility predictions, to name just a few.
S. F. Altschul, T. L. Madden, A. A. Schaffer et al., Nucl. Acids Res. 25, 3389-3402 (1997);
J. U. Bowie, R. Luthy and D. Eisenberg, Science 253, 164-170 (1991); B. Rost, R.
Schneider and C. Sander, J. Mol. Biol. 270, 471-480 (1997).
While they employed a very simple sum matrix, the fundamental contribution made by the Needleman-Wunsch work was the application of dynamic programming to determine the optimal global alignment between the two proteins for a given scoring and gap hiearchies (gaps are indicated by residues that are not aligned to another residue in the final alignment, and here "global" means matching the entirety of one sequence and all possible prefixes against substrings of the other). More contemporary approaches have been developed, but they typically involve finding the optimal global, local or global-local alignment path through a sum matrix calculated from the similarity scores in conjunction 5 with gap scores for residues that are not aligned to another residue. D.
Fischer and D.
Eisenberg, Protein Sci. 5, 947-955 (1996). T. F. Smith and M. S.
Waterman,"Identification of Common Molecular Subsequences," J. Molecular Biology, 147, pp. 195-197, 1981, solved the local alignment problem by introducing a "zero trick":
if an entry of the dynamic programming table is negative, then the optimal local alignment cannot go through this entry because the first part would lower the score; one may therefore replace it with zero, in effect cutting off the prefixes. (This simple trick is known in the computer science art as the maximum subvector method.) O. Gotoh, in "An Improved Algorithm for Matching Biological Sequences," J. Molecular Biology, 162, pp.
705-708, 1982, then showed that affine gap penalty (separate costs for number and Lengths o.f gaps) is about as efficiently solved as is a linear gap penalty. The identification of multiple, similar segments was achieved by M. S. Waterman and M. Eggert in "A
New Algorithm for Best Subsequence Alignments With Application to tRNA-rRNA
Comparison," J. Molecular Biology, 197, pp. 723-728, 1987).
While 1VIODELLER uses a standard dynamic programming procedure to perform an alignment, MODELLER employs various enhancements to improve the final alignment. First, consensus alignments are determined by performing dynamic programming many times using different gap penalties. Second, gap penalties are altered based on the environment of the particular gap, for example, whether or not the gap is located within a template secondary structure (high penalization) or loop region (mild penalization). Even with these additional techniques, MODELLER typically requires at least 30% homology to obtain an alignment of sufficient quality to produce an accurate structural model for a query protein sequence. Another limitation of such homology modeling approaches is that for long loop regions not present in template structures, it is often necessary to use unreliable ab initio or database search methods for modeling such loop regions. Because of these limitations in current homology modeling techniques, there exists a need for improved protein structure prediction methods.
In addition to primary sequence homology modeling programs for predicting three dimensional protein structures such as MODELLER, primary sequence homology modeling programs such as PSI BLAST and HMM also employ sequence alignment methods and consequently have the same limitations as primary sequence homology modeling programs used for predicting three dimensional structures. S. F.
Altschul, T. L.
Madden, A. A. Schaffer et al., Nucl. Acids Res. 25, 3389-3402 (1997); K.
I~arplus, C.
Barrett and R. Hughey, Bioihfo~matics 14, 846-856 (1998). The current alignment approaches in PSI BLAST and HMM can reliably determine family homologies are structural relationships between a query sequence and a template sequence if there is at least a 30% sequence homology. This is insufficient for. many family homology determinations. Divergent evolution causes many proteins in the same structural family to have less than 30% sequence identity, S. A. Teichmann, C. Chothia, and M.
Gerstein, Curs. Opin. St~uct. Biol. 9, 390-399 (1999), and there are many proteins with sequence identities well below 20% that have very similar structures. Tt is estimated that nearly two-thirds of the proteins in the protein databank that are believed to not have any structural homologues do in fact have structural homologues. S. E. Brenner, C.
.Chothia, and T. Hubbard, Curr. Opin. Struct. Biol 7, 369-376 (1997). If these structural homologies and family relationships are to be determined, a sequence alignment method that is accurate at lower levels of sequence homologies is required.
Accordingly, one object of this invention is an improved method of primary sequence homology modeling that is effective with less than 30% sequence homologies.
Unlike sequence comparison methods that do not incorporate any structural information in their similarity determinations, the methods according to this invention utilize information from multiple reference sequence alignments with experimentally determined structures to dramatically increase the alignment accuracy between a test sequence and comparison sequence. This increased alignment accuracy greatly enhances the detection of distantly related structural homologues over the state of the art sequence comparison methods and permits accurate structural models to be created for sequences with far less than 30%
sequence identity to a sequence of known structure.
As in other alignment methods, the methods for determining a preferred alignment according to the present invention, compare the protein sequence of interest (the query sequence) to a database of comparison sequences or template sequences of known structure in an attempt to recognize a sequence similarity and subsequently construct the structure of the query sequence. However, untlike all previous alignment methods, in the methods according to the invention, a database of reference sequences is pre-analyzed to determine the location of alignment gaps, referred to throughout as bridges and bulges, within each of the templates. In the preferred embodiment, the bridge and bulge information is extracted from multiple sequence alignments between all or substantially alI
of the reference sequences in a protein structure database (e.g., the Protein Data Bank (PDB)). The database of reference sequences used to determine the bridges/bulges may contain the same sequences as the database of template sequences used for determining a preferred sequence alignment. Methods for determining a pair-wise structure alignment between two protein structures are known to one of skill in the art and include, for example, the Dali method developed by Holm and Sander. Holm, L. and Sander, C.
J.
Mol. Biol. 233: 123-138 (1993); Holm, L. and Sander, C., Science, 273, 595-602 (1996).
The methods according to the invention use the bridge and bulge information to determine an alignment score between the potential alignment sequences of a query sequence and a template sequence. These alignment scores may then be computed between a query sequence and a plurality of template sequences to determine an optimal alignment between a query sequence and a plurality of template sequences.
The alignments generated by methods according to the invention may be used in combination with well-known techniques for assembling a three-dimensional structure from a sequence alignment. One preferred embodiment uses the alignment methods according to the invention to generate a prefexTed sequence alignment and then uses the comparative modeling package MODELLER, A. Sali and T. L. Blundell, 234 J. Mol.
Biol., 779-815 (1993) to generate a predicted three dimensional structure for a query sequence based on this preferred sequence alignment. MODELLER can be understood as combining two methods: 1) first MODELLER determines a preferred sequence alignment of a query sequence to one or more template sequences in a database of template sequences with known three dimensional structures; and 2) next, MODELLER
constructs a three dimensional structure of the query sequence based on the input from step 1.
Accordingly, the preferred methods of the invention may be used in lieu of MODELLER's sequence alignment methods and in combination with its methods for three dimensional structure construction for an improved combination method for predicting three dimensional structure of a query sequence based homology modeling.
BRIEF DESCRIPTION OF THE TABLES AND FIGURES
Figure 1 shows the seven homology sequences found to the query sequence:
LVAFADFG-SVTFTNAEATSGGSTVGPSDATVMDIEQDGSVLTETSVSGDS-VTV
by the program clustal W.
Figure 2 represents a similarity matrix which may be formed from the sequence alignment of the two text strings "BIGTOWNSOWN" and "BIGBROWNTOWNOWN."
Figure 3 . represents a partially completed sum matrix formed from the similarity matrix in Figure 2 according to the current state-of the-art sequence alignment methods.
Figure 4 represents the sum matrix of Figure 3 at a further stage of completion.
Figure 5 shows the amount of the GAP penalties that contributed to the gray cells of Figure 4.
Figure 6 represents a completed sum matrix for the sequence alignment of the two text strings "BIGTOWNSOWN" and "BIGBROWNTOWNOWN" according to the state-of the-art current sequence alignment methods.
Figure 7 represents the highest scoring alignment from Figure 6 in the PIR
format.
Figure 8 represents schematically the required input data for the methods according to the invention.
Figure 9 represents a hypothetical BRIDGE/BULGE set for the text strings "BIGTOWNSOWN" and "BIGBROWNTOWNOWN."
Figure 10 represents the allowed alignment gaps for the text strings "BIGTOWNSOWN" and "BIGBROWNTOWNOWN" based on the BRIDGE/BULGE set in Figure 9.
Figure 11 represents a partially completed sum matrix formed from the similarity matrix in Figure 2 according to the methods of the current invention.
Figure 12 represents the sum matrix of Figure 11 at a later stage of completion.
Figure 13 shows the amount the gap penalties contributed to the gray cells of Figure 12.
Figure 14 represents a completed sum matrix for the sequence alignment of the two text strings "BIGTOWNSOWN" and "BIGBROWNTOWNOWN" according to the methods of the invention.
Figure 15 represents the highest scoring alignment from Figure 14 in the PIR
format.
Figure 1 shows the seven homology sequences found to the query sequence:
LVAFADFG-SVTFTNAEATSGGSTVGPSDATVMDIEQDGSVLTETSVSGDS-VTV
by the program clustal W.
Figure 2 represents a similarity matrix which may be formed from the sequence alignment of the two text strings "BIGTOWNSOWN" and "BIGBROWNTOWNOWN."
Figure 3 . represents a partially completed sum matrix formed from the similarity matrix in Figure 2 according to the current state-of the-art sequence alignment methods.
Figure 4 represents the sum matrix of Figure 3 at a further stage of completion.
Figure 5 shows the amount of the GAP penalties that contributed to the gray cells of Figure 4.
Figure 6 represents a completed sum matrix for the sequence alignment of the two text strings "BIGTOWNSOWN" and "BIGBROWNTOWNOWN" according to the state-of the-art current sequence alignment methods.
Figure 7 represents the highest scoring alignment from Figure 6 in the PIR
format.
Figure 8 represents schematically the required input data for the methods according to the invention.
Figure 9 represents a hypothetical BRIDGE/BULGE set for the text strings "BIGTOWNSOWN" and "BIGBROWNTOWNOWN."
Figure 10 represents the allowed alignment gaps for the text strings "BIGTOWNSOWN" and "BIGBROWNTOWNOWN" based on the BRIDGE/BULGE set in Figure 9.
Figure 11 represents a partially completed sum matrix formed from the similarity matrix in Figure 2 according to the methods of the current invention.
Figure 12 represents the sum matrix of Figure 11 at a later stage of completion.
Figure 13 shows the amount the gap penalties contributed to the gray cells of Figure 12.
Figure 14 represents a completed sum matrix for the sequence alignment of the two text strings "BIGTOWNSOWN" and "BIGBROWNTOWNOWN" according to the methods of the invention.
Figure 15 represents the highest scoring alignment from Figure 14 in the PIR
format.
Figure 16 represents the ribbon structure for MG001 as generated by the methods according to the invention.
Figure 17 represents the optimal sequence alignment between 8C001 and lb4kA in PIR format as determined by the methods according to the invention.
Figure 18 shows the crystal structure of laws on the left and the structure of on the right as predicted by the methods according to the invention.
Figure 19 shows a space filling representation of chain A from 1 dkf co-crystalized with oleic acid.
Figure 20 shows the PIR alignment of ldkf (denoted as gi7766906) and the sequence of chain A of structure 1 a28 according to the methods of the invention.
Figure 2I shows a rainbow ribbon overlay between the predicted structure and the crystal structure of chain A of 1 dkf.
Figure 22 shows an overlay of the predicted structure according to the methods of the invention ldkf and the crystal structure for 22 key residues that form the oleic acid binding pocket.
Figure 23 shows a stick diagram of 1 a252 (PDB code) co-crystallized with estradiol. The estradiol ligands are shown in space filling format.
Figure 24 shows the alignment according to the methods of the invention in PIR
format between the sequence of the estrogen receptor (denoted as gi3659931) and the sequence of chain A of structure 1a28, denoted 1a28A.
Figure 25 shows a rainbow ribbon overlay between the predicted structure according to the methods of the invention of the estrogen receptor and the crystal structure of chain A of 1 a52.
Figure 26 shows an overlay of the predicted structure according to the methods of the invention for estrogen receptor and the crystal structure for 19 key residues that form the ~estradiol binding pocket.
Figure 27 shows the alignment formed from the methods of the invention in PIR
format between the sequence of halorhodopsin, denoted 1e12A, and the sequence of bacteriorhodopsin, denoted lc3wA made by the methods according to the invention.
Figure 28 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in figure 27, compared to the halorhodopsin crystal structure, chain A of PDB code 1 a 12.
Figure 29 shows the alignment, formed from the methods according to the invention, in PIR format, between the sequence of bacteriorhodopsin, denoted lc3wA, and the sequence of rhodposin, chain A of PDB structure 1f88, denoted 1f88A.
Figure 30 shows a rainbow ribbon overlay between the three-dimensional structure 5 created using the alignment in Figure 29, compared to the bacteriorhodopsin crystal structure, chain A of PDB code 1 caw.
Figure 31 shows the alignment, formed from the methods according to the invention, in PIR format, between the sequence of a membrane spanning chain of the photosynthetic reaction center, denoted 6prcM, and the sequence of a different chain from 10 the photosynthetic reaction center, chain L of PDB structure 6prc, denoted 6prcL.
Figure 32 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in Figure 31, compared to the crystal structure for chain M of PDB code 6prc.
Figure 33 shows the alignment according to the invention in PIR format between the sequence of ompA, denoted lbxwA, and the sequence of ompX, chain A of PDB
structure 1 qj 8, denoted 1 qj 8A.
Figure 34 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in figure 33, compared to the ompA crystal structure, chain A
of PDB code lbxw.
Figure 35 shows the alignment according to the invention in PIR format between the sequence of ompI~36, denoted 1 osmA, and the sequence of porin protein 2por.
Figure 36 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in figure 35, compared to the ompI~36 crystal structure, chain A of PDB code losm.
Figure 37 shows the alignment, formed from the methods according to the invention, in PIR format, between the sequence of sucrose-specific porin, denoted 1 aOtP, and the sequence of maltoporin, chain A of PDB structure 2mpr, denoted 2mprA.
Figure 38 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in figure 37, compared to the sucrose-specific porin crystal structure, chain P of PDB code laOtP.
Table 1 lists the structure alignment between domains 1 ovaA and 1 by7A.
Figure 17 represents the optimal sequence alignment between 8C001 and lb4kA in PIR format as determined by the methods according to the invention.
Figure 18 shows the crystal structure of laws on the left and the structure of on the right as predicted by the methods according to the invention.
Figure 19 shows a space filling representation of chain A from 1 dkf co-crystalized with oleic acid.
Figure 20 shows the PIR alignment of ldkf (denoted as gi7766906) and the sequence of chain A of structure 1 a28 according to the methods of the invention.
Figure 2I shows a rainbow ribbon overlay between the predicted structure and the crystal structure of chain A of 1 dkf.
Figure 22 shows an overlay of the predicted structure according to the methods of the invention ldkf and the crystal structure for 22 key residues that form the oleic acid binding pocket.
Figure 23 shows a stick diagram of 1 a252 (PDB code) co-crystallized with estradiol. The estradiol ligands are shown in space filling format.
Figure 24 shows the alignment according to the methods of the invention in PIR
format between the sequence of the estrogen receptor (denoted as gi3659931) and the sequence of chain A of structure 1a28, denoted 1a28A.
Figure 25 shows a rainbow ribbon overlay between the predicted structure according to the methods of the invention of the estrogen receptor and the crystal structure of chain A of 1 a52.
Figure 26 shows an overlay of the predicted structure according to the methods of the invention for estrogen receptor and the crystal structure for 19 key residues that form the ~estradiol binding pocket.
Figure 27 shows the alignment formed from the methods of the invention in PIR
format between the sequence of halorhodopsin, denoted 1e12A, and the sequence of bacteriorhodopsin, denoted lc3wA made by the methods according to the invention.
Figure 28 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in figure 27, compared to the halorhodopsin crystal structure, chain A of PDB code 1 a 12.
Figure 29 shows the alignment, formed from the methods according to the invention, in PIR format, between the sequence of bacteriorhodopsin, denoted lc3wA, and the sequence of rhodposin, chain A of PDB structure 1f88, denoted 1f88A.
Figure 30 shows a rainbow ribbon overlay between the three-dimensional structure 5 created using the alignment in Figure 29, compared to the bacteriorhodopsin crystal structure, chain A of PDB code 1 caw.
Figure 31 shows the alignment, formed from the methods according to the invention, in PIR format, between the sequence of a membrane spanning chain of the photosynthetic reaction center, denoted 6prcM, and the sequence of a different chain from 10 the photosynthetic reaction center, chain L of PDB structure 6prc, denoted 6prcL.
Figure 32 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in Figure 31, compared to the crystal structure for chain M of PDB code 6prc.
Figure 33 shows the alignment according to the invention in PIR format between the sequence of ompA, denoted lbxwA, and the sequence of ompX, chain A of PDB
structure 1 qj 8, denoted 1 qj 8A.
Figure 34 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in figure 33, compared to the ompA crystal structure, chain A
of PDB code lbxw.
Figure 35 shows the alignment according to the invention in PIR format between the sequence of ompI~36, denoted 1 osmA, and the sequence of porin protein 2por.
Figure 36 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in figure 35, compared to the ompI~36 crystal structure, chain A of PDB code losm.
Figure 37 shows the alignment, formed from the methods according to the invention, in PIR format, between the sequence of sucrose-specific porin, denoted 1 aOtP, and the sequence of maltoporin, chain A of PDB structure 2mpr, denoted 2mprA.
Figure 38 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in figure 37, compared to the sucrose-specific porin crystal structure, chain P of PDB code laOtP.
Table 1 lists the structure alignment between domains 1 ovaA and 1 by7A.
Table 2 provides a BRIDGEBULGE gap list of bridges and bulges for the domain 1 ovaA derived from DALI structure alignments between 1 ovaA and the protein domains 1 ova, 1 ovaC, 1 azxI, and 1 by7A.
Table 3 provides a comparison of the advantages of the methods of the present invention versus the state-of the-art methods.
Table 4 shows the relative abilities of the alignment methods of the present invention and PSI Blast to recognize sequence homology relationships at the Family, Superfamily, Fold and Class levels for 27 sequences in the SLOP database.
Table 5 shows the number of residues correctly modeled using the alignment methods according to the invention for 34 previously unmodeled Mycoplasma genitalium sequences.
Table 6 provides a comparison between predicted structures using the alignment methods according to the invention with the ModBase database for the first 180 sequences in the Mycoplasma gehitalium genome. The number of residues built into a reliable 1 S structural model is given in each column. Substantially complete models containing at least 80% of the total sequence length are highlighted in bold. Structures generated by each method passed identical reliability tests. These tests are published (Sanchez and Sali 1998), and represent a threshold where the structures will have the correct fold with a confidence limit of > 95%.
Table 7 provides PDB structures found to have sequence similarity to SC001 by gapped-BLAST.
Table 8 provides a partial list of bridges and bulges for the domain lovaA
derived from DALI structure alignments between 1 ovaA and the listed protein domains.
SUMMARY OF THE INVENTION
A preferred embodiment of the invention is a method for determining a preferred sequence alignment between a query sequence and at least one template sequence comprising the steps of: 1) aligning two or more reference sequences to determine one or more BRIDGEBULGE gaps; 2) determining an alignment score between each potential alignment of the query sequence and each template sequence based on whether or not a given sequence alignment between the query sequence and each template sequence creates a BRDIGEBULGE gap and 3) determining a preferred sequence alignment based on the alignment scores of the query sequence with each template sequence. A
preferred sequence alignment includes any sequence alignment that may be used to determine useful structural information regarding the query sequence. The optimal sequence alignment is the alignment with the highest score. Although, an optimal sequence alignment may be used to generate the most accurate structural information regarding the query sequence, often sequence alignments with sub-optimal sequences still provide useful structural information and primary sequence homology relationships.
Another embodiment of the invention is a method for determinng a preferred alignment between a query sequence and a template sequence comprising the steps of 1) aligning two or more reference sequences to determine one or more reference alignment gaps known as BRIDGEBULGE gaps; 2) forming a sequence alignment similarity matrix for the query sequence and one or more template sequences; 3) determining a sequence alignment sum matrix from the dynamic evolution of each sequence alignment similarity matrix based on whether the alignment of the query sequence with each template sequence creates a BRIDGEBULGE gap; and 4) determining a preferred alignment between the query sequence and each template sequence from the dynamic evolution of each sum matrix.
Another embodiment of the invention is method for determining the three dimensional structure of a query sequence based upon primary sequence homology modeling with one or more template sequences using the methods of the invention for determining an optimal sequence alignment. When the preferred alignment methods according to the invention are used in combination with primary sequence homology modeling methods to predict the three dimensional structure of a query sequence or determine the primary sequence homology relationships of a plurality of query sequences, it is possible to generate accurate structural models of query sequences at lower alignment homologies than the current state-of the-art permits. Accordingly, another embodiment of the invention is a method for predicting three dimensional structure of query sequences using primary sequence homology modeling methods when the query sequence and template contain from 10-20% homologous residues. A still further embodiment of the invention is a method for determining the primary sequence homology relationships for at least two query sequences using primary sequence homology modeling methods when the query sequence and template from 10-20% homologous residues.
Table 3 provides a comparison of the advantages of the methods of the present invention versus the state-of the-art methods.
Table 4 shows the relative abilities of the alignment methods of the present invention and PSI Blast to recognize sequence homology relationships at the Family, Superfamily, Fold and Class levels for 27 sequences in the SLOP database.
Table 5 shows the number of residues correctly modeled using the alignment methods according to the invention for 34 previously unmodeled Mycoplasma genitalium sequences.
Table 6 provides a comparison between predicted structures using the alignment methods according to the invention with the ModBase database for the first 180 sequences in the Mycoplasma gehitalium genome. The number of residues built into a reliable 1 S structural model is given in each column. Substantially complete models containing at least 80% of the total sequence length are highlighted in bold. Structures generated by each method passed identical reliability tests. These tests are published (Sanchez and Sali 1998), and represent a threshold where the structures will have the correct fold with a confidence limit of > 95%.
Table 7 provides PDB structures found to have sequence similarity to SC001 by gapped-BLAST.
Table 8 provides a partial list of bridges and bulges for the domain lovaA
derived from DALI structure alignments between 1 ovaA and the listed protein domains.
SUMMARY OF THE INVENTION
A preferred embodiment of the invention is a method for determining a preferred sequence alignment between a query sequence and at least one template sequence comprising the steps of: 1) aligning two or more reference sequences to determine one or more BRIDGEBULGE gaps; 2) determining an alignment score between each potential alignment of the query sequence and each template sequence based on whether or not a given sequence alignment between the query sequence and each template sequence creates a BRDIGEBULGE gap and 3) determining a preferred sequence alignment based on the alignment scores of the query sequence with each template sequence. A
preferred sequence alignment includes any sequence alignment that may be used to determine useful structural information regarding the query sequence. The optimal sequence alignment is the alignment with the highest score. Although, an optimal sequence alignment may be used to generate the most accurate structural information regarding the query sequence, often sequence alignments with sub-optimal sequences still provide useful structural information and primary sequence homology relationships.
Another embodiment of the invention is a method for determinng a preferred alignment between a query sequence and a template sequence comprising the steps of 1) aligning two or more reference sequences to determine one or more reference alignment gaps known as BRIDGEBULGE gaps; 2) forming a sequence alignment similarity matrix for the query sequence and one or more template sequences; 3) determining a sequence alignment sum matrix from the dynamic evolution of each sequence alignment similarity matrix based on whether the alignment of the query sequence with each template sequence creates a BRIDGEBULGE gap; and 4) determining a preferred alignment between the query sequence and each template sequence from the dynamic evolution of each sum matrix.
Another embodiment of the invention is method for determining the three dimensional structure of a query sequence based upon primary sequence homology modeling with one or more template sequences using the methods of the invention for determining an optimal sequence alignment. When the preferred alignment methods according to the invention are used in combination with primary sequence homology modeling methods to predict the three dimensional structure of a query sequence or determine the primary sequence homology relationships of a plurality of query sequences, it is possible to generate accurate structural models of query sequences at lower alignment homologies than the current state-of the-art permits. Accordingly, another embodiment of the invention is a method for predicting three dimensional structure of query sequences using primary sequence homology modeling methods when the query sequence and template contain from 10-20% homologous residues. A still further embodiment of the invention is a method for determining the primary sequence homology relationships for at least two query sequences using primary sequence homology modeling methods when the query sequence and template from 10-20% homologous residues.
DETAILED DESCRIPTION OF THE INVENTION
A preferred embodiment of the invention is a method for determining a preferred sequence alignment between a query sequence and one or more template sequences comprising the steps of: 1 ) aligning two or more reference sequences to determine orie or more reference alignment gaps known as BRIDGEBULGE gaps; 2) determining an alignment score between each potential alignment of the query sequence and each template sequence based on whether or not a given sequence alignment between the query sequence and each template sequence creates a BRIDGEBULGE gap and 3) determining a preferred sequence alignment based on the alignment scores of the query sequence with each template sequences.
Preferred methods for determining reference alignnment yaps-BRIDGEBULGE~aps In a preferred method of the invention, a list of reference alignment gaps known as a BRIDGEBULGE list, is generated from aligning each reference sequence in a database of reference sequences against every other reference sequence. Preferably, such a database of reference sequences includes all or a statistically significant cross section of the know protein sequences such as the continuously evolving Protein Data Bank (PDB).
Such structure comparison techniques are known to one of skill in the art and include, for example, the Dali method developed by Holm and Sander, the Combinatorial Extension Method (CE), and VAST. Holm, L. and Sander, C. J. Mol. Biol. 233, 123-138 (1993);
Holm, L. and Sander, C., Science 273, 595-602 (1996); Shindyalov, LN., and Bourne, P.E., P~otei~ Egg. I1, 739-747 (1998); Gibrat, J-F., Madei, T. and Bryant, S.
H., Curr.
Opi~. St~uct. Biol. 6, 377-385 (1996).
A preferred embodiment of the invention is a method for determining a preferred sequence alignment between a query sequence and one or more template sequences comprising the steps of: 1 ) aligning two or more reference sequences to determine orie or more reference alignment gaps known as BRIDGEBULGE gaps; 2) determining an alignment score between each potential alignment of the query sequence and each template sequence based on whether or not a given sequence alignment between the query sequence and each template sequence creates a BRIDGEBULGE gap and 3) determining a preferred sequence alignment based on the alignment scores of the query sequence with each template sequences.
Preferred methods for determining reference alignnment yaps-BRIDGEBULGE~aps In a preferred method of the invention, a list of reference alignment gaps known as a BRIDGEBULGE list, is generated from aligning each reference sequence in a database of reference sequences against every other reference sequence. Preferably, such a database of reference sequences includes all or a statistically significant cross section of the know protein sequences such as the continuously evolving Protein Data Bank (PDB).
Such structure comparison techniques are known to one of skill in the art and include, for example, the Dali method developed by Holm and Sander, the Combinatorial Extension Method (CE), and VAST. Holm, L. and Sander, C. J. Mol. Biol. 233, 123-138 (1993);
Holm, L. and Sander, C., Science 273, 595-602 (1996); Shindyalov, LN., and Bourne, P.E., P~otei~ Egg. I1, 739-747 (1998); Gibrat, J-F., Madei, T. and Bryant, S.
H., Curr.
Opi~. St~uct. Biol. 6, 377-385 (1996).
Table 1 shows a structure alignment produced by the program Dali for the protein domains lovaA and lby7A (the C-terminus of the alignment has been truncated at residue 189 of 1 ovaA). As Table 1 suggests when two sequences are aligned, often large regions of the two sequences are identical and are separated by regions where the amino acid residues differ. In particular, when lovaA is aligned against lby7A, the first 63 and the last 91 residues match between the two sequences. The intervening regions alternately align and do not align over short sequence lengths. Fox example, residues 69-78 in 1 ovaA
do not align to any residues in lby7A, even though the structures are similar on both sides of the gap. Thus, with respect to lby7A, lovaA has a 9-residue bulge in this region.
I0 Conversely, with respect to lovaA, the structure Iby7A bridges 9 residues in this region of 1 ovaA.
It is well known in the art that a structure comparison database can be constructed for each protein relative to the entire database. See e.g. FSSP database, Holm and Sander, Science 273, 595-602 (1996). Given a set of sequence alignments, it is possible to 1 S generate a list of all of the bridges and bulges that occur in the various sequence alignments with respect to a given structure. In general, results according to the methods of the invention are generally improved as the number of sequences and genomes contained within the database used to determine BRIDGE/BULGE information are increased. Table 2 shows a partial list of the bridge and bulge information that can be 20 derived from aligning various sequences in the Protein Databank (PDB). F.
C. Bernstein, T. F. Koetzle, G. J. B. Williams et al. J. Mol. Biol. 112, 535-542 (1977);
H.M.Berman, J.Westbrook, Z.Feng, G.Gilliland, T.N.Bhat, H.Weissig, LN.Shindyalov, P.E.Bourne Nucleic Acids Research, 28: 235-242 (2000); WWW address: http://www.rcsb.or /pdb] to the protein domain 1 ovaA. The bridges that have been derived from the alignment of 25 lovaA with lby7A in Table 1 are highlighted in gray.
Another preferred method for determining BRIDGE/BULGE information employs an algorithm such as BLAST, S. F. Altschul, W. Gish, W. Miller, E. W. Meyers, and D. J.
5 Lippman, J. Mol. Biol. 215, 403-410 (1990), to determine a set of homology sequences to the query sequence and the template sequences from any large sequence database that contains a statistically representative cross section of many sequences across multiple genomes. Preferably the databases that are used to determine the BRIDGE/BULGE
lists according to this preferred embodiment include all the known sequences with homologies 10 of at least 45% to the query and template sequences. A suitable database would be the non-redundant protein sequence databank at the NIH, which currently contains more than 600,000 sequences from more than 100 different organisms. A BRIDGE/BULGE list may then be determined from the sequence homology sets formed from query sequence and the template sequences using any multiple sequence alignment algorithm known in the art, 15 such as clustalW, J. D. Thompson, D. G. Higgins, T. J. Gibson, Nucl. Acids Res. 22, 4673-4680 (1994). Figure 1 shows the 7 homology sequences found (performed by clustalW) for the sequence:
LVAFADFGSVTFTNAEATSGGSTVGPSDATVMDIEQDGSVLTETSVSGDSVTV.
do not align to any residues in lby7A, even though the structures are similar on both sides of the gap. Thus, with respect to lby7A, lovaA has a 9-residue bulge in this region.
I0 Conversely, with respect to lovaA, the structure Iby7A bridges 9 residues in this region of 1 ovaA.
It is well known in the art that a structure comparison database can be constructed for each protein relative to the entire database. See e.g. FSSP database, Holm and Sander, Science 273, 595-602 (1996). Given a set of sequence alignments, it is possible to 1 S generate a list of all of the bridges and bulges that occur in the various sequence alignments with respect to a given structure. In general, results according to the methods of the invention are generally improved as the number of sequences and genomes contained within the database used to determine BRIDGE/BULGE information are increased. Table 2 shows a partial list of the bridge and bulge information that can be 20 derived from aligning various sequences in the Protein Databank (PDB). F.
C. Bernstein, T. F. Koetzle, G. J. B. Williams et al. J. Mol. Biol. 112, 535-542 (1977);
H.M.Berman, J.Westbrook, Z.Feng, G.Gilliland, T.N.Bhat, H.Weissig, LN.Shindyalov, P.E.Bourne Nucleic Acids Research, 28: 235-242 (2000); WWW address: http://www.rcsb.or /pdb] to the protein domain 1 ovaA. The bridges that have been derived from the alignment of 25 lovaA with lby7A in Table 1 are highlighted in gray.
Another preferred method for determining BRIDGE/BULGE information employs an algorithm such as BLAST, S. F. Altschul, W. Gish, W. Miller, E. W. Meyers, and D. J.
5 Lippman, J. Mol. Biol. 215, 403-410 (1990), to determine a set of homology sequences to the query sequence and the template sequences from any large sequence database that contains a statistically representative cross section of many sequences across multiple genomes. Preferably the databases that are used to determine the BRIDGE/BULGE
lists according to this preferred embodiment include all the known sequences with homologies 10 of at least 45% to the query and template sequences. A suitable database would be the non-redundant protein sequence databank at the NIH, which currently contains more than 600,000 sequences from more than 100 different organisms. A BRIDGE/BULGE list may then be determined from the sequence homology sets formed from query sequence and the template sequences using any multiple sequence alignment algorithm known in the art, 15 such as clustalW, J. D. Thompson, D. G. Higgins, T. J. Gibson, Nucl. Acids Res. 22, 4673-4680 (1994). Figure 1 shows the 7 homology sequences found (performed by clustalW) for the sequence:
LVAFADFGSVTFTNAEATSGGSTVGPSDATVMDIEQDGSVLTETSVSGDSVTV.
With respect to the query sequence, the multiple sequence alignment contains 2 different one-residue bulge regions, represented by the "G-S" and "S-V" points in the query sequence. The multiple alignment in Figure 1 also contains one bridge region, where the residues "STVGPSD" in the query sequence are bridged by a gap region in sequence 4. Note that if three-dimensional models of the homology sequences exist it is possible to verify that each of the bridges and bulges found comply with the physical limitations imposed by the three dimensional structures.
An alternative source of a BRIDGEBULGE list consists of a list of bridge and bulge gaps that comply with the physical limitations imposed by the 3-dimensional protein IO structure. For example, a list of inter-residue distances between the C-alpha carbons in each residue in the template sequence can be created. Inter-residue distances that lie between . certain thresholds can be considered candidates for an appropriate.
BRIDGEBULGE gap. Fox instance, two-residues that are approximately 5~ apart are..
excellent candidates to be separated by one residue. A bridge of one residue at this point in the structure would not disrupt the overall fold, and could be considered for inclusion in the BRIDGEBULGE gap set (if these residues are indeed separated by more 'than one residue in the query structure). In this manner, a set of bridges and bulges that do not disrupt the 3-dimensional structure of the template sequence may also be used in a BRIDGEBULGE gap set.
The structure of infra-membrane proteins, located all or in part in the cell membrane, have a number of unique characteristics that differentiate them from their soluble protein counterparts. One such characteristic is the high degree of structural homology exhibited by membrane proteins for the regions of the protein that lie within the membrane. Conversely, the infra- and extra-cellular loops in these proteins are known to be quite flexible and not nearly as structurally conserved. The methods of the current invention are uniquely suited to model such sequences. Given a membrane protein template structure, the infra- and extra-cellular loop regions can be identified, and the list of BRIDGEBULGE gaps for the membrane template can be enriched so that all possible loop lengths are present in the candidate alignment set. Furthermore, BRIDGEBULGE
gaps which disrupt the highly conserved infra-membrane structure of the protein can be removed from the BRIDGEBULGE set, so that only sequence alignments which preserve this highly conserved structure are considered in the optimal alignment. The parameters for standard gap opening and extension, as well as BRIDGEBULGE gap opening and extension should be determined for membrane proteins independently from soluble proteins.
A list of bridges and bulges contains valuable information regarding the types of gaps that are known to exist in nature for a given sequence comparison. In the preferred methods of the invention, each gap listed in the BRIDGEBULGE set is given an opportunity to participate in determining the optimal alignment between a query sequence and a template sequence. The current methods in the art for determining an optimal sequence alignment between a query sequence and a template sequence do not consider whether a proposed alignment gap is found elsewhere in nature.
One skilled in the art will quickly appreciate why such consideration is important.
When comparing two sequences, as the relative sequence homology falls, the frequency and sizes of alignment gaps typically increases. Without consideration of whether or not there is any physical basis to the gaps, the determination of optimal alignment becomes disconnected from physical reality of the three dimensional structure of the sequence.
Preferred methods for calculatin~a sequence a ~~~nment- the sum matrix A preferred method for determining an optimal sequence alignment between a query sequence and a template sequence comprises dynamically evolving a sequence similarity matrix to calculate a sum matrix according to an algorithm that considers whether or not a proposed alignment gap creates a known BRIDGEBULGE gap.
Although the use of similarity matrices and dynamic programming are commonly employed in current alignment techniques, current alignment techniques do not determine an optimal alignment by reference to whether or not a proposed BRIDGE/BULGE
gap physically exists.
Example 1 Example 1 shows the current method for determining an optimal sequence alignment by dynamically evolving a similarity matrix to calculate a sum matrix. Figure 2 shows an exemplary similarity matrix constructed for the two sequences "BIGTOWNSOWN" and "BIGBROWNTOWNOWN", using a very simple scoring function such that s;,~ = 2 if the letters at matrix positions i and j are the same and s;,~ = 0 if the letters at matrix positions i and j are different.
An alternative source of a BRIDGEBULGE list consists of a list of bridge and bulge gaps that comply with the physical limitations imposed by the 3-dimensional protein IO structure. For example, a list of inter-residue distances between the C-alpha carbons in each residue in the template sequence can be created. Inter-residue distances that lie between . certain thresholds can be considered candidates for an appropriate.
BRIDGEBULGE gap. Fox instance, two-residues that are approximately 5~ apart are..
excellent candidates to be separated by one residue. A bridge of one residue at this point in the structure would not disrupt the overall fold, and could be considered for inclusion in the BRIDGEBULGE gap set (if these residues are indeed separated by more 'than one residue in the query structure). In this manner, a set of bridges and bulges that do not disrupt the 3-dimensional structure of the template sequence may also be used in a BRIDGEBULGE gap set.
The structure of infra-membrane proteins, located all or in part in the cell membrane, have a number of unique characteristics that differentiate them from their soluble protein counterparts. One such characteristic is the high degree of structural homology exhibited by membrane proteins for the regions of the protein that lie within the membrane. Conversely, the infra- and extra-cellular loops in these proteins are known to be quite flexible and not nearly as structurally conserved. The methods of the current invention are uniquely suited to model such sequences. Given a membrane protein template structure, the infra- and extra-cellular loop regions can be identified, and the list of BRIDGEBULGE gaps for the membrane template can be enriched so that all possible loop lengths are present in the candidate alignment set. Furthermore, BRIDGEBULGE
gaps which disrupt the highly conserved infra-membrane structure of the protein can be removed from the BRIDGEBULGE set, so that only sequence alignments which preserve this highly conserved structure are considered in the optimal alignment. The parameters for standard gap opening and extension, as well as BRIDGEBULGE gap opening and extension should be determined for membrane proteins independently from soluble proteins.
A list of bridges and bulges contains valuable information regarding the types of gaps that are known to exist in nature for a given sequence comparison. In the preferred methods of the invention, each gap listed in the BRIDGEBULGE set is given an opportunity to participate in determining the optimal alignment between a query sequence and a template sequence. The current methods in the art for determining an optimal sequence alignment between a query sequence and a template sequence do not consider whether a proposed alignment gap is found elsewhere in nature.
One skilled in the art will quickly appreciate why such consideration is important.
When comparing two sequences, as the relative sequence homology falls, the frequency and sizes of alignment gaps typically increases. Without consideration of whether or not there is any physical basis to the gaps, the determination of optimal alignment becomes disconnected from physical reality of the three dimensional structure of the sequence.
Preferred methods for calculatin~a sequence a ~~~nment- the sum matrix A preferred method for determining an optimal sequence alignment between a query sequence and a template sequence comprises dynamically evolving a sequence similarity matrix to calculate a sum matrix according to an algorithm that considers whether or not a proposed alignment gap creates a known BRIDGEBULGE gap.
Although the use of similarity matrices and dynamic programming are commonly employed in current alignment techniques, current alignment techniques do not determine an optimal alignment by reference to whether or not a proposed BRIDGE/BULGE
gap physically exists.
Example 1 Example 1 shows the current method for determining an optimal sequence alignment by dynamically evolving a similarity matrix to calculate a sum matrix. Figure 2 shows an exemplary similarity matrix constructed for the two sequences "BIGTOWNSOWN" and "BIGBROWNTOWNOWN", using a very simple scoring function such that s;,~ = 2 if the letters at matrix positions i and j are the same and s;,~ = 0 if the letters at matrix positions i and j are different.
In dynamic programming, the sum matrix may be calculated from dynamically evolving a similarity matrix. An exemplary evolution scheme for connecting the elements of a similarity matrix s;; to the elements of a sum matrix S;; is shown in Equation 1.
S;~ = s;~ + Max f S;+i,~+;, [Diagonal, down and to the right]
si+l,j+2 to jmax - G~~ [Down row i+1, all possible gaps]
Si+2 to imax, j+2 - GAP, [Down column j+l, all possible gaps]
)~
where s;~ denotes the score of cell (i, j) in the similarity matrix, and Max denotes the maximum value for the three terms in the bracketed expression. GAP represents the gap penalty. for the proposed gap opening and extension. An exemplary GAP scoring penalty is shown in Equation 2.
GAP = Open - k(extension), (2) where "Open" represents a penalty constant for opening a gap and "k(extension)" is a .
constant representing the penalty constant for extending the gap "k" residues.
A typical dynamic programming algorithm begins filling in the sum matrix from the bottom row, and continues moving up the matrix, filling in the scores for each cell in the row from right to left. Figure 3 shows the sum matrix. being constructed, .where the gap opening and extension penalties are 2 and l, respectively. The s;,~ = 2 scores from the similarity score matrix have already been transferred to the sum matrix in this example. In Figure 3, the bottom two rows of the sum matrix have been completed, and the third row from the bottom is being complete. The matrix elements that are gray shaded.represent the matrix elements that are considered when determining the score of the black matrix element. The darkest of the gray scaled matrix elements along the diagonal is the matrix element that contributes to the value of the black matrix element.
Figure 4 shows the sum matrix at an even further stage of development, this time with the nine bottom rows completed. As above, the gray shaded matrix elements are the positions considered when determining the score in the black shaded matrix element. In this case, the highest score comes from the darkest gray shaded element that is two columns away from the black cell.
Figure 5, shows the GAP penalties that are used in equation (1) for the gray cells that are alignment candidates for the black-shaded cell from Figure 4. The cell directly below and to the right of the black-shaded cell has GAP=0. There are two cells with GAP
S;~ = s;~ + Max f S;+i,~+;, [Diagonal, down and to the right]
si+l,j+2 to jmax - G~~ [Down row i+1, all possible gaps]
Si+2 to imax, j+2 - GAP, [Down column j+l, all possible gaps]
)~
where s;~ denotes the score of cell (i, j) in the similarity matrix, and Max denotes the maximum value for the three terms in the bracketed expression. GAP represents the gap penalty. for the proposed gap opening and extension. An exemplary GAP scoring penalty is shown in Equation 2.
GAP = Open - k(extension), (2) where "Open" represents a penalty constant for opening a gap and "k(extension)" is a .
constant representing the penalty constant for extending the gap "k" residues.
A typical dynamic programming algorithm begins filling in the sum matrix from the bottom row, and continues moving up the matrix, filling in the scores for each cell in the row from right to left. Figure 3 shows the sum matrix. being constructed, .where the gap opening and extension penalties are 2 and l, respectively. The s;,~ = 2 scores from the similarity score matrix have already been transferred to the sum matrix in this example. In Figure 3, the bottom two rows of the sum matrix have been completed, and the third row from the bottom is being complete. The matrix elements that are gray shaded.represent the matrix elements that are considered when determining the score of the black matrix element. The darkest of the gray scaled matrix elements along the diagonal is the matrix element that contributes to the value of the black matrix element.
Figure 4 shows the sum matrix at an even further stage of development, this time with the nine bottom rows completed. As above, the gray shaded matrix elements are the positions considered when determining the score in the black shaded matrix element. In this case, the highest score comes from the darkest gray shaded element that is two columns away from the black cell.
Figure 5, shows the GAP penalties that are used in equation (1) for the gray cells that are alignment candidates for the black-shaded cell from Figure 4. The cell directly below and to the right of the black-shaded cell has GAP=0. There are two cells with GAP
= 2, where the gap is first opened but not extended. Cells further from the black-shaded cell then also receive an extension penalty of l, and so their overall GAP
penalty increases by one unit as the length of the extension increases (k from equation 1).
Figure 6 shows the completed sum matrix formed from the dynamic evolution of the similarity matrix with matrix elements s;, ~ as defined above. Once the sum matrix is completed, the optimal alignment is found by finding the highest scoring cell among all cells in the top row and left most column of the sum matrix, and then tracing back through the cells that led to this maximum scoring cell. In this example, the top left optimal alignment begins in the top left cell and is highlighted in bold. The highest scoring alignment is shown in Figure 7 outside the context of the sum matrix in the widely used PIR format.
The current dynamic programming methods as taught above and as typified by Equation 2, do not consider BRIDGEBULGE information when evolving a similarity matrix to calculate the sum matrix. Thus, the current methods for determining an optimal sequence alignment between a query sequence and template sequence make such a determination without reference to whether a proposed BRIDGE/BULGE has a physical basis in nature. This has important implications when making sequence comparisons between two sequences with low sequence homologies and explains why the current alignment techniques fail at low homologies. When comparing two sequences, as the relative sequence homology decreases, the relative gap sizes and frequency increase.
Without consideration of whether or not the gaps have any precedent in nature, the determination of optimal alignment becomes disconnected from physical reality.
The methods of the present invention are based on the realization that if the dynamic programming scheme of a similarity matrix to form a sum matrix is going to be accurate at low sequence homologies, the dynamic programming scheme must consider whether or not a proposed alignment has precedence in nature. The preferred methods of the invention, like the current methods for determining an optimal sequence alignment between a query sequence and a template sequence, use dynamic programming to output a sum matrix from an input similarity matrix. However, the present methods fox determining an optimal sequence alignment also consider one more input variable, namely, whether or not any BRIDGESBULGES in a proposed alignment have any physical basis in nature. Figure ~ pictorially shows the two basic inputs required for the methods according to the invention.
In a preferred method according to the invention, a similarity matrix with matrix elements s;; is dynamically evolved according to Equation 3 to calculate the sum matrix with matrix elements 5,;.
s;;=s;;+Max{
5 S;+i,;+t, [Diagonal, down and to the right]
Si+1, j+2 to jmax - G~, [Down row i+1, all possible j]
Si+2 to imax, j+2 - CTS', [Down column j+l, all possible i]
Sm,n - BRIDGEBULGE [Bridges and bulges that terminate sum matrix element i,j]
10 ), (3) The terms in Equation 3, are defined the same as the terms in Equation 2~ with the additional term BRIDGEBULGE. BRIDGEBULGE corresponds to the penalty for a known bridge or bulge that begins at the m,n matrix element of the sum matrix and ends at the i,j matrix element of the sum matrix. Max{S;+y+i, Si+i,;+a to jm~ - G~, Si+2 to imp, j+2 -1 S GAP, Sm," - BRIDGEBULGE} refers to the maximum value of the Four terms contained within the brackets. The similarity matrix may be developed by any of the methods known in the art.
Example 2 Example 2 demonstrates how the inclusion of BRIDGEBULGE information from 20 the preferred method described by Equation 3 affects the determination of a. preferred alignment between "BIGTOWNSOWN" with "BIGBROWNTOWNOWN" based on the similarity matrix in Figure 2 and the BRIDGEBULGE set in Figure 9. For the purposes of this calculation, gap opening and extension penalties for gaps that are not present in the known BRIDGEBULGE set are 3 and 2, respectively, and the gap opening and extension penalties for gaps that are present in the known BRIDGEBULGE set are 1 and 0, respectively. Figure 10 shows the bridge and bulge gaps that are allowed by the BRIDGEBULGE gap set in Figure 9. Thus, Figure 10, shows how a BRIDGEBULGE
set controls the dynamic evolution of the sum matrix from a similarity matrix.
The preferred methods of the invention initially proceed by filling in the sum matrix beginning with the bottom row, and moving up the matrix, filling in the scores for each cell in the row from right to left.
penalty increases by one unit as the length of the extension increases (k from equation 1).
Figure 6 shows the completed sum matrix formed from the dynamic evolution of the similarity matrix with matrix elements s;, ~ as defined above. Once the sum matrix is completed, the optimal alignment is found by finding the highest scoring cell among all cells in the top row and left most column of the sum matrix, and then tracing back through the cells that led to this maximum scoring cell. In this example, the top left optimal alignment begins in the top left cell and is highlighted in bold. The highest scoring alignment is shown in Figure 7 outside the context of the sum matrix in the widely used PIR format.
The current dynamic programming methods as taught above and as typified by Equation 2, do not consider BRIDGEBULGE information when evolving a similarity matrix to calculate the sum matrix. Thus, the current methods for determining an optimal sequence alignment between a query sequence and template sequence make such a determination without reference to whether a proposed BRIDGE/BULGE has a physical basis in nature. This has important implications when making sequence comparisons between two sequences with low sequence homologies and explains why the current alignment techniques fail at low homologies. When comparing two sequences, as the relative sequence homology decreases, the relative gap sizes and frequency increase.
Without consideration of whether or not the gaps have any precedent in nature, the determination of optimal alignment becomes disconnected from physical reality.
The methods of the present invention are based on the realization that if the dynamic programming scheme of a similarity matrix to form a sum matrix is going to be accurate at low sequence homologies, the dynamic programming scheme must consider whether or not a proposed alignment has precedence in nature. The preferred methods of the invention, like the current methods for determining an optimal sequence alignment between a query sequence and a template sequence, use dynamic programming to output a sum matrix from an input similarity matrix. However, the present methods fox determining an optimal sequence alignment also consider one more input variable, namely, whether or not any BRIDGESBULGES in a proposed alignment have any physical basis in nature. Figure ~ pictorially shows the two basic inputs required for the methods according to the invention.
In a preferred method according to the invention, a similarity matrix with matrix elements s;; is dynamically evolved according to Equation 3 to calculate the sum matrix with matrix elements 5,;.
s;;=s;;+Max{
5 S;+i,;+t, [Diagonal, down and to the right]
Si+1, j+2 to jmax - G~, [Down row i+1, all possible j]
Si+2 to imax, j+2 - CTS', [Down column j+l, all possible i]
Sm,n - BRIDGEBULGE [Bridges and bulges that terminate sum matrix element i,j]
10 ), (3) The terms in Equation 3, are defined the same as the terms in Equation 2~ with the additional term BRIDGEBULGE. BRIDGEBULGE corresponds to the penalty for a known bridge or bulge that begins at the m,n matrix element of the sum matrix and ends at the i,j matrix element of the sum matrix. Max{S;+y+i, Si+i,;+a to jm~ - G~, Si+2 to imp, j+2 -1 S GAP, Sm," - BRIDGEBULGE} refers to the maximum value of the Four terms contained within the brackets. The similarity matrix may be developed by any of the methods known in the art.
Example 2 Example 2 demonstrates how the inclusion of BRIDGEBULGE information from 20 the preferred method described by Equation 3 affects the determination of a. preferred alignment between "BIGTOWNSOWN" with "BIGBROWNTOWNOWN" based on the similarity matrix in Figure 2 and the BRIDGEBULGE set in Figure 9. For the purposes of this calculation, gap opening and extension penalties for gaps that are not present in the known BRIDGEBULGE set are 3 and 2, respectively, and the gap opening and extension penalties for gaps that are present in the known BRIDGEBULGE set are 1 and 0, respectively. Figure 10 shows the bridge and bulge gaps that are allowed by the BRIDGEBULGE gap set in Figure 9. Thus, Figure 10, shows how a BRIDGEBULGE
set controls the dynamic evolution of the sum matrix from a similarity matrix.
The preferred methods of the invention initially proceed by filling in the sum matrix beginning with the bottom row, and moving up the matrix, filling in the scores for each cell in the row from right to left.
In Figure 11, the bottom three rows of the sum matrix have been completed, and the fourth row from the bottom is being filled in. Once again, the gray shaded matrix elements are the potential matrix elements considered when determining the score in the black shaded matrix elements and the darkest gray shaded matrix element is the matrix element that actually contributes to the score of the black matrix element. As is shown in Figure 10 by the thickest arrow, the transition from the dark gray matrix element to the black is permitted by the BRIDGE/ BULGE set shown in Fig. 9.
Figure 12 shows the sum matrix at an even further stage of development with the bottom twelve rows completed. As above, the gray shaded matrix cells are the positions considered when determining the score in the black shaded cell. In this case, the highest score comes from the dark gray shaded cell that is in the BRIDGEBULGE gap set.
Figure 13, shows the GAP penalties that are used in Equation 2 for the gray cells that are alignment candidates for the black-shaded cell from Figure 12. The transition from the darker gray cell to the° black cell is in the, BRIDGEBULGE gap set and is thus has a gap penalty of 1. ' Figure 1 ~ shows a sum matrix according to a preferred method of the invention for the hypothetical alignment of "BIGTOWNSOWN" with "BIGBROWNTOWNOWN".
Once the sum matrix is completed, the optimal alignment may be found by finding the highest scoring cell among all cells in the top row and left most column of the sum matrix, and then tracing back through the cells that led to this maximum scoring cell.
For this example, the optimal alignment begins in the top left cell and is highlighted in bold.
Arrows have been used to designate the gaps in the optimal alignment that are listed in the BRIDGEBULGE gap set. Note that the globally optimal alignment obtained in this case is different from the standard dynamic programming alignment obtained in Figure 6. The highest scoring alignment is shown in Figure 15 outside the context of the sum matrix in the widely used PIR format. From Figure 15, it is evident that the highest scoring alignment obtained in this example does not continuously align the residues from either the query sequence or the template sequence, since the bulge gap present in the final alignment leaves out residues in both sequences.
Preferred methods for determining BRIDGEBULGE penalties Methods for determining the gap opening and extension penalties in dynamic programming are well known in the art. A preferred method is to empirically tune these parameters to produce the optimal results for a large number of protein sequences where the optimal alignment is known. A common procedure is to compile the results for many different gap opening and extension penalty combinations then choose the parameters that perform the best over the test set. This procedure is taught for example, in B. Rost, R.
Schneider and C. Sander, J. Mol. Biol. 270, 471-480 (1997). When paramaterizing a standard dynamic programming procedure for optimizing sequence alignment, the two variables that must be parametized are the gap opening and gap extension penalties. In the methods according to the invention, in addition to the standard gap opening and gap penalty parameters, penalties for the BRIDGE/BULGE set gap opening and extension penalties must also be parameterized. These parameters can be tuned using the same methods used to determine the standard gap opening and extension penalties used for dynamic programming.
Preferred combination methods for determining three dimensional structures and family homologies Once an alignment is constructed between a query sequence and a protein structure template or templates, there are a variety of sequence homology modeling methods well known in the art for constructing the 3-dimensional structures of the query sequence. One widely used method is rigid-body assembly wherein the precise coordinates of the backbone residues of the template proteins are used as coordinates for the corresponding aligned residues in the query protein. I~. Brew, T.C. Vanaman, and R.C. Hill, J. Mol. Biol.
42, 65-86 (1969); T.L. Blundell, B.L. Sibanda, M. J. E. Sternberg, and J. M.
Thornton, Nature 326, 347-352 (1987); W. J. Browne, A.C.T. North, D. C. Phillips, J.
Green Proteins 7, 317-334 (1990). Another set of methods familiar to the art is segment-matching methods, which rely on the approximate coordinates of the atoms in the template proteins. T.H. Jones, S. Thirup, EMBO .l. 5, 819-822 (1986); M. Claessens, E.V. Cutsem, I. Lasters, S. Wodak, Protein Eng. 4, 335-345 (1989); R. Linger, D. Harel, S.
Wherland, J.L. Sussman, Proteins 5, 355-373 (1989); M. Levitt, J. Mol. Biol. 226, 507-533 (1992)).
Yet another group of methods does not explicitly use the coordinates of the template proteins, but uses the templates to generate a set of inter-residue distance restraints used to create the query structure. Given the set of restraints, methods such as distance geometry or energy optimization techniques are used to generate a structure for the query that satisfies all of the restraints. T.F. Havel and M.E. Snow, J. Mol. Biol. 217, 1-7 (1991);
Figure 12 shows the sum matrix at an even further stage of development with the bottom twelve rows completed. As above, the gray shaded matrix cells are the positions considered when determining the score in the black shaded cell. In this case, the highest score comes from the dark gray shaded cell that is in the BRIDGEBULGE gap set.
Figure 13, shows the GAP penalties that are used in Equation 2 for the gray cells that are alignment candidates for the black-shaded cell from Figure 12. The transition from the darker gray cell to the° black cell is in the, BRIDGEBULGE gap set and is thus has a gap penalty of 1. ' Figure 1 ~ shows a sum matrix according to a preferred method of the invention for the hypothetical alignment of "BIGTOWNSOWN" with "BIGBROWNTOWNOWN".
Once the sum matrix is completed, the optimal alignment may be found by finding the highest scoring cell among all cells in the top row and left most column of the sum matrix, and then tracing back through the cells that led to this maximum scoring cell.
For this example, the optimal alignment begins in the top left cell and is highlighted in bold.
Arrows have been used to designate the gaps in the optimal alignment that are listed in the BRIDGEBULGE gap set. Note that the globally optimal alignment obtained in this case is different from the standard dynamic programming alignment obtained in Figure 6. The highest scoring alignment is shown in Figure 15 outside the context of the sum matrix in the widely used PIR format. From Figure 15, it is evident that the highest scoring alignment obtained in this example does not continuously align the residues from either the query sequence or the template sequence, since the bulge gap present in the final alignment leaves out residues in both sequences.
Preferred methods for determining BRIDGEBULGE penalties Methods for determining the gap opening and extension penalties in dynamic programming are well known in the art. A preferred method is to empirically tune these parameters to produce the optimal results for a large number of protein sequences where the optimal alignment is known. A common procedure is to compile the results for many different gap opening and extension penalty combinations then choose the parameters that perform the best over the test set. This procedure is taught for example, in B. Rost, R.
Schneider and C. Sander, J. Mol. Biol. 270, 471-480 (1997). When paramaterizing a standard dynamic programming procedure for optimizing sequence alignment, the two variables that must be parametized are the gap opening and gap extension penalties. In the methods according to the invention, in addition to the standard gap opening and gap penalty parameters, penalties for the BRIDGE/BULGE set gap opening and extension penalties must also be parameterized. These parameters can be tuned using the same methods used to determine the standard gap opening and extension penalties used for dynamic programming.
Preferred combination methods for determining three dimensional structures and family homologies Once an alignment is constructed between a query sequence and a protein structure template or templates, there are a variety of sequence homology modeling methods well known in the art for constructing the 3-dimensional structures of the query sequence. One widely used method is rigid-body assembly wherein the precise coordinates of the backbone residues of the template proteins are used as coordinates for the corresponding aligned residues in the query protein. I~. Brew, T.C. Vanaman, and R.C. Hill, J. Mol. Biol.
42, 65-86 (1969); T.L. Blundell, B.L. Sibanda, M. J. E. Sternberg, and J. M.
Thornton, Nature 326, 347-352 (1987); W. J. Browne, A.C.T. North, D. C. Phillips, J.
Green Proteins 7, 317-334 (1990). Another set of methods familiar to the art is segment-matching methods, which rely on the approximate coordinates of the atoms in the template proteins. T.H. Jones, S. Thirup, EMBO .l. 5, 819-822 (1986); M. Claessens, E.V. Cutsem, I. Lasters, S. Wodak, Protein Eng. 4, 335-345 (1989); R. Linger, D. Harel, S.
Wherland, J.L. Sussman, Proteins 5, 355-373 (1989); M. Levitt, J. Mol. Biol. 226, 507-533 (1992)).
Yet another group of methods does not explicitly use the coordinates of the template proteins, but uses the templates to generate a set of inter-residue distance restraints used to create the query structure. Given the set of restraints, methods such as distance geometry or energy optimization techniques are used to generate a structure for the query that satisfies all of the restraints. T.F. Havel and M.E. Snow, J. Mol. Biol. 217, 1-7 (1991);
S.M. Brockelhurst, R.N. Perham, Prot. Science 2, 626-639 (1993); A. Sali and T.
Blundell, J. Mol. Biol. 234, 779-815 (1993); S. Srinivasan, C. J. March, and S.
Sudarsaman, Protein Eng. 6, 501-512 (1993); A. Aszodi and W.R. Taylor, Folding Design 1, 325-34 (1996)]. It is widely known in the art that the accuracy and precision of each of the three classes of algorithms is similar for a given query-template alignment.
The methods of the present invention may also be used to determine relative homology relationships between a plurality of query sequences. A preferred method for determining the relative homology relationships between a plurality of query sequences comprises determining an optimal alignment score of each query sequence against one or more template sequence and determining a relative homology between the query sequences by comparing the preferred alignment scores. Query sequences with alignment scores to one or more of the same template sequences may be considered more closely related than query sequences with more divergent alignment scores.
Advantages to the preferred methods of the invention relative to current methodologies In the preferred methods, an optimal sequence alignment between v a query sequence and a template sequence is determined by reference to whether a proposed bridge or bulge has precedence in nature. Because every bridge and bulge gap used in constructing the alignment exists within the three-dimensional database, it is known that all of the gaps can be satisfied by a three-dimensional protein model void of molecular geometry violations (i.e., the gaps are physical).
Furthermore, because the preferred methods use the bridge and bulge information from known structures, appropriate conformations for long bridge and bulge gaps already exist among the sequences in the PDB. This represents an enormous benefit over current state-of the art methods. For example, in the alignments produced by the MODELLER
program, the only way all of the residues in a query sequence will have a structural template is if enough structural templates are included so that all of the different loop length variations are considered. With the methods of the present invention, the structural templates required to achieve such a task are pre-determined, before the final consensus alignment process begins. This leads to much more accurate predictions in gapped regions, since loop building by ab initio or database search methods is rarely required (such methods commonly lead to poorly modeled or miss-oriented structural regions).
These enhancements are summarized in Table 3.
In the following examples, the methods of the current invention will be compared against the state-of the-art alignment techniques to solve various structural homology modeling problems.
Example 3 Example 3 tests the methods of the invention relative to the PSI-BLAST
algorithm, S. F. Altschul, T. L. Madden, A. A. Schaffer et al., 25 Nucl. Acids Res., 3389-3402 (1997), to detect sequentially distant structural homologues. PSI-BLAST currently represents the state-of art in homology modeling programs. E. Lindahl and A. Elofsson, 295 J.
Mol.
Biol., 613-625 (2000). Using a test procedure outlined by Lindahl and Elofsson and a set of 27 known protein sequences, in this Example, each algorithm was tested to determine its relative ability to recognize structural neighbors with less than 25%
sequence homology at the family, superfamily, fold, and class levels of structural similarity (family being the closest relationship, fold being the weakest) as defined in the SCOP
protein database, A. G. Murzin, S. E. Brenner, T. Hubbard and C. Chothia, J. Mol.
Biol., 247, 536-540 (1995). All of the structural similarities in the test set also exist in the FSSP
database, Holm and Sander, 273 Science, 595-602 (1996), so that regions of high structural homology were ensured to exist even at the fold and class level of similarity.
Overall, there were 99 family, 171 superfamily, 184 fold, and 1931 class relationships in the test. The ability of the preferred methods and PSI-BLAST to recognize these relationships with an overall rank of 1, 5, and 10 (i.e. 0, 4, and 9 false positives) are shown in Table 4. These results demonstrate a dramatic increase in sequence recognition capabilities at the superfamily, fold and class similarity levels using the methods according to the invention.
Example 4 Example 4 demonstrates that the methods of the invention, in combination with widely available homology modeling packages, may be used to predict the three S dimensional structure of a query sequence. In this example S4 query sequences from the Mycoplasma genitalium genome cannot be assigned an accurate structural model using the state-of the-art alignment techniques in MODELLER, A. Bali and T. L. Blundell, J. Mol.
Biol., 234, 779-81S (1993) alone, were modeled using the alignment methods of the invention in combination with three dimensional structure generating portion of MODELLER. The results of this experiment are summarized in Table S. Table S
shows that when the methods of the invention are used to generate preferred sequence alignments and MODELLER is used to generate the three dimensional protein structures based on these preferred alignments, 35 out of the S4 sequences (65%), representing 8,800 previously unmodeled residues, were successfully modeled as judged by the pG
test, R.
1 S Sanchez and A. Bali, "Large-scale protein structure modeling of the Saccharomyces cerevisiae genome", Proc. Natl. Acad. Sci. USA, 9S, 13597-13602 (1998)], employing Z-scores from PROSAII, M. J. Sippl, Proteins, 17, 3SS-362 (1993).
These results show a clear improvement of the present methods over current alignment techniques, since for each of the 35 successfully modeled sequences, the state-of the-art, MODELLER program, failed. If these results are extrapolated to the entire Mycoplasrna genitalium genome; the methods of the invention will allow approximately 40,000 residues to be accurately, structurally modeled, representing more than 30% of the soluble protein residues. Since the present methods are equally applicable to any genome, the present methods should offer similar modeling improvements across all genomes, including the human genome.
Example 5 Example 5 demonstrates that the methods of the invention provide superior three dimensional structures to the methods of R. Sanchez and A. Sali and the ModBASE for the first 180 sequences in the Mycoplasma genitalium genome. R. Sanchez and A.
Sali, Bioinformatics, 15, 1060-1061 (1999). In this example, the three dimensional structures of the first 180 sequences in the Mycoplasma genitalitum genome are determined using the preferred alignment techniques of the invention in combination with the three dimensional structure generating capabilities of MODELLER. The results of this experiment and the results of Sanchez and Sali are shown in Table 6. The first column in Table 6 shows the actual number of residues of each sequence. The remaining two columns show the number of residues that were correctly modeled by the methods according to the invention (3d column from the left) and the methods according to Sanchez and Sali (Far Right-hand Column). Substantially complete models containing at least 80% of the total sequence length are highlighted in bold. Structures generated by each method passed identical reliability tests. These tests are published (Sanchez and Sali 1998), and represent a threshold where the structures will have the correct fold with a confidence limit of > 95%.
#AA B. Seq. #AA
MG002 310 65 _ MG088 155140 137 -MGOIl 287 I15 - MG099 477190 MG014 623 175 - MG104 725120 _ -MGO15 589 200 - MG105 200' 139 -MG017 176 118 - MG106 226_ -MG021.512 511 - MG109 362288 -MG080 848 104 - MGi77 328304 60 Probably, the single most important benchmark for determining the efficacy of an alignment method, is the ability of that method to be used to predict substantially complete structural models-i.e. correctly modeling at least 80% of residues correctly.
The methods of the current invention modeled approximately 27% of the 180 Mycoplasma genitalitum sequences to least 80% accuracy, while ModBase only modeled 13% of the sequences to the same accuracy. Thus, the current alignment methods represent at least a two fold improvement over the current, state-of the-art, alignment methods.
Another important standard for gauging the effectiveness of an alignment method, is the ability of that method to be used to predict the structure of complete domains correctly. Once again, when the methods of the current invention were used to construct three dimensional models, complete domains were accurately modeled for 106 of the 180 sequences (59%), versus only 48 of the 180 sequences (27%) in ModBase.
A third metric for measuring the' effectiveness of an alignment method, is the ability of that method to be used to predict the three dimensional location of ~ any one residue in a structural model. Again, when the methods of the current invention were used to construct three dimensional models, the coordinates of nearly 22,000 of the estimated 50,000 (or approximately 44%) soluble protein residues were accurately located, while ModBase faired less than half as well with approximately 21% of the residues properly located.
Figure 16, shows a ribbon representation for MG001 based on the methods of the current invention used in combination with MODELLER. By contrast MODBASE only provides and incomplete, structural fragment, for the same sequence.
Example 6 Example 6 demonstrates that the methods of the invention, in combination with widely available homology modeling packages, may be used to predict accurate three dimensional structures at low sequence homologies . In this example consider the three dimensional structure of SC001 (orf YGL040C) from Brewer's yeast (Saccharomyces cerevisiae) is determined based upon a low homology template sequence. In order to build a BRIDGE/BULGE list, gapped-BLAST was used to determine a list of protein structures in the Protein Databank with similar sequences to the query sequence, SCOO1.
The 8 PDB similar structures that were found are shown in Table 7.
In order to further demonstrate the ability of the preferred alignment methods to generate accurate structures at low sequence homologies, the sequence lb4kA
(shown in Table 7) was used as a template sequence and to generate the BRIDGE/BULGE
list. The structure alignment between SCOO1 and lb4kA has a 35% sequence homology and a reliable structural model for sequence SC001 built from lb4kA is not present in MODBASE. Structure lb4kA is 326 residues long; there are 211 structurally aligned proteins in the FSSP file for lb4kA. These alignments yield 3444 possible bridges and bulges for this structure, some of which are shown below in Table 8.
The optimal sequence alignment between SC001 to lb4kA according to the methods of the invention is shown in PIR format in Figure 17. The gap penalties used for this alignment were gap opening and extension penalties of 10.0 and 1.5, respectively, with bridge and bulge opening and extension penalties of 1.0 and 0.3, respectively. These gaps penalties were determined by optimizing the alignment obtained for sets of known structures.
The PIR format alignment was then used as the alignment input for the MODELLER homology modeling software. The structure built by MODELLER using 5 this alignment is compared to the actual crystal structure of SC001, laws, in Figure 18 (laws is on the left, prediction on the right). The alpha-carbon CRMS is 2.11A
for 326 matched residues demonstrating that once again, the preferred alignment methods when used in combination with a homology modeling program were able to generate an accurate structural model when current methods failed.
10 Example 7 Example 7 demonstrates that the methods of the invention, in combination with widely available homology modeling packages, may be used to predict accurate three-dimensional structures at sequence homologies well below 25%.
Consider the three dimensional structure of RXR retinoic acid receptor, chain A of 15 PDB code 1 dkf. For this structure, the protein was co-crystallized with oleic acid. A
xibbon diagram of the structure, showing the oleic acid ligand in space filling representation is shown in Figure 19. Figure 20 shows the STRUCTFAST alignment in PIR format between the sequence of ldkf (denoted as gi7766906) and the sequence of chain A of structure 1 a28, denoted 1 a28A. In total, 197 residues are aligned to the 20 template, and sequence identity is only 19%. Figure 21 shows a rainbow ribbon overlay between the predicted structure and the crystal structure of chain A of 1 dkf.
The alpha-carbon CRMS for the best aligning 158 residues (80% of the complete 197 residues) is 1.6 A. Figure 22 shows an overlay of the predicted structure (darker) and crystal structure (lighter) for the 22 key residues that form the oleic acid binding pocket. The backbone 25 atoms in these 22 residues overlay to 1.7t~,, and all of the heavy atoms in the residues, including the sidechain atoms, overlay to 2.2~.
Consider the three dimensional structure of an estrogen receptor, chain A of PDB
code 1 a52. For this structure, the protein was co-crystallized as a dimer with estradiol. A
stick diagram of the structure, showing the estradiol ligands in space filling representation 30 is shown in Figure 23. Figure 24 shows the alignment according to the methods of the invention, in PIR format, between the sequence of the estrogen receptor (denoted as gi3659931) and the sequence of chain A of structure 1a28, denoted 1a28A. In total, 241 residues are aligned to the template, and sequence identity is 23%. Figure 25 shows a rainbow ribbon overlay between the predicted structure according to the methods of the invention of the estrogen receptor and the crystal structure of chain A of 1 a52. The alpha-carbon CRMS for the best aligning 193 residues (80% of the complete 241 residues) is 1.9 ~. Figure 26 shows an overlay of the predicted structure (darker) and crystal structure (lighter) for the 19 key residues that form the estradiol binding pocket. The backbone atoms in these 19 residues overlay to 0.8r~, and all of the heavy atoms in the residues, including the side-chain atoms, overlay to 1.8~..
Example 8 Example 8 demonstrates that the methods of the invention, in combination with widely available homology modeling packages, may be used to predict accurate three-dimensional structures of proteins located in the cell membrane at low sequence homology.
Figure 27 shows the alignment, in PIR format, between the sequence of halorhodopsin, denoted 1e12A, and the sequence of bacteriorhodopsin, denoted lc3wA
made by the methods according to the invention. In total, 233 residues are aligned to the template, and the sequence identity is 32%. Figure 28 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in figure 27, compared to the halorhodopsin crystal structure, chain A of PDB code 1e12. The alpha-carbon CRMS for the best aligning 187 residues (80% of the complete 233 residues) is 0.91 A.
Figure 29 shows the alignment formed from the methods according to the invention in PIR format, between the sequence of bacteriorhodopsin, denoted lc3wA, and the sequence of rhodposin, chain A of PDB structure 1f88, denoted 1f88A. In total, 214 residues are aligned to the template, and the sequence identity is only 13%.
Figure 30 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in figure 29, compared to the bacteriorhodopsin crystal structure, chain A of PDB code lc3w. The alpha-carbon CRMS for the best aligning 172 residues (80%
of the complete 214 residues) is 5.24 ~.
Figure 31 shows the alignment, formed from the method according to the invention, in PIR format, between the sequence of a membrane spanning chain of the photosynthetic reaction center, denoted 6prcM, and the sequence of a different chain from the photosynthetic reaction center, chain L of PDB structure 6prc, denoted 6prcL. In total, 259 residues are aligned to the template, and the sequence identity is 28%.
Figure 32 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in Figure 31, compared to the crystal structure for chain M of PDB
code 6prc.
The alpha-carbon CRMS for the best aligning 207 residues (80% of the complete residues) is 1.00 ~.
Figure 33 shows the alignment, according to the methods of the invention, in PIR
format, between the sequence of ompA, denoted lbxwA, and the sequence of ompX, chain A of PDB structure 1 qj 8, denoted 1 qj 8A. In total, 153 residues are aligned to the template, and the sequence identity is only 21 %. Figure 34 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in figure 33, compared to the ompA crystal structure, chain A of PDB code lbxw. The alpha-carbon CRMS for the best aligning 172 residues (80% of the complete 214 residues) is 2.59 ~.
Figure 35 shows the alignment, according to the methods of the invention,. in PIR
format, between the sequence of ompK36, denoted losm.A, and the sequence of porin protein 2por. In total, 323 residues are aligned to the template, and the sequence identity is only 12%. Figure 36 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in figure 35, compared to the ompK36 crystal structure, chain A of PDB code 1 osm. The alpha-carbon CRMS for the best aligning 259 residues (80% of the complete 323 residues) is 3.11 A.
Figure 37 shows the alignment, formed from the methods according to the invention, in PIR format, between the sequence of sucrose-specific porin, denoted 1 aOtP, and the sequence of maltoporin, chain A of PDB structure 2mpr, denoted 2mprA.
In total, 410 residues are aligned to the template, and the sequence identity is 21%.
Figure 38 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in figure 37, compared to the sucrose-specific porin crystal structure, chain P of PDB code laOtP. The alpha-carbon CRMS for the best aligning 328 residues (80%
of the complete 410 residues) is 2.26 ~.
Although the invention has been described with reference to preferred embodiments and specific examples, it will be readily appreciated by those skilled in the art that many modifications and adaptations of the invention axe possible without deviating from the spirit and scope of the invention. Thus, it is to be clearly understood that this description is made only by way of example and not as a limitation on the scope of the invention as claimed below.
Blundell, J. Mol. Biol. 234, 779-815 (1993); S. Srinivasan, C. J. March, and S.
Sudarsaman, Protein Eng. 6, 501-512 (1993); A. Aszodi and W.R. Taylor, Folding Design 1, 325-34 (1996)]. It is widely known in the art that the accuracy and precision of each of the three classes of algorithms is similar for a given query-template alignment.
The methods of the present invention may also be used to determine relative homology relationships between a plurality of query sequences. A preferred method for determining the relative homology relationships between a plurality of query sequences comprises determining an optimal alignment score of each query sequence against one or more template sequence and determining a relative homology between the query sequences by comparing the preferred alignment scores. Query sequences with alignment scores to one or more of the same template sequences may be considered more closely related than query sequences with more divergent alignment scores.
Advantages to the preferred methods of the invention relative to current methodologies In the preferred methods, an optimal sequence alignment between v a query sequence and a template sequence is determined by reference to whether a proposed bridge or bulge has precedence in nature. Because every bridge and bulge gap used in constructing the alignment exists within the three-dimensional database, it is known that all of the gaps can be satisfied by a three-dimensional protein model void of molecular geometry violations (i.e., the gaps are physical).
Furthermore, because the preferred methods use the bridge and bulge information from known structures, appropriate conformations for long bridge and bulge gaps already exist among the sequences in the PDB. This represents an enormous benefit over current state-of the art methods. For example, in the alignments produced by the MODELLER
program, the only way all of the residues in a query sequence will have a structural template is if enough structural templates are included so that all of the different loop length variations are considered. With the methods of the present invention, the structural templates required to achieve such a task are pre-determined, before the final consensus alignment process begins. This leads to much more accurate predictions in gapped regions, since loop building by ab initio or database search methods is rarely required (such methods commonly lead to poorly modeled or miss-oriented structural regions).
These enhancements are summarized in Table 3.
In the following examples, the methods of the current invention will be compared against the state-of the-art alignment techniques to solve various structural homology modeling problems.
Example 3 Example 3 tests the methods of the invention relative to the PSI-BLAST
algorithm, S. F. Altschul, T. L. Madden, A. A. Schaffer et al., 25 Nucl. Acids Res., 3389-3402 (1997), to detect sequentially distant structural homologues. PSI-BLAST currently represents the state-of art in homology modeling programs. E. Lindahl and A. Elofsson, 295 J.
Mol.
Biol., 613-625 (2000). Using a test procedure outlined by Lindahl and Elofsson and a set of 27 known protein sequences, in this Example, each algorithm was tested to determine its relative ability to recognize structural neighbors with less than 25%
sequence homology at the family, superfamily, fold, and class levels of structural similarity (family being the closest relationship, fold being the weakest) as defined in the SCOP
protein database, A. G. Murzin, S. E. Brenner, T. Hubbard and C. Chothia, J. Mol.
Biol., 247, 536-540 (1995). All of the structural similarities in the test set also exist in the FSSP
database, Holm and Sander, 273 Science, 595-602 (1996), so that regions of high structural homology were ensured to exist even at the fold and class level of similarity.
Overall, there were 99 family, 171 superfamily, 184 fold, and 1931 class relationships in the test. The ability of the preferred methods and PSI-BLAST to recognize these relationships with an overall rank of 1, 5, and 10 (i.e. 0, 4, and 9 false positives) are shown in Table 4. These results demonstrate a dramatic increase in sequence recognition capabilities at the superfamily, fold and class similarity levels using the methods according to the invention.
Example 4 Example 4 demonstrates that the methods of the invention, in combination with widely available homology modeling packages, may be used to predict the three S dimensional structure of a query sequence. In this example S4 query sequences from the Mycoplasma genitalium genome cannot be assigned an accurate structural model using the state-of the-art alignment techniques in MODELLER, A. Bali and T. L. Blundell, J. Mol.
Biol., 234, 779-81S (1993) alone, were modeled using the alignment methods of the invention in combination with three dimensional structure generating portion of MODELLER. The results of this experiment are summarized in Table S. Table S
shows that when the methods of the invention are used to generate preferred sequence alignments and MODELLER is used to generate the three dimensional protein structures based on these preferred alignments, 35 out of the S4 sequences (65%), representing 8,800 previously unmodeled residues, were successfully modeled as judged by the pG
test, R.
1 S Sanchez and A. Bali, "Large-scale protein structure modeling of the Saccharomyces cerevisiae genome", Proc. Natl. Acad. Sci. USA, 9S, 13597-13602 (1998)], employing Z-scores from PROSAII, M. J. Sippl, Proteins, 17, 3SS-362 (1993).
These results show a clear improvement of the present methods over current alignment techniques, since for each of the 35 successfully modeled sequences, the state-of the-art, MODELLER program, failed. If these results are extrapolated to the entire Mycoplasrna genitalium genome; the methods of the invention will allow approximately 40,000 residues to be accurately, structurally modeled, representing more than 30% of the soluble protein residues. Since the present methods are equally applicable to any genome, the present methods should offer similar modeling improvements across all genomes, including the human genome.
Example 5 Example 5 demonstrates that the methods of the invention provide superior three dimensional structures to the methods of R. Sanchez and A. Sali and the ModBASE for the first 180 sequences in the Mycoplasma genitalium genome. R. Sanchez and A.
Sali, Bioinformatics, 15, 1060-1061 (1999). In this example, the three dimensional structures of the first 180 sequences in the Mycoplasma genitalitum genome are determined using the preferred alignment techniques of the invention in combination with the three dimensional structure generating capabilities of MODELLER. The results of this experiment and the results of Sanchez and Sali are shown in Table 6. The first column in Table 6 shows the actual number of residues of each sequence. The remaining two columns show the number of residues that were correctly modeled by the methods according to the invention (3d column from the left) and the methods according to Sanchez and Sali (Far Right-hand Column). Substantially complete models containing at least 80% of the total sequence length are highlighted in bold. Structures generated by each method passed identical reliability tests. These tests are published (Sanchez and Sali 1998), and represent a threshold where the structures will have the correct fold with a confidence limit of > 95%.
#AA B. Seq. #AA
MG002 310 65 _ MG088 155140 137 -MGOIl 287 I15 - MG099 477190 MG014 623 175 - MG104 725120 _ -MGO15 589 200 - MG105 200' 139 -MG017 176 118 - MG106 226_ -MG021.512 511 - MG109 362288 -MG080 848 104 - MGi77 328304 60 Probably, the single most important benchmark for determining the efficacy of an alignment method, is the ability of that method to be used to predict substantially complete structural models-i.e. correctly modeling at least 80% of residues correctly.
The methods of the current invention modeled approximately 27% of the 180 Mycoplasma genitalitum sequences to least 80% accuracy, while ModBase only modeled 13% of the sequences to the same accuracy. Thus, the current alignment methods represent at least a two fold improvement over the current, state-of the-art, alignment methods.
Another important standard for gauging the effectiveness of an alignment method, is the ability of that method to be used to predict the structure of complete domains correctly. Once again, when the methods of the current invention were used to construct three dimensional models, complete domains were accurately modeled for 106 of the 180 sequences (59%), versus only 48 of the 180 sequences (27%) in ModBase.
A third metric for measuring the' effectiveness of an alignment method, is the ability of that method to be used to predict the three dimensional location of ~ any one residue in a structural model. Again, when the methods of the current invention were used to construct three dimensional models, the coordinates of nearly 22,000 of the estimated 50,000 (or approximately 44%) soluble protein residues were accurately located, while ModBase faired less than half as well with approximately 21% of the residues properly located.
Figure 16, shows a ribbon representation for MG001 based on the methods of the current invention used in combination with MODELLER. By contrast MODBASE only provides and incomplete, structural fragment, for the same sequence.
Example 6 Example 6 demonstrates that the methods of the invention, in combination with widely available homology modeling packages, may be used to predict accurate three dimensional structures at low sequence homologies . In this example consider the three dimensional structure of SC001 (orf YGL040C) from Brewer's yeast (Saccharomyces cerevisiae) is determined based upon a low homology template sequence. In order to build a BRIDGE/BULGE list, gapped-BLAST was used to determine a list of protein structures in the Protein Databank with similar sequences to the query sequence, SCOO1.
The 8 PDB similar structures that were found are shown in Table 7.
In order to further demonstrate the ability of the preferred alignment methods to generate accurate structures at low sequence homologies, the sequence lb4kA
(shown in Table 7) was used as a template sequence and to generate the BRIDGE/BULGE
list. The structure alignment between SCOO1 and lb4kA has a 35% sequence homology and a reliable structural model for sequence SC001 built from lb4kA is not present in MODBASE. Structure lb4kA is 326 residues long; there are 211 structurally aligned proteins in the FSSP file for lb4kA. These alignments yield 3444 possible bridges and bulges for this structure, some of which are shown below in Table 8.
The optimal sequence alignment between SC001 to lb4kA according to the methods of the invention is shown in PIR format in Figure 17. The gap penalties used for this alignment were gap opening and extension penalties of 10.0 and 1.5, respectively, with bridge and bulge opening and extension penalties of 1.0 and 0.3, respectively. These gaps penalties were determined by optimizing the alignment obtained for sets of known structures.
The PIR format alignment was then used as the alignment input for the MODELLER homology modeling software. The structure built by MODELLER using 5 this alignment is compared to the actual crystal structure of SC001, laws, in Figure 18 (laws is on the left, prediction on the right). The alpha-carbon CRMS is 2.11A
for 326 matched residues demonstrating that once again, the preferred alignment methods when used in combination with a homology modeling program were able to generate an accurate structural model when current methods failed.
10 Example 7 Example 7 demonstrates that the methods of the invention, in combination with widely available homology modeling packages, may be used to predict accurate three-dimensional structures at sequence homologies well below 25%.
Consider the three dimensional structure of RXR retinoic acid receptor, chain A of 15 PDB code 1 dkf. For this structure, the protein was co-crystallized with oleic acid. A
xibbon diagram of the structure, showing the oleic acid ligand in space filling representation is shown in Figure 19. Figure 20 shows the STRUCTFAST alignment in PIR format between the sequence of ldkf (denoted as gi7766906) and the sequence of chain A of structure 1 a28, denoted 1 a28A. In total, 197 residues are aligned to the 20 template, and sequence identity is only 19%. Figure 21 shows a rainbow ribbon overlay between the predicted structure and the crystal structure of chain A of 1 dkf.
The alpha-carbon CRMS for the best aligning 158 residues (80% of the complete 197 residues) is 1.6 A. Figure 22 shows an overlay of the predicted structure (darker) and crystal structure (lighter) for the 22 key residues that form the oleic acid binding pocket. The backbone 25 atoms in these 22 residues overlay to 1.7t~,, and all of the heavy atoms in the residues, including the sidechain atoms, overlay to 2.2~.
Consider the three dimensional structure of an estrogen receptor, chain A of PDB
code 1 a52. For this structure, the protein was co-crystallized as a dimer with estradiol. A
stick diagram of the structure, showing the estradiol ligands in space filling representation 30 is shown in Figure 23. Figure 24 shows the alignment according to the methods of the invention, in PIR format, between the sequence of the estrogen receptor (denoted as gi3659931) and the sequence of chain A of structure 1a28, denoted 1a28A. In total, 241 residues are aligned to the template, and sequence identity is 23%. Figure 25 shows a rainbow ribbon overlay between the predicted structure according to the methods of the invention of the estrogen receptor and the crystal structure of chain A of 1 a52. The alpha-carbon CRMS for the best aligning 193 residues (80% of the complete 241 residues) is 1.9 ~. Figure 26 shows an overlay of the predicted structure (darker) and crystal structure (lighter) for the 19 key residues that form the estradiol binding pocket. The backbone atoms in these 19 residues overlay to 0.8r~, and all of the heavy atoms in the residues, including the side-chain atoms, overlay to 1.8~..
Example 8 Example 8 demonstrates that the methods of the invention, in combination with widely available homology modeling packages, may be used to predict accurate three-dimensional structures of proteins located in the cell membrane at low sequence homology.
Figure 27 shows the alignment, in PIR format, between the sequence of halorhodopsin, denoted 1e12A, and the sequence of bacteriorhodopsin, denoted lc3wA
made by the methods according to the invention. In total, 233 residues are aligned to the template, and the sequence identity is 32%. Figure 28 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in figure 27, compared to the halorhodopsin crystal structure, chain A of PDB code 1e12. The alpha-carbon CRMS for the best aligning 187 residues (80% of the complete 233 residues) is 0.91 A.
Figure 29 shows the alignment formed from the methods according to the invention in PIR format, between the sequence of bacteriorhodopsin, denoted lc3wA, and the sequence of rhodposin, chain A of PDB structure 1f88, denoted 1f88A. In total, 214 residues are aligned to the template, and the sequence identity is only 13%.
Figure 30 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in figure 29, compared to the bacteriorhodopsin crystal structure, chain A of PDB code lc3w. The alpha-carbon CRMS for the best aligning 172 residues (80%
of the complete 214 residues) is 5.24 ~.
Figure 31 shows the alignment, formed from the method according to the invention, in PIR format, between the sequence of a membrane spanning chain of the photosynthetic reaction center, denoted 6prcM, and the sequence of a different chain from the photosynthetic reaction center, chain L of PDB structure 6prc, denoted 6prcL. In total, 259 residues are aligned to the template, and the sequence identity is 28%.
Figure 32 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in Figure 31, compared to the crystal structure for chain M of PDB
code 6prc.
The alpha-carbon CRMS for the best aligning 207 residues (80% of the complete residues) is 1.00 ~.
Figure 33 shows the alignment, according to the methods of the invention, in PIR
format, between the sequence of ompA, denoted lbxwA, and the sequence of ompX, chain A of PDB structure 1 qj 8, denoted 1 qj 8A. In total, 153 residues are aligned to the template, and the sequence identity is only 21 %. Figure 34 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in figure 33, compared to the ompA crystal structure, chain A of PDB code lbxw. The alpha-carbon CRMS for the best aligning 172 residues (80% of the complete 214 residues) is 2.59 ~.
Figure 35 shows the alignment, according to the methods of the invention,. in PIR
format, between the sequence of ompK36, denoted losm.A, and the sequence of porin protein 2por. In total, 323 residues are aligned to the template, and the sequence identity is only 12%. Figure 36 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in figure 35, compared to the ompK36 crystal structure, chain A of PDB code 1 osm. The alpha-carbon CRMS for the best aligning 259 residues (80% of the complete 323 residues) is 3.11 A.
Figure 37 shows the alignment, formed from the methods according to the invention, in PIR format, between the sequence of sucrose-specific porin, denoted 1 aOtP, and the sequence of maltoporin, chain A of PDB structure 2mpr, denoted 2mprA.
In total, 410 residues are aligned to the template, and the sequence identity is 21%.
Figure 38 shows a rainbow ribbon overlay between the three-dimensional structure created using the alignment in figure 37, compared to the sucrose-specific porin crystal structure, chain P of PDB code laOtP. The alpha-carbon CRMS for the best aligning 328 residues (80%
of the complete 410 residues) is 2.26 ~.
Although the invention has been described with reference to preferred embodiments and specific examples, it will be readily appreciated by those skilled in the art that many modifications and adaptations of the invention axe possible without deviating from the spirit and scope of the invention. Thus, it is to be clearly understood that this description is made only by way of example and not as a limitation on the scope of the invention as claimed below.
Claims (28)
1. A method for determining a preferred alignment between a query sequence and at least one template sequence comprising the steps of:
a. aligning at least two reference sequences to determine one or more BRIDGE/BULGE gaps;
b. determining at least one alignment score between the potential alignment of said query sequence and each said template sequence; wherein each said alignment score reflects whether said alignment between said query sequence and each said template sequence creates a BRIDGE/BULGE gap; and c. determining a preferred alignment between said query sequence and each said template sequence based on said alignment score.
a. aligning at least two reference sequences to determine one or more BRIDGE/BULGE gaps;
b. determining at least one alignment score between the potential alignment of said query sequence and each said template sequence; wherein each said alignment score reflects whether said alignment between said query sequence and each said template sequence creates a BRIDGE/BULGE gap; and c. determining a preferred alignment between said query sequence and each said template sequence based on said alignment score.
2. The method of claim 1 wherein said preferred alignment is the optimal alignment.
3. The method of claim 1 wherein step b comprises the steps of:
a. forming a sequence alignment similarity matrix for said query sequence and each said template sequence with matrix elements s i j; and b. determining a sequence alignment sum matrix with matrix elements S i j from the dynamic evolution of each said sequence alignment similarity matrix, wherein the matrix elements of each said sum matrix reflect whether or not any potential alignment gaps that may be formed from the alignment of said query sequence with each said template sequence creates a BRIDGE/BULGE gap.
a. forming a sequence alignment similarity matrix for said query sequence and each said template sequence with matrix elements s i j; and b. determining a sequence alignment sum matrix with matrix elements S i j from the dynamic evolution of each said sequence alignment similarity matrix, wherein the matrix elements of each said sum matrix reflect whether or not any potential alignment gaps that may be formed from the alignment of said query sequence with each said template sequence creates a BRIDGE/BULGE gap.
4. The method of claim 3 wherein step b comprises the steps of:
a. calculating said sequence alignment sum matrix from the dynamic evolution of each said sequence alignment similarity matrix, according to the equation:
S i j = s i j + Max{S i+J+1, j+2 td jmax - GAP, S i+2 to imax, j+2 - GAP, S
m,n -BRIDGE/BULGE}, wherein GAP represents the gap penalty for an alignment gap between said query sequence and each said template sequence, BRIDGEBULGE represents the penalty for a known bridge or bulge that begins at the m,n matrix element of said sum matrix and ends at the i,j matrix element of said sum matrix and Max{S
i+1,j+1, Si+1, j+2 to jmax - GAP, S i+2 to imax, j+2 - GAP, Sm,n - BRIDGE/BULGE} refers to the maximum value of the four terms contained within the brackets
a. calculating said sequence alignment sum matrix from the dynamic evolution of each said sequence alignment similarity matrix, according to the equation:
S i j = s i j + Max{S i+J+1, j+2 td jmax - GAP, S i+2 to imax, j+2 - GAP, S
m,n -BRIDGE/BULGE}, wherein GAP represents the gap penalty for an alignment gap between said query sequence and each said template sequence, BRIDGEBULGE represents the penalty for a known bridge or bulge that begins at the m,n matrix element of said sum matrix and ends at the i,j matrix element of said sum matrix and Max{S
i+1,j+1, Si+1, j+2 to jmax - GAP, S i+2 to imax, j+2 - GAP, Sm,n - BRIDGE/BULGE} refers to the maximum value of the four terms contained within the brackets
5. A method for determining a preferred alignment between a query sequence and at least one template sequence comprising the steps of:
a. aligning at least two reference sequences to determine at least one BRIDGE/BULGE gap;
b. forming a sequence alignment similarity matrix from said query sequence and each said template sequence;
c. determining a sequence alignment sum matrix from the dynamic evolution of each said sequence alignment similarity matrix, wherein the matrix elements of each said sum matrix reflect whether or not any potential alignment gaps that may be formed from the alignment of said query sequence with each said template sequence creates a BRIDGE/BULGE gap; and d. determining a preferred alignment between said query sequence and each said template sequence from said dynamic evolution of each said sum matrix.
a. aligning at least two reference sequences to determine at least one BRIDGE/BULGE gap;
b. forming a sequence alignment similarity matrix from said query sequence and each said template sequence;
c. determining a sequence alignment sum matrix from the dynamic evolution of each said sequence alignment similarity matrix, wherein the matrix elements of each said sum matrix reflect whether or not any potential alignment gaps that may be formed from the alignment of said query sequence with each said template sequence creates a BRIDGE/BULGE gap; and d. determining a preferred alignment between said query sequence and each said template sequence from said dynamic evolution of each said sum matrix.
6. The method of claim 5 wherein said preferred alignment is the optimal alignment.
7. A method for determining a preferred alignment between a query sequence and at least one template sequence comprising the steps of:
a. aligning at least two reference sequences to determine at least one BRIDGE/BULGE gap;
b. calculating a sequence alignment similarity matrix with matrix elements s i j for said query sequence and each said template sequence;
c. calculating a sequence alignment sum matrix with matrix elements S i j from the dynamic evolution of each said sequence alignment similarity matrix, according to the equation:
S i j = S i j + Max{S i+1,j+1, Si+1, j+2 to jmax - GAP, S i+2 to imax, j+2 -GAP, S m,n -BRIDGE/BULGE}, wherein GAP represents the gap penalty for an alignment gap between said query sequence and each said template sequence, BRIDGE/BULGE represents the penalty for a known bridge or bulge that begins at the m,n matrix element of said sum matrix and ends at the i,j matrix element of said sum matrix and Max{S
i+1, j+1, S i+1, j+2 to jmax - GAP, S i+2 to imax, j+2 - GAP, S m,n - BRIDGE/BULGE}
refers to the maximum value of the four terms contained within the brackets; and d. determining a preferred alignment between said query sequence and each said template sequence from the dynamic evolution of said sum matrix.
a. aligning at least two reference sequences to determine at least one BRIDGE/BULGE gap;
b. calculating a sequence alignment similarity matrix with matrix elements s i j for said query sequence and each said template sequence;
c. calculating a sequence alignment sum matrix with matrix elements S i j from the dynamic evolution of each said sequence alignment similarity matrix, according to the equation:
S i j = S i j + Max{S i+1,j+1, Si+1, j+2 to jmax - GAP, S i+2 to imax, j+2 -GAP, S m,n -BRIDGE/BULGE}, wherein GAP represents the gap penalty for an alignment gap between said query sequence and each said template sequence, BRIDGE/BULGE represents the penalty for a known bridge or bulge that begins at the m,n matrix element of said sum matrix and ends at the i,j matrix element of said sum matrix and Max{S
i+1, j+1, S i+1, j+2 to jmax - GAP, S i+2 to imax, j+2 - GAP, S m,n - BRIDGE/BULGE}
refers to the maximum value of the four terms contained within the brackets; and d. determining a preferred alignment between said query sequence and each said template sequence from the dynamic evolution of said sum matrix.
8. The method of claim 7 wherein said preferred alignment is an optimal alignment.
9. A method for determining a preferred aligmnent between at least one query sequence and at least one template sequence, for use in primary sequence homology modeling methods, comprising the steps of:
a. aligning at least two reference sequences to determine one or more BRIDGE/BULGE gaps;
b. determining at least one alignment score for the potential alignment of each said query sequence and each said template sequence; wherein each said alignment score reflects whether said alignment between each aid query sequence and each said template sequence creates a BRIDGE/BULGE gap; and c. determining a preferred alignment between each said query sequence and each said template sequence based on said alignment scores, wherein said preferred alignment contains from approximately 10% to approximately 20%
homologous residues.
a. aligning at least two reference sequences to determine one or more BRIDGE/BULGE gaps;
b. determining at least one alignment score for the potential alignment of each said query sequence and each said template sequence; wherein each said alignment score reflects whether said alignment between each aid query sequence and each said template sequence creates a BRIDGE/BULGE gap; and c. determining a preferred alignment between each said query sequence and each said template sequence based on said alignment scores, wherein said preferred alignment contains from approximately 10% to approximately 20%
homologous residues.
10. The method of claim 9 wherein said preferred alignment is the optimal alignment.
11. The method of claim 9 wherein said primary sequence homology method is a method for determining the three dimensional structure of said query sequence.
12. The method of claim 10 wherein said primary sequence homology modeling method is a method for determining the three dimensional structure of said query sequence.
13. The method of claim 9 wherein said primary sequence homology modeling method is a method for determining the primary sequence homology relationship between at least two query sequences.
14. The method of claim 10 wherein said primary sequence homology modeling method is a method for determining the sequence homology relationship between at least two query sequences.
15. A method for determining a preferred alignment between at least one query sequence and at least one template sequence, for use in primary sequence homology modeling methods, comprising the steps of:
a. aligning at Least two reference sequences to determine at least one BRIDGE/BULGE gap;
b. forming a sequence alignment similarity matrix for each said query sequence and each said template sequence;
c. determining a sequence alignment sum matrix from the dynamic evolution of each said sequence alignment similarity matrix, wherein the matrix elements of each said sum matrix reflect whether or not any potential alignment gaps that may be formed from the alignment of each said query sequence with each said template sequence creates a BRIDGE/BULGE gap; and d. determining a preferred alignment between each said query sequence and each said template sequence from said dynamic evolution of each said sum matrix, wherein said preferred alignment contains from approximately 10% to approximately 20% homologous residues.
a. aligning at Least two reference sequences to determine at least one BRIDGE/BULGE gap;
b. forming a sequence alignment similarity matrix for each said query sequence and each said template sequence;
c. determining a sequence alignment sum matrix from the dynamic evolution of each said sequence alignment similarity matrix, wherein the matrix elements of each said sum matrix reflect whether or not any potential alignment gaps that may be formed from the alignment of each said query sequence with each said template sequence creates a BRIDGE/BULGE gap; and d. determining a preferred alignment between each said query sequence and each said template sequence from said dynamic evolution of each said sum matrix, wherein said preferred alignment contains from approximately 10% to approximately 20% homologous residues.
16. The method of claim 15 wherein said preferred alignment is the optimal alignment.
17. The method of claim 15 wherein said primary sequence homology method is a method for determining the three dimensional structure of said query sequence.
18. The method of claim 16 wherein said primary sequence homology modeling method is a method for determining the three dimensional structure of said query sequence.
19. The method of claim 15 wherein said primary sequence homology modeling method is a method for determining the primary sequence homology relationship between at least two query sequences.
20. The method of claim 16 wherein said primary sequence homology modeling method is a method for determining the primary sequence homology relationship between at least two query sequences.
21. A method for determining a preferred alignment between at least one query sequence and at least one template sequence, for use in primary sequence homology modeling methods, comprising the steps of:
a. aligning at least two reference sequences to determine at least one BRIDGE/BULGE gap;
b. calculating a sequence alignment similarity matrix with matrix elements s i j for each said query sequence and each said template sequence;
c. calculating a sequence alignment sum matrix with matrix elements S i j from the dynamic evolution of each said sequence alignment similarity matrix, according to the equation:
S i j = S i j + Max{S i+1, j+1, Si+1, j+2 to jmax - GAP, S i+2 to imax, j+2 -GAP, S m,n -BRIDGE/BULGE}, wherein GAP represents the gap penalty for an alignment gap between said query sequence and each said template sequence, BRIDGE/BULGE represents the penalty for a known bridge or bulge that begins at the m,n matrix element of said sum matrix and ends at the i,j matrix element of said sum matrix and Max {S
i+1,j+1, Si+1,j+2 to jmax - GAP S i+2 to imax, j+2 - GAP, S m,n - BRIDGE/BULGE} refers to the maximum value of the four terms contained within the brackets; and d. determining a preferred alignment between each said query sequence and each said template sequence from the dynamic evolution of said sum matrix; wherein said preferred alignment contains from approximately 10% to approximately 20% homologous residues.
a. aligning at least two reference sequences to determine at least one BRIDGE/BULGE gap;
b. calculating a sequence alignment similarity matrix with matrix elements s i j for each said query sequence and each said template sequence;
c. calculating a sequence alignment sum matrix with matrix elements S i j from the dynamic evolution of each said sequence alignment similarity matrix, according to the equation:
S i j = S i j + Max{S i+1, j+1, Si+1, j+2 to jmax - GAP, S i+2 to imax, j+2 -GAP, S m,n -BRIDGE/BULGE}, wherein GAP represents the gap penalty for an alignment gap between said query sequence and each said template sequence, BRIDGE/BULGE represents the penalty for a known bridge or bulge that begins at the m,n matrix element of said sum matrix and ends at the i,j matrix element of said sum matrix and Max {S
i+1,j+1, Si+1,j+2 to jmax - GAP S i+2 to imax, j+2 - GAP, S m,n - BRIDGE/BULGE} refers to the maximum value of the four terms contained within the brackets; and d. determining a preferred alignment between each said query sequence and each said template sequence from the dynamic evolution of said sum matrix; wherein said preferred alignment contains from approximately 10% to approximately 20% homologous residues.
22. The method of claim 21 wherein said preferred alignment is the optimal alignment.
23. The method of claim 21 wherein said primary sequence homology modeling method is a method for determining the three dimensional structure of said query sequence.
24. The method of claim 22 wherein said primary sequence homology modeling method is a method for determining the three dimensional structure of said query sequence.
25. The method of claim 21 wherein said primary sequence homology modeling method is a method for determining the primary sequence homology relationship between at least two query sequences.
26. The method of claim 22 wherein said primary sequence homology modeling method is a method for determining the primary sequence homology relationship between at least two query sequences.
27 A method for determining the three dimensional structure of a query sequence based upon primary sequence homology modeling with at least one template sequence, wherein, said alignment between said query sequence and said template sequence is determined by the methods of claim 2, claim 6, claim 8, claim 12, claim 20 and claim 24.
28. A method for determining the primary sequence homology relationship between at least two query sequences based upon primary sequence homology modeling with at least one template sequence, wherein, said alignment between said query sequence and said template sequence is determined by the methods of claim 2, claim 6, claim 8, claim 14, claim 22, and claim 26.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US21801600P | 2000-07-12 | 2000-07-12 | |
| US60/218,016 | 2000-07-12 | ||
| PCT/US2001/022095 WO2002004685A1 (en) | 2000-07-12 | 2001-07-12 | Method for determining three-dimensional protein structure from primary protein sequence |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2415787A1 true CA2415787A1 (en) | 2002-01-17 |
Family
ID=22813417
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002415787A Abandoned CA2415787A1 (en) | 2000-07-12 | 2001-07-12 | Method for determining three-dimensional protein structure from primary protein sequence |
Country Status (12)
| Country | Link |
|---|---|
| US (1) | US20020150906A1 (en) |
| EP (1) | EP1301636A4 (en) |
| JP (1) | JP2004503038A (en) |
| KR (1) | KR20030043908A (en) |
| CN (1) | CN1447862A (en) |
| AU (1) | AU2002218775A1 (en) |
| BR (1) | BR0112448A (en) |
| CA (1) | CA2415787A1 (en) |
| IL (1) | IL153760A0 (en) |
| MX (1) | MXPA03000394A (en) |
| WO (1) | WO2002004685A1 (en) |
| ZA (1) | ZA200300291B (en) |
Families Citing this family (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1696038B1 (en) * | 1999-05-05 | 2010-06-02 | Phylogica Limited | Isolating biological modulators from biodiverse gene fragment libraries |
| US7270969B2 (en) | 1999-05-05 | 2007-09-18 | Phylogica Limited | Methods of constructing and screening diverse expression libraries |
| US7803765B2 (en) * | 1999-05-05 | 2010-09-28 | Phylogica Limited | Methods of constructing biodiverse gene fragment libraries and biological modulators isolated therefrom |
| US20060036374A1 (en) * | 2000-07-12 | 2006-02-16 | Debe Derek A | Method for determining three-dimensional protein structure from primary protein sequence |
| US6988039B2 (en) * | 2003-02-14 | 2006-01-17 | Eidogen, Inc. | Method for determining sequence alignment significance |
| US8024127B2 (en) | 2003-02-27 | 2011-09-20 | Lawrence Livermore National Security, Llc | Local-global alignment for finding 3D similarities in protein structures |
| CA2568644C (en) * | 2004-06-03 | 2015-11-24 | Phylogica Limited | Peptide modulators of cellular phenotype and bi-nucleic acid fragment library |
| KR100598606B1 (en) * | 2004-12-06 | 2006-07-07 | 한국전자통신연구원 | Protein structure search system and search method of protein structure |
| WO2007097923A2 (en) | 2006-02-20 | 2007-08-30 | Phylogica Limited | Method of constructing and screening libraries of peptide structures |
| US20070244652A1 (en) * | 2006-04-14 | 2007-10-18 | Zhou Carol L Ecale | Structure Based Analysis For Identification Of Protein Signatures: PSCORE |
| US20070244651A1 (en) * | 2006-04-14 | 2007-10-18 | Zhou Carol E | Structure-Based Analysis For Identification Of Protein Signatures: CUSCORE |
| US20080059077A1 (en) * | 2006-06-12 | 2008-03-06 | The Regents Of The University Of California | Methods and systems of common motif and countermeasure discovery |
| US8467971B2 (en) * | 2006-08-07 | 2013-06-18 | Lawrence Livermore National Security, Llc | Structure based alignment and clustering of proteins (STRALCP) |
| EP2074138A4 (en) * | 2006-09-19 | 2009-12-30 | Phylogica Ltd | Neuroprotective peptide inhibitors of ap-1 signaling and uses therefor |
| US7983887B2 (en) | 2007-04-27 | 2011-07-19 | Ut-Battelle, Llc | Fast computational methods for predicting protein structure from primary amino acid sequence |
| US8822409B2 (en) * | 2007-06-20 | 2014-09-02 | Phylogica Limited | Compositions and uses thereof for the treatment of acute respiratory distress syndrome (ARDS) and clinical disorders associated with therewith |
| US8452542B2 (en) * | 2007-08-07 | 2013-05-28 | Lawrence Livermore National Security, Llc. | Structure-sequence based analysis for identification of conserved regions in proteins |
| CN101714187B (en) * | 2008-10-07 | 2011-09-28 | 中国科学院计算技术研究所 | Index acceleration method and corresponding system in scale protein identification |
| WO2011000054A1 (en) | 2009-07-03 | 2011-01-06 | Avipep Pty Ltd | Immuno-conjugates and methods for producing them |
| WO2011075786A1 (en) | 2009-12-23 | 2011-06-30 | Avipep Pty Ltd | Immuno-conjugates and methods for producing them 2 |
| CN105224825B (en) * | 2015-10-30 | 2018-03-06 | 景德镇陶瓷大学 | A kind of fusion is local and the RNA sequences of global characteristics describe method |
-
2001
- 2001-07-12 MX MXPA03000394A patent/MXPA03000394A/en not_active Application Discontinuation
- 2001-07-12 CA CA002415787A patent/CA2415787A1/en not_active Abandoned
- 2001-07-12 EP EP01984169A patent/EP1301636A4/en not_active Withdrawn
- 2001-07-12 AU AU2002218775A patent/AU2002218775A1/en not_active Abandoned
- 2001-07-12 US US09/905,176 patent/US20020150906A1/en not_active Abandoned
- 2001-07-12 WO PCT/US2001/022095 patent/WO2002004685A1/en active Application Filing
- 2001-07-12 BR BR0112448-0A patent/BR0112448A/en not_active IP Right Cessation
- 2001-07-12 JP JP2002509538A patent/JP2004503038A/en active Pending
- 2001-07-12 IL IL15376001A patent/IL153760A0/en unknown
- 2001-07-12 KR KR10-2003-7000455A patent/KR20030043908A/en not_active Application Discontinuation
- 2001-07-12 CN CN01814465A patent/CN1447862A/en active Pending
-
2003
- 2003-01-10 ZA ZA200300291A patent/ZA200300291B/en unknown
Also Published As
| Publication number | Publication date |
|---|---|
| BR0112448A (en) | 2003-09-23 |
| KR20030043908A (en) | 2003-06-02 |
| MXPA03000394A (en) | 2004-09-13 |
| EP1301636A1 (en) | 2003-04-16 |
| IL153760A0 (en) | 2003-07-06 |
| US20020150906A1 (en) | 2002-10-17 |
| CN1447862A (en) | 2003-10-08 |
| EP1301636A4 (en) | 2006-05-24 |
| JP2004503038A (en) | 2004-01-29 |
| WO2002004685A1 (en) | 2002-01-17 |
| AU2002218775A1 (en) | 2002-01-21 |
| ZA200300291B (en) | 2004-01-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20020150906A1 (en) | Method for determining three-dimensional protein structure from primary protein sequence | |
| Pearce et al. | Deep learning techniques have significantly impacted protein structure prediction and protein design | |
| Kolodny et al. | Small libraries of protein fragments model native protein structures accurately | |
| Sánchez et al. | Comparative protein structure modeling: introduction and practical examples with modeller | |
| Frishman et al. | Seventy‐five percent accuracy in protein secondary structure prediction | |
| McGuffin et al. | Improvement of the GenTHREADER method for genomic fold recognition | |
| Topf et al. | Refinement of protein structures by iterative comparative modeling and CryoEM density fitting | |
| Fiser | Protein structure modeling in the proteomics era | |
| Skolnick et al. | Ab initio protein structure prediction via a combination of threading, lattice folding, clustering, and structure refinement | |
| Trevizani et al. | Critical features of fragment libraries for protein structure prediction | |
| Contreras-Moreira et al. | In silico protein recombination: enhancing template and sequence alignment selection for comparative protein modelling | |
| Zheng et al. | Protein structure prediction constrained by solution X-ray scattering data and structural homology identification | |
| Tao et al. | Docking cyclic peptides formed by a disulfide bond through a hierarchical strategy | |
| Kumar et al. | Computational strategies and tools for protein tertiary structure prediction | |
| US20060036374A1 (en) | Method for determining three-dimensional protein structure from primary protein sequence | |
| Dandekar et al. | Computational methods for the prediction of protein folds | |
| Fiser et al. | Comparative protein structure modeling with Modeller: A practical approach | |
| AU2007201864A1 (en) | Method for determining three-dimensional protein structure from primary protein sequence | |
| Vinayagam et al. | DDBASE2. 0: updated domain database with improved identification of structural domains | |
| Rost et al. | Evolution and neural networks/spl minus/protein secondary structure prediction above 71% accuracy | |
| Tiwari et al. | and PW Ramteke | |
| Fiser | Comparative protein structure modelling | |
| Tiwari et al. | Molecular Modeling of Proteins: Methods, Recent Advances, and Future Prospects | |
| Skolnick et al. | Protein structure prediction | |
| Martín Hernández | Combination of fragment growing and feed forward fragment searches for lead optimization campaigns |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| FZDE | Discontinued | ||
| FZDE | Discontinued |
Effective date: 20060712 |