EUVIMEDEUVIMED entdecken
Crossref

A Fast Algorithm for Finding a Maximal Common Subsequence of Multiple Strings

Miyuji HIROTA, Yoshifumi SAKAI

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences · 01.09.2023 · E106.A (9) · 1191-1194

DOI: 10.1587/transfun.2022dml0002 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, erschienen am 01.09.2023. Verfasst von Miyuji HIROTA und 1 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 7 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

HIROTA, M., & SAKAI, Y. (2023). A Fast Algorithm for Finding a Maximal Common Subsequence of Multiple Strings. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E106.A(9), 1191-1194. https://doi.org/10.1587/transfun.2022dml0002

Vancouver

HIROTA M, SAKAI Y. A Fast Algorithm for Finding a Maximal Common Subsequence of Multiple Strings. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 2023;E106.A(9):1191-1194. doi:10.1587/transfun.2022dml0002

BibTeX
@article{HIROTA2023,
  author = {HIROTA, Miyuji and SAKAI, Yoshifumi},
  title = {A Fast Algorithm for Finding a Maximal Common Subsequence of Multiple Strings},
  journal = {IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences},
  year = {2023},
  volume = {E106.A},
  number = {9},
  pages = {1191--1194},
  doi = {10.1587/transfun.2022dml0002}
}
Kostenlos starten →