Skip to main content

An ant colony algorithm for multiple sequence alignment in bioinformatics

Moss, Jonathan and Johnson, Colin G. (2003) An ant colony algorithm for multiple sequence alignment in bioinformatics. In: Pearson, David W. and Steele, Nigel C. and Albrecht, Rudolf F., eds. Artificial Neural Nets and Genetic Algorithms: Proceedings of the International Conference. Springer, Vienna, Austria, pp. 182-186. ISBN 978-3-211-00743-3. E-ISBN 978-3-7091-0646-4. (doi:10.1007/978-3-7091-0646-4_33) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:13988)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1007/978-3-7091-0646-4_33

Abstract

This paper describes a the application of ant colony optimization algorithms, which draw inspiration from the way ants organize themselves in searching for food, to the well-known bioinformatics problem of aligning several protein sequences.

Item Type: Book section
DOI/Identification number: 10.1007/978-3-7091-0646-4_33
Additional information: Conference Information: International Conference on Artificial Neural Nets and Genetic Algorithms
Uncontrolled keywords: swarm intelligence; DNA sequences; protein sequences
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:01 UTC
Last Modified: 16 Feb 2021 12:24 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/13988 (The current URI for this page, for reference purposes)
Johnson, Colin G.: https://orcid.org/0000-0002-9236-6581
  • Depositors only (login required):