Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Approximating Longest Common Substring with k mismatches: Theory and Practice - MaRDI portal

Approximating Longest Common Substring with k mismatches: Theory and Practice

From MaRDI portal

Publication:5874444

Jump to:navigation, search

DOI10.4230/LIPIcs.CPM.2020.16OpenAlexW3021752231MaRDI QIDQ5874444

Garance Gourdel, Tomasz Kociumaka, Tatiana Starikovskaya, Jakub Radoszewski

Publication date: 7 February 2023

Full work available at URL: https://arxiv.org/abs/2004.13389

zbMATH Keywords

approximation algorithms string similarity LSH conditional lower bounds

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (1)

Near-optimal quantum algorithms for string problems

This page was built for publication: Approximating Longest Common Substring with k mismatches: Theory and Practice

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5874444&oldid=30742817"