Efficient Search Algorithms for the Restricted Longest Common Subsequence Problem

Naslov

Efficient Search Algorithms for the Restricted Longest Common Subsequence Problem

Identifikator

Tip

Datum

Bibliografski citat

M. Đukanović, A. Kartelj, T. Eftimov, J. Reixach, C. Blum, Efficient Search Algorithms for the Restricted Longest Common Subsequence Problem, LNCS, pp. 58 - 73, Jul, 2024

Referenca

Početna stranica

58

Krajnja stranica

73

Prezentovano

24th International Conference on Computational Science

Je dio

LNCS

Lista autora

Position: 110569 (17 views)