Two-phase quantum based evolutionary algorithm for multiple sequence alignment

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper presents a two-phase quantum based evolution algorithm for multiple sequence alignment problem,called TPQEAlign. TPQEAlign uses a new probabilistic representation, qubit, that can represent a linear superposition of individuals of solutions. Combined with strategy for the optimization of initial search space, TPQEAilgn is proposed as follows. It consists of two phases. In the first phase, a promising initial value is searched and stored. Each local group has a different value of qubit from other local groups to explore a different search space each. In the second phase, we initialize the population using the stored resulting obtained in the first phase. The effectiveness and performance of TPQEAlign are demonstrated by testing cases in BAliBASE. Comparisons were made with the experimental results of QEAlign and several popular programs, such as CLUSTALX and SAGA. The experiments show that TPQEAlign is efficient and competent with CLUSTALX and SAGA. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Hongwei, H., & Stojkovic, V. (2007). Two-phase quantum based evolutionary algorithm for multiple sequence alignment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4456 LNAI, pp. 11–21). https://doi.org/10.1007/978-3-540-74377-4_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free