Longest Common Prefixes with k-Mismatches and Applications

DOI10.1007/978-3-319-73117-9_45zbMath1445.68362OpenAlexW2776892647MaRDI QIDQ5127201

Costas S. Iliopoulos, Hayam Alamro, Solon P. Pissis, Panagiotis Charalampopoulos, Lorraine A. K. Ayad

Publication date: 21 October 2020

Published in: SOFSEM 2018: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-73117-9_45

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Related Items

Efficient computation of sequence mappability ⋮ Dynamic and internal longest common substring ⋮ Faster algorithms for 1-mappability of a sequence ⋮ Linear-Time Algorithm for Long LCF with k Mismatches