Analysis of the Period Recovery Error Bound

DOI10.4230/LIPICS.ESA.2020.5MaRDI QIDQ5874467zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Hamming distanceperiod recoveryperiod recovery hierarchy

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A linear-time algorithm for finding approximate shortest common superstrings
• A robust model for finding optimal evolutionary trees
• An improved approximation guarantee for the maximum budgeted allocation problem
• Approximate distance oracles for planar graphs with improved query time-space tradeoff
• Approximate subset matching with don't cares
• Computing the agreement of trees with bounded degrees
• Cycle detection and correction
• Efficient Alignment Free Sequence Comparison with Bounded Mismatches
• Faster approximation schemes for the two-dimensional knapsack problem
• Faster recovery of approximate periods over edit distance
• scientific article; zbMATH DE number 7203330 (Why is no real title available?)
• Kaikoura tree theorems: Computing the maximum agreement subtree
• New genome similarity measures based on conserved gene adjacencies
• Period recovery of strings over the Hamming and edit distances
• Proximity in the age of distraction: robust approximate nearest neighbor search
• Uniqueness Theorems for Periodic Functions

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)