Name
Abstract | ||
|---|---|---|
A multiple sequence alignment algorithm based on divide-and-conquer method and ant colony algorithms is proposed. In the algorithm, ant colony optimization method is used to partition the set of sequences into several subsections vertically. Then the procedure of partitioning is applied to the prefix family and the suffix family in a recursive manner until the lengths of the subsequences are all equal to 1. Experimental results show that the algorithm can get high quality solution and reduce the running time. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/ICNC.2007.189 | ICNC |
Keywords | Field | DocType |
divide-and-conquer method,ant colony algorithm,multiple sequence alignment algorithm,multiple sequences alignment,prefix family,efficient ant colony algorithm,suffix family,recursive manner,ant colony optimization method,high quality solution,divide and conquer,sequences,multiple sequence alignment,bioinformatics,ant colony optimization | Ant colony optimization algorithms,Suffix,Computer science,Prefix,Theoretical computer science,Artificial intelligence,Partition (number theory),Ant colony,Multiple sequence alignment,Recursion,Machine learning | Conference |
Volume | ISSN | ISBN |
4 | 2157-9555 | 0-7695-2875-9 |
Citations | PageRank | References |
1 | 0.36 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ling Chen | 1 | 42 | 6.49 |
| Lingjun Zou | 2 | 31 | 2.38 |
| Juan Chen | 3 | 13 | 1.77 |