Analysis of the Period Recovery Error Bound
From MaRDI portal
Publication:5874467
DOI10.4230/LIPICS.ESA.2020.5OpenAlexW3081982886MaRDI QIDQ5874467FDOQ5874467
Authors: Amihood Amir, Itai Boneh, Michael Itzhaki, Eitan Kondratovsky 
Publication date: 7 February 2023
Full work available at URL: https://doi.org/10.4230/LIPIcs.ESA.2020.5
Cites Work
- Kaikoura tree theorems: Computing the maximum agreement subtree
- Approximate distance oracles for planar graphs with improved query time-space tradeoff
- Uniqueness Theorems for Periodic Functions
- Approximate subset matching with don't cares
- Efficient Alignment Free Sequence Comparison with Bounded Mismatches
- Proximity in the age of distraction: robust approximate nearest neighbor search
- A linear-time algorithm for finding approximate shortest common superstrings
- Computing the agreement of trees with bounded degrees
- Faster approximation schemes for the two-dimensional knapsack problem
- Cycle detection and correction
- Period recovery of strings over the Hamming and edit distances
- Faster recovery of approximate periods over edit distance
- New genome similarity measures based on conserved gene adjacencies
- A robust model for finding optimal evolutionary trees
- An improved approximation guarantee for the maximum budgeted allocation problem
- Title not available (Why is that?)
This page was built for publication: Analysis of the Period Recovery Error Bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874467)
