EUVIMEDEUVIMED entdecken
Crossref

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

Tiantian Li, Siqi Jiang, Haitao Jiang, Daming Zhu

Theoretical Computer Science · 2026-09 · 1083 · 116143

DOI: 10.1016/j.tcs.2026.116143 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-09. Verfasst von Tiantian Li und 3 weiteren Autor:innen. Die Arbeit nennt 28 Literaturangaben. Gefördert von: National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

Li, T., Jiang, S., Jiang, H., & Zhu, D. (2026). Longest (k]-tuple common substrings with interval length constraints. Theoretical Computer Science, 1083, 116143. https://doi.org/10.1016/j.tcs.2026.116143

Vancouver

Li T, Jiang S, Jiang H, Zhu D. Longest (k]-tuple common substrings with interval length constraints. Theoretical Computer Science. 2026;1083:116143. doi:10.1016/j.tcs.2026.116143

BibTeX
@article{Li2026,
  author = {Li, Tiantian and Jiang, Siqi and Jiang, Haitao and Zhu, Daming},
  title = {Longest (k]-tuple common substrings with interval length constraints},
  journal = {Theoretical Computer Science},
  year = {2026},
  volume = {1083},
  pages = {116143},
  doi = {10.1016/j.tcs.2026.116143}
}
Kostenlos starten →