Fig. 3From: A fast and efficient path elimination algorithm for large-scale multiple common longest sequence problemsThe process of estimating a lower bound Lower(R) of the length of the longest paths in DAGBack to article page