Detection of periodicities and string-matching in real time

DOI10.1007/BF01084395zbMath0509.68043WikidataQ90305414 ScholiaQ90305414MaRDI QIDQ1838300

A. O. Slisenko

Publication date: 1983

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

zbMATH Keywords

longest common substringperiodicities in input stringreal time algorithmreal-time solvability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

A fast algorithm for finding the positions of all squares in a run-length encoded string ⋮ Finding approximate repetitions under Hamming distance. ⋮ On-line construction of two-dimensional suffix trees ⋮ Forty Years of Text Indexing

Cites Work

• A Space-Economical Suffix Tree Construction Algorithm
• Fast Pattern Matching in Strings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Detection of periodicities and string-matching in real time