"Quick-MLCS: a new algorithm for the multiple longest common subsequence ..."

Majid Sazvar, Mahmoud Naghibzadeh, Nayyereh Saadati (2012)

> Home

Details and statistics

DOI: 10.1145/2347583.2347591

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/c3s2e/SazvarNS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/c3s2e/SazvarNS12
Majid Sazvar, Mahmoud Naghibzadeh, Nayyereh Saadati:
Quick-MLCS: a new algorithm for the multiple longest common subsequence problem. C3S2E 2012: 61-66

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.