"An algorithm for solving the longest increasing circular subsequence problem."

Sebastian Deorowicz (2009)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2009.02.019

access: closed

type: Journal Article

metadata version: 2017-06-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Deorowicz09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Deorowicz09
Sebastian Deorowicz:
An algorithm for solving the longest increasing circular subsequence problem. Inf. Process. Lett. 109(12): 630-634 (2009)

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.