pfad.sampou.orgについて、ここに記述してください。
Divide and Conquer Algorithm http://www.math.ucsd.edu/~pcompeau/Ch07_DnC_LinearSpaceAlignment_Edited.pdf
- Divide problem into sub-problems.
- Conquer by solving sub-problems recursively.
- If the sub-problems are small enough, solve them in brute force fashion.
- Combine the solutions of sub-problems into a solution of the original problem (tricky part).
http://www.math.ucsd.edu/~pcompeau/jonespevzner.html
https://mitpress.mit.edu/books/introduction-bioinformatics-algorithms