Fingerprint
Dive into the research topics of 'Exact algorithms for the repetition-bounded longest common subsequence problem'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
Exact algorithms for the repetition-bounded longest common subsequence problem
Yuichi Asahiro, Jesper Andreas Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
Research output: Journal article publication › Journal article › Academic research › peer-review
6
Citations
(Scopus)