Multidimensional period recovery
From MaRDI portal
Publication:2144266
DOI10.1007/s00453-022-00926-yOpenAlexW4213351661MaRDI QIDQ2144266
Eitan Kondratovsky, Amihood Amir, Dina Sokol, Ayelet Butman, Avivit Levy
Publication date: 1 June 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-00926-y
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Periodicity in rectangular arrays
- Extracting powers and periods in a word from its runs structure
- 2D Lyndon words and applications
- Periodicity and repetitions in parameterized strings
- An optimal algorithm for computing the repetitions in a word
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- Optimal parallel two dimensional text searching on a CREW PRAM
- Finding approximate repetitions under Hamming distance.
- Fibonacci arrays and their two-dimensional repetitions
- Period recovery of strings over the Hamming and edit distances
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Two-dimensional maximal repetitions
- Approximate cover of strings
- Approximate periodicity
- Can we recover the cover?
- Cycle detection and correction
- Optimal parallel algorithms for string matching
- Two-Dimensional Periodicity in Rectangular Arrays
- A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
- Alphabet-Independent Two-Dimensional Witness Computation
- Locating All Maximal Approximate Runs in a String
- Repetition Detection in a Dynamic String
- Uniqueness Theorems for Periodic Functions
- The “Runs” Theorem
- Internal Pattern Matching Queries in a Text and Applications
- Approximate periods of strings
This page was built for publication: Multidimensional period recovery
