Figure 2From: Fast local fragment chaining using sum-of-pair gap costsIllustration of a range tree padded with Johnson priority queues as stratified tree structure. Illustration of the stratified tree structure consisting of a primary binary search tree sorted by the first-dimension order padded with Johnson priority queues in each node sorted by the second-dimension order.Back to article page