Computing longest common extensions in partial words

DOI10.1016/J.DAM.2016.06.007MaRDI QIDQ1647840zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Longest Common Extensions in Partial Words
• A note on the longest common compatible prefix problem for partial words
• Longest common extension
• The longest common extension problem revisited and applications to approximate string searching
• Suffix trees for partial words and the longest common compatible prefix problem

Cites work

• scientific article; zbMATH DE number 2038766 (Why is no real title available?)
• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• scientific article; zbMATH DE number 1786458 (Why is no real title available?)
• A note on the longest common compatible prefix problem for partial words
• Algorithms on Strings, Trees and Sequences
• An O(n log n) algorithm for finding all repetitions in a string
• An \(O(ND)\) difference algorithm and its variations
• Fast Algorithms for Finding Nearest Common Ancestors
• Fast parallel and serial approximate string matching
• Faster longest common extension queries in strings over general alphabets
• Linear time algorithms for finding and representing all the tandem repeats in a string
• Longest Common Extensions in Partial Words
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Recursive Star-Tree Parallel Data Structure
• Suffix trees for partial words and the longest common compatible prefix problem
• The longest common extension problem revisited and applications to approximate string searching
• Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE

Cited in

(9)

• Suffix trees for partial words and the longest common compatible prefix problem
• Defining long words succinctly in FO and MSO
• On the applicability of the longest-match rule in lexical analysis.
• scientific article; zbMATH DE number 5125588 (Why is no real title available?)
• Most common words -- a cP systems solution
• Longest Common Extensions in Partial Words
• Longest common extension
• A note on the longest common compatible prefix problem for partial words
• Extended strings and admissible words

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

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