Efficient Search Algorithms for the Restricted Longest Common Subsequence Problem

Title

Efficient Search Algorithms for the Restricted Longest Common Subsequence Problem

Identifier

/unibl/sci/idNaucniRad:34661
info:doi/https://doi.org/10.1007/978-3-031-63775-9_5

Type

See all items with this valueConference Paper
See all items with this valuetext

Date

See all items with this value2024-07

Bibliographic Citation

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

References

https://link.springer.com/chapter/10.1007/978-3-031-63775-9_5

page start

58

page end

73

presented at

24th International Conference on Computational Science

Is Part Of

See all items with this valueLNCS

list of authors

See all items with this valueMarko Đukanović
See all items with this valueAleksandar Kartelj
See all items with this valueTome Eftimov
See all items with this valueJaume Reixach
See all items with this valueChristian Blum

Position: 105320 (20 views)