ROSALIND|Finding a Shared Spliced Motif (LCSQ)
給定兩條以 FASTA 格式儲存的 DNA 序列,求兩序列最長的共同子序列。
Given: Two DNA strings s and t (each having length at most 1 kbp) in FASTA format.
Return: A longest common subsequence of s and t. (If more than one solution exists, you may return any one.)