Finding a set of long common substrings with repeats from m input strings

DOI10.1007/978-981-96-8312-3_14MaRDI QIDQ6897290zbMATH OpenFDO

Authors Tiantian Li, Lusheng Wang, Daming Zhu

Publication date 20 November 2025

Full work available at URL https://doi.org/10.1007/978-981-96-8312-3_14

zbMATH Keywords

algorithmcommon substringsdynamic programmingstring

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS
• Algorithms on Strings, Trees and Sequences
• Longest common prefix with mismatches
• Longest common prefixes with k-mismatches and applications
• Longest common substrings with k mismatches

This page was built for publication: Finding a set of long common substrings with repeats from \(m\) input strings

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