Computing longest common extensions in partial words

DOI10.1016/j.dam.2016.06.007zbMath1393.68136OpenAlexW2472252664MaRDI QIDQ1647840

Y. Aharonov

Publication date: 27 June 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.06.007

zbMATH Keywords

partial wordslongest common extensions

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the longest common compatible prefix problem for partial words
• The longest common extension problem revisited and applications to approximate string searching
• An \(O(ND)\) difference algorithm and its variations
• Linear time algorithms for finding and representing all the tandem repeats in a string
• Longest Common Extensions in Partial Words
• Fast Algorithms for Finding Nearest Common Ancestors
• An O(n log n) algorithm for finding all repetitions in a string
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Recursive Star-Tree Parallel Data Structure
• Fast parallel and serial approximate string matching
• Algorithms on Strings, Trees and Sequences
• Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem
• Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
• Faster Longest Common Extension Queries in Strings over General Alphabets

This page was built for publication: Computing longest common extensions in partial words