Longest double-bounded (k]-tuple common substrings

DOI10.1007/978-981-95-0218-9_26MaRDI QIDQ6866517zbMATH OpenFDO

Authors Tiantian Li, Siqi Jiang, Haitao Jiang, Daming Zhu

Publication date 28 January 2026

Full work available at URL https://doi.org/10.1007/978-981-95-0218-9_26

zbMATH Keywords

algorithmcommon substringcomplexity

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

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
• Dynamic and internal longest common substring
• LCSk: a refined similarity measure
• Longest \((k]\)-tuple common substrings
• On the complexity of finding gapped motifs
• Subsequence matching and LCS with segment number constraints
• The String-to-String Correction Problem
• Tight hardness results for LCS and other sequence similarity measures

Cited in

(1)

• Longest \((k]\)-tuple common substrings with interval length constraints

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

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