Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Efficient algorithms for the longest common subsequence problem with ..."

Chiou-Ting Tseng, Chang-Biau Yang, Hsing-Yen Ann (2013)

> Home

Details and statistics

DOI: 10.1016/J.JCO.2012.08.002

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jc/TsengYA13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jc/TsengYA13
Chiou-Ting Tseng, Chang-Biau Yang, Hsing-Yen Ann:
Efficient algorithms for the longest common subsequence problem with sequential substring constraints. J. Complex. 29(1): 44-52 (2013)

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.