"An Algorithm to Solve the Motif Alignment Problem for Approximate Nested ..."

Atheer A. Matroud, Michael D. Hendy, Christopher P. Tuffley (2010)

> Home

Details and statistics

DOI: 10.1007/978-3-642-16181-0_16

access: closed

type: Conference or Workshop Paper

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/recomb/MatroudHT10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/recomb/MatroudHT10
Atheer A. Matroud, Michael D. Hendy, Christopher P. Tuffley:
An Algorithm to Solve the Motif Alignment Problem for Approximate Nested Tandem Repeats. RECOMB-CG 2010: 188-197

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.