Longest common prefixes with \(k\)-errors and applications

DOI10.1007/978-3-030-00479-8_3zbMath1517.68429arXiv1801.04425OpenAlexW2962720177MaRDI QIDQ6109731

Costas S. Iliopoulos, Lorraine A. K. Ayad, Carl Barton, Solon P. Pissis, Panagiotis Charalampopoulos

Publication date: 28 July 2023

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

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

zbMATH Keywords

longest common prefixlongest common substringlongest common factor\(k\)-mismatches\(k\)-errors

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (4)

Efficient computation of sequence mappability ⋮ Faster algorithms for 1-mappability of a sequence ⋮ Longest property-preserved common factor: a new string-processing framework ⋮ Longest common substring made fully dynamic

This page was built for publication: Longest common prefixes with \(k\)-errors and applications