�ݺ�ߣ

1. Partial Digest Algorithm

2. Group Members 1. Amit Kumar Bala Antu ID NO:152-15-5674 2. Md Lutfor Rahman ID NO:152-15-5516

3. What is Partial Digest Algorithm?

4. Restriction Mapping Complete Digest Partial Digest

6. Partial Digest Algorithm PLACE( L, X ) // find all solutions • if L is empty • output X • return • y  Maximum element in L • If ( y, X )  L // place the cut on the right • Add y to X and remove lengths (y, X ) from L • PLACE(L, X ) • Remove y from X and add lengths (y, X ) to L • If ( width-y, X )  L // place it on the left • Add width-y to X and remove lengths (width-y, X) from L • PLACE(L,X ) • Remove width-y from X and add lengths (width-y, X ) to L • Return

7. Reconstructing Restriction Map • Main Restriction Map • Pairwise Distances between points on a line: {1,2,3,4,4,5,5,6,8,10}

8. Solution Is Not Unique

9. `Thank you

�ݺ�ߣ

Partial digest algorithm

More Related Content

Partial digest algorithm