Analysis of the Period Recovery Error Bound
From MaRDI portal
Publication:5874467
DOI10.4230/LIPIcs.ESA.2020.5OpenAlexW3081982886MaRDI QIDQ5874467
Michael Itzhaki, Amihood Amir, Itai Boneh, Eitan Kondratovsky
Publication date: 7 February 2023
Full work available at URL: https://doi.org/10.4230/LIPIcs.ESA.2020.5
Cites Work
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for finding approximate shortest common superstrings
- Kaikoura tree theorems: Computing the maximum agreement subtree
- Period recovery of strings over the Hamming and edit distances
- Efficient Alignment Free Sequence Comparison with Bounded Mismatches
- New Genome Similarity Measures Based on Conserved Gene Adjacencies
- Cycle detection and correction
- Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff
- An Improved Approximation Guarantee for the Maximum Budgeted Allocation Problem
- Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search
- Faster approximation schemes for the two-dimensional knapsack problem
- A robust model for finding optimal evolutionary trees
- Uniqueness Theorems for Periodic Functions
- Computing the agreement of trees with bounded degrees
- Faster recovery of approximate periods over edit distance
This page was built for publication: Analysis of the Period Recovery Error Bound
