"An efficient polynomial space and polynomial delay algorithm for ..."

Hiroki Arimura, Takeaki Uno (2007)

> Home

Details and statistics

DOI: 10.1007/S10878-006-9029-1

access: closed

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/ArimuraU07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/ArimuraU07
Hiroki Arimura, Takeaki Uno:
An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. J. Comb. Optim. 13(3): 243-262 (2007)

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.