Skip to main content

Multiple Structure Alignment and Consensus Identification for Proteins

  • Conference paper
Algorithms in Bioinformatics (WABI 2006)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 4175))

Included in the following conference series:

Abstract

An algorithm is presented to compute a multiple structure alignment for a set of proteins and to generate a consensus structure which captures common substructures present in the given proteins. The algorithm is a heuristic in that it computes an approximation to the optimal alignment that minimizes the sum of the pairwise distances between the consensus and the transformed proteins. A distinguishing feature of the algorithm is that it works directly with the coordinate representation in three dimensions with no loss of spatial information, unlike some other multiple structure alignment algorithms that operate on sets of backbone vectors translated to the origin; hence, the algorithm is able to generate true alignments. Experimental studies on several protein datasets show that the algorithm is quite competitive with a well-known algorithm called CE-MC. A web-based tool has also been developed to facilitate remote access to the algorithm over the Internet.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Branden, C., Tooze, J.: Introduction to Protein Structure, Garland (1999)

    Google Scholar 

  2. Chew, L.P., Kedem, K., Huttenlocher, D.P., Kleinberg, J.: Fast detection of geometric substructure in proteins. J. Comput. Bio. 6(3-4), 313–325 (1999)

    Article  Google Scholar 

  3. Chew, L.P., Kedem, K.: Finding the consensus shape of a protein family. In: Proc. ACM Symp. Comput. Geometry SoCG 2002, pp. 64–73 (2002)

    Google Scholar 

  4. Gerstein, M., Levitt, M.: Using iterative dynamic programming to obtain accurate pairwise and multiple alignments of protein structures. In: Proc. ISMB 1996, pp. 59–66 (1996)

    Google Scholar 

  5. Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. John Hopkins University Press (1996)

    Google Scholar 

  6. Guda, C., Scheeff, E.D., Bourne, P.E., Shindyalov, I.N.: A new algorithm for the alignment of multiple protein structures using Monte Carlo optimization. In: Proc. PSB 2001, pp. 275–286 (2001)

    Google Scholar 

  7. Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)

    Book  MATH  Google Scholar 

  8. Holm, L., Sander, C.: Protein Structure Comparison by Alignment of Distance Matrices. J. Mol. Bio. 233, 123–138 (1993)

    Article  Google Scholar 

  9. Holm, L., Sander, C.: Mapping the protein universe. Science 273, 595–602 (1996)

    Article  Google Scholar 

  10. Leibowitz, N., Fligelman, Z., Nussinov, R., Wolfson, H.: Multiple Structural Alignment and Core Detection by Geometric Hashing. In: Proc. ISMB 1999, pp. 169–177 (1999)

    Google Scholar 

  11. Mizuguchi, K., Deane, C.M., Blundell, T.L., Overington, J.P.: HOMSTRAD: a database of protein structure alignments for homologous families. Prot. Sci. 7, 2469–2471 (1998)

    Article  Google Scholar 

  12. Orengo, C., Taylor, W.: SSAP: Sequential structure alignment program for protein structure comparison. Meth. Enzymol. 266, 617–635 (1996)

    Article  Google Scholar 

  13. Rose, G.: No assembly required. The Sciences 36, 26–31 (1996)

    Google Scholar 

  14. Sela, M., White Jr., F.H., Anfinsen, C.B.: Reductive cleavage of disulfide bridges in Ribonuclease. Science 125, 691–692 (1957)

    Article  Google Scholar 

  15. Shindyalov, I.N., Bourne, P.E.: Protein structure alignment by incremental combinatorial extension (CE) of the optimal path. Prot. Eng. 11, 739–747 (1998)

    Article  Google Scholar 

  16. Singh, A.P., Brutlag, D.L.: Hierarchical protein structure superposition using both secondary structure and atomic representation. In: Proc. ISMB 1997, pp. 284–293 (1997)

    Google Scholar 

  17. Umeyama, S.: Least-square estimation of transformation parameters between two point patterns. IEEE Trans. Pattern Anal. Mach. Intell. 13(4), 376–380 (1991)

    Article  Google Scholar 

  18. Ye, J., Janardan, R., Liu, S.: Pairwise protein structure alignment based on an orientation-independent backbone representation. J. Bio. Comput. Bio. 2(4), 699–717 (2004)

    Article  Google Scholar 

  19. Ye, J., Ilinkin, I., Janardan, R., Isom, A.: Multiple structure alignment and consensus identification for proteins (submitted), available at: http://www.geom-comp.umn.edu

  20. Ye, J., Janardan, R.: Approximate multiple protein structure alignment using the Sum-of-Pairs distance. J. Comput. Bio. 11(5), 986–1000 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ye, J., Ilinkin, I., Janardan, R., Isom, A. (2006). Multiple Structure Alignment and Consensus Identification for Proteins. In: Bücher, P., Moret, B.M.E. (eds) Algorithms in Bioinformatics. WABI 2006. Lecture Notes in Computer Science(), vol 4175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11851561_11

Download citation

  • DOI: https://doi.org/10.1007/11851561_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-39583-6

  • Online ISBN: 978-3-540-39584-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics