Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A branch-and-cut approach to the repetition-free longest common ..."

Carlos Eduardo Ferreira, Christian Tjandraatmadja (2010)

> Home

Details and statistics

DOI: 10.1016/J.ENDM.2010.05.067

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/endm/FerreiraT10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/FerreiraT10
Carlos Eduardo Ferreira, Christian Tjandraatmadja:
A branch-and-cut approach to the repetition-free longest common subsequence problem. Electron. Notes Discret. Math. 36: 527-534 (2010)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.