"Efficient Branch and Bound Motif Finding with Maximum Accuracy based on ..."

Sanjay Soundarajan, Michelle Salomon, Jin H. Park (2019)

> Home

Details and statistics

DOI: 10.1109/CCWC.2019.8666485

access: closed

type: Conference or Workshop Paper

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ccwc/SoundarajanSP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ccwc/SoundarajanSP19
Sanjay Soundarajan, Michelle Salomon, Jin H. Park:
Efficient Branch and Bound Motif Finding with Maximum Accuracy based on Hashing. CCWC 2019: 866-872

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.