Efficient Search Algorithms for the Restricted Longest Common Subsequence Problem
Naslov
Efficient Search Algorithms for the Restricted Longest Common Subsequence Problem
Identifikator
/unibl/sci/idNaucniRad:34661
Tip
Pronađite slične unoseConference Paper
Datum
Pronađite slične unose2024-07
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
Početna stranica
58
Krajnja stranica
73
Prezentovano
24th International Conference on Computational Science
Je dio
LNCS
Lista autora
Position: 110569 (17 views)