@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
}

{"_id":"6fyhZdFtSGGCWXRKx","bibbaseid":"yu-huo-vitter-huan-nekrich-anefficientexactalgorithmforthemotifstemsearchproblemoverlargealphabets-2015","authorIDs":["tMZWAHYFLsA3GH2EL"],"author_short":["Yu, Q.","Huo, H.","Vitter, J. S.","Huan, J.","Nekrich, Y."],"bibdata":{"bibtype":"article","type":"article","added-at":"2023-04-03T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Yu"],"firstnames":["Qiang"],"suffixes":[]},{"propositions":[],"lastnames":["Huo"],"firstnames":["Hongwei"],"suffixes":[]},{"propositions":[],"lastnames":["Vitter"],"firstnames":["Jeffrey","Scott"],"suffixes":[]},{"propositions":[],"lastnames":["Huan"],"firstnames":["Jun"],"suffixes":[]},{"propositions":[],"lastnames":["Nekrich"],"firstnames":["Yakov"],"suffixes":[]}],"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","bibtex":"@article{journals/tcbb/YuHVHN15,\n added-at = {2023-04-03T00:00:00.000+0200},\n author = {Yu, Qiang and Huo, Hongwei and Vitter, Jeffrey Scott and Huan, Jun and Nekrich, Yakov},\n biburl = {https://www.bibsonomy.org/bibtex/2d22ecb9ee338d9efbac795f6c1e1f5ff/dblp},\n ee = {https://www.wikidata.org/entity/Q50856459},\n interhash = {7c9f05bb7b5ef91645c4d0cce4ca77cd},\n intrahash = {d22ecb9ee338d9efbac795f6c1e1f5ff},\n journal = {IEEE ACM Trans. Comput. Biol. Bioinform.},\n keywords = {dblp},\n number = 2,\n pages = {384-397},\n timestamp = {2024-04-08T15:24:48.000+0200},\n title = {An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets.},\n url = {http://dblp.uni-trier.de/db/journals/tcbb/tcbb12.html#YuHVHN15},\n volume = 12,\n year = 2015\n}\n\n","author_short":["Yu, Q.","Huo, H.","Vitter, J. S.","Huan, J.","Nekrich, Y."],"key":"journals/tcbb/YuHVHN15","id":"journals/tcbb/YuHVHN15","bibbaseid":"yu-huo-vitter-huan-nekrich-anefficientexactalgorithmforthemotifstemsearchproblemoverlargealphabets-2015","role":"author","urls":{"Link":"https://www.wikidata.org/entity/Q50856459","Paper":"http://dblp.uni-trier.de/db/journals/tcbb/tcbb12.html#YuHVHN15"},"keyword":["dblp"],"metadata":{"authorlinks":{"nekrich, y":"https://bibbase.org/show?bib=http%3A%2F%2Fwww.bibsonomy.org%2Fbib%2Fauthor%2Fyakov%20nekrich%3Fitems=1000&msg=embed"}},"downloads":0},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/yakov nekrich?items=1000","creationDate":"2020-05-16T22:41:00.904Z","downloads":0,"keywords":["dblp"],"search_terms":["efficient","exact","algorithm","motif","stem","search","problem","over","large","alphabets","yu","huo","vitter","huan","nekrich"],"title":"An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets.","year":2015,"dataSources":["f7XsgZohqQ3Rphbct"]}