![](/img/cover-not-exists.png)
A branch-and-cut approach to the repetition-free longest common subsequence problem
Carlos E. Ferreira, Christian TjandraatmadjaVolume:
36
Year:
2010
Language:
english
Pages:
8
DOI:
10.1016/j.endm.2010.05.067
File:
PDF, 315 KB
english, 2010