Efficient Branch and Bound Motif Finding with Maximum Accuracy based on Hashing

Sanjay Soundarajan, Michelle Salomon, Jin H. Park. Efficient Branch and Bound Motif Finding with Maximum Accuracy based on Hashing. In IEEE 9th Annual Computing and Communication Workshop and Conference, CCWC 2019, Las Vegas, NV, USA, January 7-9, 2019. pages 866-872, IEEE, 2019. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.