"Repetition-free longest common subsequence."

Said Sadique Adi et al. (2010)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2009.04.023

access: open

type: Journal Article

metadata version: 2024-02-05

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/AdiBFFMSSTW10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/AdiBFFMSSTW10
Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco Aurelio Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi:
Repetition-free longest common subsequence. Discret. Appl. Math. 158(12): 1315-1324 (2010)

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.