By Cruchemor, Landau and Ziv-ukelson. Abstract We present an O(n²/log n) algorithm for computing the optimal global alignment value of two strings,of.