"An Efficient Algorithm for the Extended (l, d)-Motif Problem with Unknown ..."

Henry C. M. Leung, Francis Y. L. Chin (2005)

> Home

Details and statistics

DOI: 10.1109/BIBE.2005.12

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  authority control:
- export record
  dblp key:
  - conf/bibe/LeungC05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bibe/LeungC05
Henry C. M. Leung, Francis Y. L. Chin:
An Efficient Algorithm for the Extended (l, d)-Motif Problem with Unknown Number of Binding Sites. BIBE 2005: 11-18

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.