Cite
An O(N2) algorithm for discovering optimal Boolean pattern pairs.
MLA
Bannai, Hideo, et al. “An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs.” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 1, no. 4, Oct. 2004, pp. 159–70. EBSCOhost, https://doi.org/10.1109/TCBB.2004.36.
APA
Bannai, H., Hyyrö, H., Shinohara, A., Takeda, M., Nakai, K., & Miyano, S. (2004). An O(N2) algorithm for discovering optimal Boolean pattern pairs. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 1(4), 159–170. https://doi.org/10.1109/TCBB.2004.36
Chicago
Bannai, Hideo, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, and Satoru Miyano. 2004. “An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs.” IEEE/ACM Transactions on Computational Biology and Bioinformatics 1 (4): 159–70. doi:10.1109/TCBB.2004.36.