Longest common prefixes with k-mismatches and applications

DOI10.1007/978-3-319-73117-9_45zbMATH Open1445.68362OpenAlexW2776892647MaRDI QIDQ5127201FDOQ5127201

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

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

Recommendations

• Longest common prefix with mismatches
• Longest common prefixes with \(k\)-errors and applications
• Longest common substrings with \(k\) mismatches
• Faster algorithms for 1-mappability of a sequence
• Faster algorithms for 1-mappability of a sequence

Mathematics Subject Classification ID

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

Cited In (8)

• Efficient computation of sequence mappability
• Longest common prefixes with \(k\)-errors and applications
• Longest common prefix with mismatches
• Linear-time algorithm for long LCF with \(k\) mismatches
• Efficient computation of sequence mappability
• Dynamic and internal longest common substring
• Faster algorithms for 1-mappability of a sequence
• Faster algorithms for 1-mappability of a sequence

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5127201)