This paper presents the use of a combined ant colony system (ACS) and nearest neighbour heuristic (NNH) algorithm in DNA fragment assembly.
This paper presents the use of a combined ant colony system (ACS) and nearest neighbour heuristic (NNH) algorithm in DNA fragment assembly.
Abstract. This paper presents the use of a combined ant colony system. (ACS) and nearest neighbour heuristic (NNH) algorithm in DNA frag- ment assembly.
This paper presents the use of a combined ant colony system (ACS) and nearest neighbour heuristic (NNH) algorithm in DNA fragment assembly.
On the other hand, the ant colony system algorithm outperforms the nearest neighbour heuristic algorithm when multiple-contig problems are considered.
People also ask
Is Ant Colony Optimization a heuristic?
What is the DNA fragment assembly problem?
Wannasak Wetcharaporn, Nachol Chaiyaratana , Sissades Tongsima: DNA Fragment Assembly by Ant Colony and Nearest Neighbour Heuristics. ICAISC 2006: 1008-1017.
Apr 10, 2006 � This paper presents the use of an ant colony system (ACS) algorithm in DNA fragment assembly. The assembly problem generally arises during�...
This paper presents the use of an ant colony system (ACS) algorithm in DNA fragment assembly. The assembly problem generally arises during the sequencing of�...
... ant colony algorithm performs better than the nearest neighbours heuristic. Nebro et al. [32] propose a GA in the computational grid for DNA fragment assembly.
This paper presents the use of an ant colony system (ACS) algorithm in DNA fragment assembly. The assembly problem generally arises during the sequencing of�...