Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency

Francis Y. L. Chin, Henry C. M. Leung, Man-Hung Siu, Siu-Ming Yiu. Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency. In Alvis Brazma, Satoru Miyano, Tatsuya Akutsu, editors, Proceedings of the 6th Asia-Pacific Bioinformatics Conference, APBC 2008, 14-17 January 2008, Kyoto, Japan. Volume 6 of Advances in Bioinformatics and Computational Biology, pages 343-352, Imperial College Press, 2008. [doi]

@inproceedings{ChinLSY08,
  title = {Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency},
  author = {Francis Y. L. Chin and Henry C. M. Leung and Man-Hung Siu and Siu-Ming Yiu},
  year = {2008},
  url = {http://www.comp.nus.edu.sg/~wongls/psZ/apbc2008/apbc064a.pdf},
  tags = {C++},
  researchr = {https://researchr.org/publication/ChinLSY08},
  cites = {0},
  citedby = {0},
  pages = {343-352},
  booktitle = {Proceedings of the 6th Asia-Pacific Bioinformatics Conference, APBC 2008, 14-17 January 2008, Kyoto, Japan},
  editor = {Alvis Brazma and Satoru Miyano and Tatsuya Akutsu},
  volume = {6},
  series = {Advances in Bioinformatics and Computational Biology},
  publisher = {Imperial College Press},
  isbn = {978-1-84816-108-5},
}