As you know, the maximum of Bio-informatics algo is based on combination, cutting, splicing, editing distance, neural network, etc., as well as backtracking, for example dfs (for partial digest). If you make them common, as with reducing the map, the task is for a specific instance or length ex:
For length 1 ..... map-reduce job 1 For length 2 ..... map-reduce job 2 . . . For length n ..... map-reduce job n
Or, if you want to compare Bio-info algo with hadoop architecture, you can find a simple algorithm in this link -> http://matrixsust.blogspot.com/2011/01/introduction-to-bioinformatics.html
Hope this helps.
source share