Approximating Longest Common Substring with k mismatches: Theory and Practice - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Dates et versions

hal-03943005 , version 1 (17-01-2023)

Identifiants

Citer

Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya. Approximating Longest Common Substring with k mismatches: Theory and Practice. CPM 2020 - 31st Annual Symposium on Combinatorial Pattern Matching, 2020, Copenhagen, Denmark. ⟨10.4230/LIPIcs.CPM.2020.16⟩. ⟨hal-03943005⟩
8 Consultations
58 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More