2 ms·
It is far more difficult than sequence alignment. Sequence alignment has quadratic complexity, while fragment assembly is NP-hard. Se for example http://schola
by alephnil 14y ago
It is far more difficult than sequence alignment. Sequence alignment has quadratic complexity, while fragment assembly is NP-hard. Se for example
http://scholar.google.com/scholar?cluster=13174541691543421945&hl=en&as_sdt=0,5 http://scholar.google.com/scholar?cluster=131745416915434219...
- dalke 14y agoYes, for pairwise sequence alignment. The globally optimized multiple sequence alignment problem is NP-complete.