Im not sure that all programs use this strategy. I guess my question was not that clear.
Is anyone aware of approaches that have used a divide and conquer strategy to reduce the search space (and related noise) for sequence assembly programs ?
Does this "divide and conquer" strategy really payoff in terms of time and efficiency ?
If I am not wrong..."CAP3" assembly Program uses divide–conquer technique...
A divide-and-conquer approach to fragment assembly.
Otu HH, Sayood K.