Find the longest common subsequence between two given strings.
Input: String 1: ABCDEF
String 2: AEBCDG
The longest common subsequence is ABCD.
The longest common subsequence between the two strings is "ABCDEFG", containing a total of 9 characters.