"Two parallel algorithms for finding all minimal maximum subsequences."

H. K. Dai, Zhu Wang (2019)

> Home

Details and statistics

DOI: 10.1016/J.JCSS.2018.11.001

access: closed

type: Journal Article

metadata version: 2022-11-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jcss/DaiW19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/DaiW19
H. K. Dai, Zhu Wang:
Two parallel algorithms for finding all minimal maximum subsequences. J. Comput. Syst. Sci. 104: 216-243 (2019)

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.