Longest (k]-tuple common substrings

DOI10.1007/978-981-97-7752-5_8MaRDI QIDQ6989696zbMATH OpenFDO

Authors Tiantian Li, Haitao Jiang, Lusheng Wang, Daming Zhu

Publication date 29 April 2025

Full work available at URL https://doi.org/10.1007/978-981-97-7752-5_8

zbMATH Keywords

algorithmcommon substringcomplexity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A faster algorithm computing string edit distances
• A linear space algorithm for computing maximal common subsequences
• A space efficient algorithm for the longest common subsequence in \(k\)-length substrings
• Algorithms on Strings, Trees and Sequences
• LCSk: a refined similarity measure
• Longest common substring with approximately \(k\) mismatches
• On the complexity of finding gapped motifs
• The String-to-String Correction Problem
• Tight hardness results for LCS and other sequence similarity measures

Cited in

(3)

• Longest double-bounded \((k]\)-tuple common substrings
• Subsequence matching and LCS with segment number constraints
• Longest \((k]\)-tuple common substrings with interval length constraints

This page was built for publication: Longest \((k]\)-tuple common substrings

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