Step 1: Understanding the Concept:
This question asks to match key figures and concepts in the field of sequence alignment, a cornerstone of bioinformatics. It involves matching algorithms with their purpose and substitution matrices with their creators.
Step 2: Detailed Explanation:
(A) Needleman and Wunsch: Saul Needleman and Christian Wunsch developed the first dynamic programming algorithm for sequence comparison. Their algorithm finds the optimal alignment over the entire length of two sequences, which is known as Global Alignment. So, (A) matches with (II).
(B) Smith and Waterman: Temple Smith and Michael Waterman modified the Needleman-Wunsch algorithm to find the optimal alignment between subsequences. This method is used to find the best matching regions between two sequences and is known as Local Alignment. So, (B) matches with (III).
(C) Margaret Dayhoff: A pioneer of bioinformatics, she and her colleagues developed the first widely used protein substitution matrices. They were derived from global alignments of closely related proteins and are based on an explicit evolutionary model. These matrices are called PAM (Point Accepted Mutation) or Dayhoff matrices. So, (C) matches with (IV).
(D) Henikoff and Henikoff: Steven and Jorja Henikoff developed an alternative set of substitution matrices derived from local, ungapped alignments of more distantly related protein sequences (from the BLOCKS database). These matrices are called BLOSUM (BLOcks SUbstitution Matrix). So, (D) matches with (I).
Step 3: Final Answer:
The correct matching is: (A)-(II), (B)-(III), (C)-(IV), (D)-(I). This corresponds to option (2).