An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets. Yu, Q., Huo, H., Vitter, J. S., Huan, J., & Nekrich, Y. IEEE ACM Trans. Comput. Biol. Bioinform., 12(2):384-397, 2015.
An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets. [link]Link  An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets. [link]Paper  bibtex   
@article{journals/tcbb/YuHVHN15,
  added-at = {2023-04-03T00:00:00.000+0200},
  author = {Yu, Qiang and Huo, Hongwei and Vitter, Jeffrey Scott and Huan, Jun and Nekrich, Yakov},
  biburl = {https://www.bibsonomy.org/bibtex/2d22ecb9ee338d9efbac795f6c1e1f5ff/dblp},
  ee = {https://www.wikidata.org/entity/Q50856459},
  interhash = {7c9f05bb7b5ef91645c4d0cce4ca77cd},
  intrahash = {d22ecb9ee338d9efbac795f6c1e1f5ff},
  journal = {IEEE ACM Trans. Comput. Biol. Bioinform.},
  keywords = {dblp},
  number = 2,
  pages = {384-397},
  timestamp = {2024-04-08T15:24:48.000+0200},
  title = {An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets.},
  url = {http://dblp.uni-trier.de/db/journals/tcbb/tcbb12.html#YuHVHN15},
  volume = 12,
  year = 2015
}

Downloads: 0