 If such a computation returns a subsequence that is significantly longer than what would be obtained at random, one might infer from this result that the match is meaningful or significant.The Chvátal–Sankoff constants describe the behavior of the following random process.Given parameters "n" and "k", choose two length-"n" strings "S" and "T" from the same "k"-symbol alphabet as each other, with each character of each string chosen uniformly at random, independently of all the other characters.