 However, some authors write "the Chvátal–Sankoff constant" to refer to formula_2, the constant defined in this way for the binary alphabet.A common subsequence of two strings "S" and "T" is a string whose characters appear in the same order (not necessarily consecutively) both in "S" and in "T".The problem of computing a longest common subsequence has been well studied in computer science.