Title of article :
Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width
Author/Authors :
C?linescu، نويسنده , , Gruia and Fernandes، نويسنده , , Cristina G.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Pages :
4
From page :
194
To page :
197
Abstract :
Nowadays, several DNA fragments assembly packages are available and in this work we present a comparative study of the performances of four of these programs. To get to our objectives, we first ran each of these programs on nine instances and then compared the outputs with the sequences from which the fragments were originally obtained. Even more, we compared the packages with respect to their CPU times.
Keywords :
directed multicut , tree-width , approximation algorithms
Journal title :
Electronic Notes in Discrete Mathematics
Serial Year :
2001
Journal title :
Electronic Notes in Discrete Mathematics
Record number :
1453149
Link To Document :
بازگشت