Searching Long Repeats in Streams

DOI10.4230/LIPIcs.CPM.2019.31OpenAlexW2955058595MaRDI QIDQ5088923

Oleg Merkurev, Arseny M. Shur

Publication date: 18 July 2022

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/10502/pdf/LIPIcs-CPM-2019-31.pdf/

zbMATH Keywords

suffix treestreaming algorithmlongest repeated substringKarplongest repeated reversed substringRabin fingerprint

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (1)

Computing the maximum exponent in a stream

Cites Work

• Unnamed Item
• Unnamed Item
• Order-preserving indexing
• Parallel construction of a suffix tree with applications
• Log-logarithmic worst-case range queries are possible in space theta(N)
• On-line construction of suffix trees
• Near real-time suffix tree construction via the fringe marked ancestor problem
• Real-Time Streaming String-Matching
• Dictionary Matching in a Stream
• Efficient randomized pattern-matching algorithms
• The k-mismatch problem revisited
• Approximate Hamming Distance in a Stream
• Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams
• Real-Time Streaming Multi-Pattern Search for Constant Alphabet
• Exact and Approximate Pattern Matching in the Streaming Model
• The streaming k-mismatch problem
• Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams.

This page was built for publication: Searching Long Repeats in Streams