Structural properties of the string statistics problem

DOI10.1016/0022-0000(85)90060-1zbMath0593.68047OpenAlexW2069719635MaRDI QIDQ1076522

Franco P. Preparata, Alberto Apostolico

Publication date: 1985

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1459&context=cstech

zbMATH Keywords

pattern matchingweighted index tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence (68T99)

Related Items (10)

Parallel construction of a suffix tree with applications ⋮ Data structures and algorithms for the string statistics problem ⋮ On updating suffix tree labels ⋮ Periodicity and repetitions in parameterized strings ⋮ Optimal parallel detection of squares in strings ⋮ Efficient detection of quasiperiodicities in strings ⋮ Optimal parallel suffix tree construction ⋮ Optimal discovery of repetitions in 2D ⋮ Optimal Parallel Searching an Array for Certain Repetitions ⋮ Periodicity and Repetitions in Parameterized Strings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equation \(a_ M=b^ Nc^ P\) in a free group
• An optimal algorithm for computing the repetitions in a word
• Optimal off-line detection of repetitions in a string
• A fast string searching algorithm
• An O(n log n) algorithm for finding all repetitions in a string
• The Boyer–Moore–Galil String Searching Strategies Revisited
• Efficient On-Line Construction and Correction of Position Trees
• A Space-Economical Suffix Tree Construction Algorithm
• Fast Pattern Matching in Strings

This page was built for publication: Structural properties of the string statistics problem