Michal Koucký
ABSTRACT
For any T ≥ 1, there are constants R=R(T) ≥ 1 and ζ=ζ(T)>0 and a randomized algorithm that takes as input an integer n and two strings x,y of length at most n, and runs in time O(n 1+1/T ) and outputs an upper bound U on the edit distance of edit(x,y) that with high probability, satisfies U ≤ R(edit(x,y)+n 1−ζ). In particular, on any input with edit(x,y) ≥ n 1−ζ the algorithm outputs a constant factor approximation with high probability. A similar result has been proven independently by Brakensiek and Rubinstein (this proceedings).
- Amir Abboud and Arturs Backurs. 2017. Towards Hardness of Approximation for Polynomial Time Problems. In 8th Innovations in Theoretical Computer Science Conference, ITCS 2017. 11 : 1-11 : 26.Google Scholar
- Amir Abboud, Arturs Backurs, and Virginia Vassilevska Williams. 2015. Tight Hardness Results for LCS and Other Sequence Similarity Measures. In Prof. of the IEEE Annual Symp. on Found. of Comp. Sci., FOCS 2015. 59-78.Google Scholar
- Amir Abboud, Thomas Dueholm Hansen, Virginia Vassilevska Williams, and Ryan Williams. 2016. Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made. In Proc. of the Annual ACM Symp. on Theory of Comp., STOC 2016. 375-388.Google ScholarDigital Library
- Alex Andoni. 2018. Simpler Constant-Factor Approximation to Edit Distance Problems. Manuscript ( 2018 ).Google Scholar
- Alexandr Andoni, Robert Krauthgamer, and Krzysztof Onak. 2010. Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity. In Proc. of the Annual IEEE Symp. on Found. of Comp. Sci., FOCS 2010. 377-386.Google ScholarDigital Library
- Alexandr Andoni and Krzysztof Onak. 2009. Approximating Edit Distance in Near-linear Time. In Proc. of the Forty-first Annual ACM Symp. on Theory of Comp. (Bethesda, MD, USA) ( STOC '09). ACM, 199-204.Google ScholarDigital Library
- Arturs Backurs and Piotr Indyk. 2015. Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False). In Proc. of the Annual ACM on Symp. on Theory of Comp. (Portland, Oregon, USA) ( STOC '15). ACM, 51-58.Google ScholarDigital Library
- Z. Bar-Yossef, T.S. Jayram, R. Krauthgamer, and R. Kumar. 2004. Approximating edit distance eficiently. In Proc. of the Annual IEEE Symp. on Found. of Comp. Sci., FOCS 2004. 550-559.Google Scholar
- Tugkan Batu, Funda Ergün, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, and Rahul Sami. 2003. A Sublinear Algorithm for Weakly Approximating Edit Distance. In Proc. of the Annual ACM Symp. on Theory of Comp. (San Diego, CA, USA) ( STOC '03). ACM, 316-324.Google ScholarDigital Library
- Tuğkan Batu, Funda Ergun, and Cenk Sahinalp. 2006. Oblivious String Embeddings and Edit Distance Approximations. In Proc. of the Annual ACM-SIAM Symp. on Discrete Algorithm (Miami, Florida) (SODA '06). Society for Industrial and Applied Mathematics, 792-801.Google ScholarCross Ref
- Mahdi Boroujeni, Soheil Ehsani, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, and Saeed Seddighin. 2018. Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce. In Proc. of the Annual ACM-SIAM Symp. on Discrete Algorithms, SODA 2018. 1170-1189.Google ScholarCross Ref
- Mahdi Boroujeni, Soheil Ehsani, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, and Saeed Seddighin. 2018. Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce (extended version of ). ( 2018 ).Google Scholar
- Joshua Brakensiek and Aviad Rubinstein. 2020. Constant-factor approximation of near-linear edit distance in near-linear time. Proc. of the ACM Symp. on Theory of Comp., STOC 2020.Google ScholarDigital Library
- Karl Bringmann and Marvin Künnemann. 2015. Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping. In Prof. of the IEEE Annual Symp. on Found. of Comp. Sci., FOCS 2015. 79-97.Google Scholar
- Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký, and Michael E. Saks. 2018. Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time. In Prof. of the IEEE Annual Symp. on Found. of Comp. Sci., FOCS 2018. 979-990.Google Scholar
- Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký, and Michael E. Saks. 2018. Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time. CoRR abs/ 1810.03664 ( 2018 ). arXiv: 1810.03664 http://arxiv.org/abs/ 1810.03664Google Scholar
- Diptarka Chakraborty, Debarati Das, and Michal Koucký. 2019. Approximate Online Pattern Matching in Sublinear Time. In Proc. of FSTTCS 2019 (LIPIcs), Vol. 150. 10: 1-10 : 15.Google Scholar
- Elazar Goldenberg, Robert Krauthgamer, and Barna Saha. 2019. Sublinear Algorithms for Gap Edit Distance. In Proc. of the Annual IEEE Symp. on Found. of Comp. Sci., FOCS 2019. 1101-1120.Google ScholarCross Ref
- Szymon Grabowski. 2016. New tabulation and sparse dynamic programming based techniques for sequence similarity problems. Discrete Applied Mathematics 212 ( 2016 ), 96-103.Google Scholar
- Gad M. Landau, Eugene W. Myers, and Jeanette P. Schmidt. 1998. Incremental String Comparison. SIAM J. Comput. 27, 2 (April 1998 ), 557-582.Google ScholarCross Ref
- VI Levenshtein. 1966. Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady 10 ( 1966 ), 707.Google Scholar
- William J. Masek and Michael S. Paterson. 1980. A faster algorithm Comp. string edit distances. J. Comput. System Sci. 20, 1 ( 1980 ), 18-31.Google ScholarCross Ref
- Esko Ukkonen. 1985. Algorithms for Approximate String Matching. Inf. Control 64, 1-3 ( March 1985 ), 100-118.Google ScholarDigital Library
- Robert A. Wagner and Michael J. Fischer. 1974. The String-to-String Correction Problem. J. ACM 21, 1 (Jan. 1974 ), 168-173.Google ScholarDigital Library
Index Terms
- Constant factor approximations to edit distance on far input pairs in nearly linear time
Recommendations
Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time
Edit distance is a measure of similarity of two strings based on the minimum number of character insertions, deletions, and substitutions required to transform one string into the other. The edit distance can be computed exactly using a dynamic ...
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce
The edit distance between two strings is defined as the smallest number of insertions, deletions, and substitutions that need to be made to transform one of the strings to another one. Approximating edit distance in subquadratic time is “one of the ...
Constant-factor approximation of near-linear edit distance in near-linear time
STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of ComputingWe show that the edit distance between two strings of length n can be computed via a randomized algorithm within a factor of f(є) in n 1+є time as long as the edit distance is at least n 1−δ for some δ(є) > 0.
Comments