Exact and inexact search for 2d side-sharing tandems
From MaRDI portal
Publication:6658301
DOI10.1016/J.TCS.2024.115005MaRDI QIDQ6658301
Dina Sokol, Shoshana Marcus, Sarah Zelikovitz
Publication date: 8 January 2025
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extracting powers and periods in a word from its runs structure
- 2D Lyndon words and applications
- Repetitions in strings: algorithms and combinatorics
- A characterization of the squares in a Fibonacci string
- Finding approximate repetitions under Hamming distance.
- Fibonacci arrays and their two-dimensional repetitions
- Squares, cubes, and time-space efficient string searching
- On-line construction of suffix trees
- Lower bounds for the number of repetitions in 2D strings
- Two-dimensional maximal repetitions
- Locating maximal approximate runs in a string
- Optimal discovery of repetitions in 2D
- Double string tandem repeats
- An O(n log n) algorithm for finding all repetitions in a string
- Priority Search Trees
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Two-Dimensional Periodicity in Rectangular Arrays
- A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
- Locating All Maximal Approximate Runs in a String
- The “Runs” Theorem
- A new characterization of maximal repetitions by Lyndon trees
- On Context-Free Languages
This page was built for publication: Exact and inexact search for 2d side-sharing tandems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6658301)
