Skip to main content
SpringerLink
Log in
Book cover

Workshops on Applications of Evolutionary Computation

EvoWorkshops 2005: Applications of Evolutionary Computing pp 22–32Cite as

Tabu Search Method for Determining Sequences of Amino Acids in Long Polypeptides

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3449))

Abstract

The amino acid sequences of proteins determine their structure and functionality, hence methods for reading such sequences are crucial for many areas of biological sciences. Since direct methods for reading amino acid sequences allow for determining only very short fragments, some methods for assembly of these fragments are required. In this paper, tabu search algorithm solving this problem is proposed. Computational tests show its usefulness in the process of determining sequences of amino acids in long polypeptides.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Błażewicz, J., Borowski, M., Formanowicz, P., Głowacki, T.: On graph theoretical models for peptide sequence assembly (submitted for publication)

    Google Scholar 

  2. Dančík, V., Addona, T.A., Clauser, K.R., Vath, J.E., Pevzner, P.A.: De novo peptide sequencing via tandem mass spectometry. Journal of Computational Biology 6, 327–342 (1999)

    Article  Google Scholar 

  3. Gallant, J.K.: The complexity of the overlap method for sequencing biopolymers. Journal of Theoretical Biology 101, 1–17 (1983)

    Article  Google Scholar 

  4. Glover, F.: Tabu Search, Part I. ORSA Journal on Computing 1, 190–206 (1989)

    MATH  MathSciNet  Google Scholar 

  5. Glover, F.: Tabu Search, Part II. ORSA Journal on Computing 1, 4–32 (1990)

    Google Scholar 

  6. Gotoh, O.: An improved algorithm for matching biological sequences. Journal of Molecular Biology 162, 705–708 (1982)

    Article  Google Scholar 

  7. Meidanis, J., Setubal, J.: Introduction to Computational Biology, Boston. PWS Publishing Company (1997)

    Google Scholar 

  8. Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology 48, 443–453 (1970)

    Article  Google Scholar 

  9. Pevzner, P.A.: Computational molecular biology. An algorithmic approach. MIT Press, Cambridge (2000)

    MATH  Google Scholar 

  10. Stryer, L.: Biochemistry, 4th edn. W.H. Freeman and Company, New York (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computing Science, Poznań University of Technology, Piotrowo 3A, 60-965, Poznań, Poland

    Jacek Błażewicz, Marcin Borowski & Piotr Formanowicz

  2. Institute of Bioorganic Chemistry, Polish Academy of Sciences, Noskowskiego 12/14, 61-704, Poznań, Poland

    Jacek Błażewicz, Piotr Formanowicz & Maciej Stobiecki

Authors
  1. Jacek Błażewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcin Borowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Piotr Formanowicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Maciej Stobiecki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Johannes Gutenberg University, Mainz, Germany

    Franz Rothlauf

  2. Institute AIFB, University of Karlsruhe, 76128, Karlsruhe, Germany

    Jürgen Branke

  3. Dipartimento di Ingegneria dell’Informazione, Università di Parma,  

    Stefano Cagnoni

  4. School of Mathematical and Computer Science, Heriot-Watt University, EH14 8AS, Edinburgh, UK

    David Wolfe Corne

  5. Institute of Computer Science, University of Bremen, 28359, Bremen, Germany

    Rolf Drechsler

  6. Honda Research Institute Europe GmbH, Offenbach/Main, Germany

    Yaochu Jin

  7. CISUC, Department of Informatics Engineering, University of Coimbra, Polo II of the University of Coimbra, 3030, Coimbra, Portugal

    Penousal Machado

  8. ICIS, Radboud University Nijmegen, The Netherlands

    Elena Marchiori

  9. Universidade de A Coruña, CP 15071, A Coruña, Spain

    Juan Romero

  10. School of Computing Sciences, University of East Anglia, UEA Norwich, NR4 7TJ, Norwich, UK

    George D. Smith

  11. Dipartimento di Automatica e Informatica, Politecnico di Torino, Italy

    Giovanni Squillero

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Błażewicz, J., Borowski, M., Formanowicz, P., Stobiecki, M. (2005). Tabu Search Method for Determining Sequences of Amino Acids in Long Polypeptides. In: Rothlauf, F., et al. Applications of Evolutionary Computing. EvoWorkshops 2005. Lecture Notes in Computer Science, vol 3449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32003-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-32003-6_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25396-9

  • Online ISBN: 978-3-540-32003-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation