Dynamic weighted ancestors

MaRDI QIDQ2934639zbMATH OpenFDO

Authors Tsvi Kopelowitz, Moshe Lewenstein

Publication date 18 December 2014

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Weighted ancestors in suffix trees
• Path minima queries in dynamic weighted trees
• scientific article; zbMATH DE number 1670815
• scientific article; zbMATH DE number 177536
• Dynamic path counting and reporting in linear space

Cited in

(15)

• Orthogonal range searching for text indexing
• Weighted ancestors in suffix trees
• Faster lightweight Lempel-Ziv parsing
• The property suffix tree with dynamic properties
• Order-preserving indexing
• Submatrix maximum queries in Monge matrices are equivalent to predecessor search
• Cross-document pattern matching
• Searching Long Repeats in Streams
• Computing the Antiperiod(s) of a String
• LZ-End Parsing in Linear Time
• The heaviest induced ancestors problem revisited
• Path minima queries in dynamic weighted trees
• On Cartesian trees and range minimum queries
• Size-constrained weighted ancestors with applications
• Enhancing generalized compressed suffix trees, with applications

This page was built for publication: Dynamic weighted ancestors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934639)