The heaviest induced ancestors problem: better data structures and applications
From MaRDI portal
Publication:2149106
DOI10.1007/s00453-022-00955-7OpenAlexW4220713634MaRDI QIDQ2149106
Sharma V. Thankachan, Sahar Hooshmand, Arnab Ganguly, Paniz Abedin
Publication date: 28 June 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-00955-7
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Cartesian trees and range minimum queries
- Two-dimensional range successor in optimal time and almost linear space
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Minimal unique palindromic substrings after single-character substitution
- Dynamic and internal longest common substring
- Computing longest palindromic substring after single-character or block-wise edits
- Sorted Range Reporting
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Fast Algorithms for Finding Nearest Common Ancestors
- Indexing compressed text
- Data Structures for Range Median Queries
- A universal algorithm for sequential data compression
- Algorithms on Strings, Trees and Sequences
- Repetition Detection in a Dynamic String
- Longest common substring made fully dynamic
- Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms.
- Longest substring palindrome after edit
- Longest Lyndon Substring After Edit
- The Heaviest Induced Ancestors Problem Revisited
- Longest Common Factor After One Edit Operation
- Orthogonal range searching on the RAM, revisited
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
- Searching for a modified pattern in a changing text
This page was built for publication: The heaviest induced ancestors problem: better data structures and applications
