82
Voted
CPM
15 years 7 months ago
2003 Springer CPM
15 years 7 months ago
2003 Springer CPM
15 years 7 months ago
2003 Springer 75
Voted
CPM
15 years 7 months ago
2003 Springer 102
Voted
CPM
15 years 7 months ago
2003 Springer
Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...
|