The Heaviest Induced Ancestors Problem: Better Data Structures and Applications

Let 𝒯_1 and 𝒯_2 be two rooted trees with an equal number of leaves. The leaves are labeled, and the labeling of the leaves in 𝒯_2 is a permutation of those in 𝒯_1 . Nodes are associated with weight, such that the weight of a node u , denoted by W ( u ), is more than the weight of its parent. A node x ∈𝒯_1 and a node y ∈𝒯_2 are induced, iff their subtrees have at least one common leaf label. A heaviest induced ancestor query 𝖧𝖨𝖠 (u_1,u_2) with input nodes u_1 ∈𝒯_1 and u_2 ∈𝒯_2 asks to output the pair (u_1^*,u_2^*) of induced nodes with the highest combined weight 𝖶 (u^*_1) + 𝖶 (u^*_2) , such that u_1^* is an ancestor of u_1 and u^*_2 is an ancestor of u_2 . This is a useful primitive in several text processing applications. Gagie et al. (Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG 2013, Waterloo, Ontario, Canada, 2013) introduced this problem and proposed three data structures with the following space-time trade-offs: (i) O(nlog ^2n) space and O(log n loglog n) query time, (ii) O(nlog n) space and O(log ^2 n) query time, and (iii) O ( n ) space and O(log ^3+ϵn) query time. Here n is the number of nodes in both trees combined and ϵ >0 is an arbitrarily small constant. We present two new data structures with better space-time trade-offs: (i) O(nlog n) space and O(log n loglog n) query time, and (ii) O ( n ) space and O(log ^2 n/loglog n) query time. Additionally, we present new applications of these results.