CAINE
2008
13 years 6 months ago
2008
Assembly is an NP-Hard problem, which involves comparing fragments that have a time complexity of O(n2 ). This paper presents a parallel approach for sequence assembly. The parall...
WABI
2007
Springer
13 years 11 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...