Talk:Sequence assembly

From Wikipedia, the free encyclopedia

[edit] Algorithm?

What's with the algorithm? Surely, it would be more relevant to give the optimal (NP-complete) algorithm - than a very simplistic one?

The assembly problem is a variation of Hamiltonian path problem which is known to be NP-hard in its function problem version known as Travelling salesman problem. The use of heuristic is then justified. However I think that pseudocode should be placed elswehere i.e. in the Shortest common supersequence article.

213.121.151.178 03:37, 26 February 2006 (UTC)