"An efficient algorithm for finding short approximate non-tandem repeats."

Ezekiel F. Adebiyi, Tao Jiang, Michael Kaufmann (2001)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2016-03-31

- no documents available
- export record
  dblp key:
  - conf/ismb/AdebiyiJK01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ismb/AdebiyiJK01
Ezekiel F. Adebiyi, Tao Jiang, Michael Kaufmann:
An efficient algorithm for finding short approximate non-tandem repeats. ISMB (Supplement of Bioinformatics) 2001: 5-12

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.