##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Tracing the algorithm
Trace LCS on and . Build the DP table. = LCS length of and .
When characters match (): . Otherwise: . Final answer: . The LCS is "BDAB" or "BCAB". Trace back from to reconstruct. Backtrack from the final cell to reconstruct the actual subsequence. Follow the arrows that gave the maximum.
