Skip to main content
SpringerLink
Log in

Multiple Sequence Alignment Based on Set Covers

  • Conference paper
Applications of Evolutionary Computing (EvoWorkshops 2006)

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

Included in the following conference series:

  • 1552 Accesses

Abstract

We introduce a new heuristic for the multiple alignment of a set of sequences. The heuristic is based on a set cover of the residue alphabet of the sequences, and also on the determination of a significant set of blocks comprising subsequences of the sequences to be aligned. These blocks are obtained with the aid of a new data structure, called a suffix-set tree, which is constructed from the input sequences with the guidance of the residue-alphabet set cover and generalizes the well-known suffix tree of the sequence set. We provide performance results on selected BAliBASE amino-acid sequences and compare them with those yielded by some prominent approaches.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Manthey, B.: Non-approximability of weighted multiple sequence alignment. Theoretical Computer Science 296, 179–192 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Li, T.P., Fan, K., Wang, J., Wang, W.: Reduction of protein sequence complexity by residue grouping. Protein Engineering 16, 323–330 (2003)

    Article  Google Scholar 

  3. Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)

    Book  MATH  Google Scholar 

  4. Zhao, P., Jiang, T.: A heuristic algorithm for multiple sequence alignment based on blocks. Journal of Combinatorial Optimization 5, 95–115 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bahr, A., Thompson, J.D., Thierry, J.C., Poch, O.: BAliBASE (Benchmark Alignment dataBASE): enhancements for repeats, transmembrane sequences and circular permutations. Nucleic Acids Research 29, 323–326 (2001)

    Article  Google Scholar 

  6. Thompson, J.D., Higgins, D.G., Gibson, T.J.: CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties, and weight matrix choice. Nucleic Acids Research 22, 4673–4680 (1994)

    Article  Google Scholar 

  7. Gotoh, O.: Significant improvement in accuracy of multiple protein sequence alignments by iterative refinement as assessed by reference to structural alignments. Journal of Molecular Biology 264, 823–838 (1996)

    Article  Google Scholar 

  8. Morgenstern, B., Frech, K., Dress, A., Werner, T.: DIALIGN: finding local similarities by multiple sequence alignment. Bioinformatics 14, 290–294 (1998)

    Article  Google Scholar 

  9. Morgenstern, B.: DIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment. Bioinformatics 15, 211–218 (1999)

    Article  Google Scholar 

  10. Notredame, C., Higgins, D.G., Heringa, J.: T-Coffee: a novel method for fast and accurate multiple sequence alignment. Journal of Molecular Biology 302, 205–217 (2000)

    Article  Google Scholar 

  11. Katoh, K., Misawa, K., Kuma, K., Miyata, T.: MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform. Nucleic Acids Research 30, 3059–3066 (2002)

    Article  Google Scholar 

  12. Ioerger, T.R.: The context-dependence of amino acid properties. In: Proceedings of the Fifth International Conference on Intelligent Systems for Molecular Biology, pp. 157–166 (1997)

    Google Scholar 

  13. Smith, R.F., Smith, T.F.: Automatic generation of primary sequence patterns from sets of related protein sequences. Proceedings of the National Academy of Sciences USA 87, 118–122 (1990)

    Article  Google Scholar 

  14. Henikoff, S., Henikoff, J.G.: Amino acid substitution matrices from protein blocks. Proceedings of the National Academy of Sciences USA 89, 10915–10919 (1992)

    Article  Google Scholar 

  15. Dayhoff, M.O., Schwartz, R.M., Orcutt, B.C.: A model of evolutionary change in proteins. In: Dayhoff, M.O. (ed.) Atlas of Protein Sequence and Structure. National Biomedical Research Foundation, Washington, DC, vol. 5(suppl. 3), pp. 345–352 (1978)

    Google Scholar 

  16. Müller, T., Spang, R., Vingron, M.: Estimating amino acid substitution models: a comparison of Dayhoff’s estimator, the resolvent approach and a maximum likelihood method. Molecular Biology and Evolution 19, 8–13 (2002)

    Google Scholar 

  17. Vogt, G., Etzold, T., Argos, P.: An assessment of amino acid exchange matrices in aligning protein sequences: the twilight zone revisited. Journal of Molecular Biology 249, 816–831 (1995)

    Article  Google Scholar 

  18. Green, R.E., Brenner, S.E.: Bootstrapping and normalization for enhanced evaluations of pairwise sequence comparison. Proceedings of the IEEE 90, 1834–1847 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programa de Engenharia de Sistemas e Computação, COPPE, Universidade Federal do Rio de Janeiro, Caixa Postal 68511, Rio de Janeiro, RJ, 21941-972, Brazil

    Alexandre H. L. Porto & Valmir C. Barbosa

Authors
  1. Alexandre H. L. Porto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Valmir C. Barbosa
    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. Centre of Informatics and Systems of the University of Coimbra,  

    Ernesto Costa

  5. Dept. LCC, Universidad de Málaga, Spain

    Carlos Cotta

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

    Rolf Drechsler

  7. INRIA Saclay - Ile-de-France, Parc Orsay Université, 4, rue Jacques Monod, 91893, ORSAY Cedex, France

    Evelyne Lutton

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

    Penousal Machado

  9. Dartmouth College, Lebanon, NH, USA

    Jason H. Moore

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

    Juan Romero

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

    George D. Smith

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

    Giovanni Squillero

  13. Kyushu University, Japan

    Hideyuki Takagi

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Porto, A.H.L., Barbosa, V.C. (2006). Multiple Sequence Alignment Based on Set Covers. In: Rothlauf, F., et al. Applications of Evolutionary Computing. EvoWorkshops 2006. Lecture Notes in Computer Science, vol 3907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11732242_12

Download citation

  • DOI: https://doi.org/10.1007/11732242_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33237-4

  • Online ISBN: 978-3-540-33238-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation