@inproceedings{conf/bibm/YuHVHN13,
  added-at = {2023-03-24T00:00:00.000+0100},
  author = {Yu, Qiang and Huo, Hongwei and Vitter, Jeffrey Scott and Huan, Jun and Nekrich, Yakov},
  biburl = {https://www.bibsonomy.org/bibtex/2c8ad424aae5c0551e41f75336d8eb6fe/dblp},
  booktitle = {BIBM},
  crossref = {conf/bibm/2013},
  editor = {Li, Guo-Zheng and Kim, Sunghoon and Hughes, Michael and McLachlan, Geoffrey J. and Sun, Hongye and Hu, Xiaohua and Ressom, Habtom W. and Liu, Baoyan and Liebman, Michael N.},
  ee = {https://doi.ieeecomputersociety.org/10.1109/BIBM.2013.6732539},
  interhash = {35a2e1817b6fe0cdc7b38a10210e0c50},
  intrahash = {c8ad424aae5c0551e41f75336d8eb6fe},
  isbn = {978-1-4799-1309-1},
  keywords = {dblp},
  pages = {473-476},
  publisher = {IEEE Computer Society},
  timestamp = {2024-04-09T21:33:52.000+0200},
  title = {StemFinder: An efficient algorithm for searching motif stems over large alphabets.},
  url = {http://dblp.uni-trier.de/db/conf/bibm/bibm2013.html#YuHVHN13},
  year = 2013
}

{"_id":"bdwRtfqDTGMjSJE5n","bibbaseid":"yu-huo-vitter-huan-nekrich-stemfinderanefficientalgorithmforsearchingmotifstemsoverlargealphabets-2013","authorIDs":["tMZWAHYFLsA3GH2EL"],"author_short":["Yu, Q.","Huo, H.","Vitter, J. S.","Huan, J.","Nekrich, Y."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2023-03-24T00:00:00.000+0100","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/2c8ad424aae5c0551e41f75336d8eb6fe/dblp","booktitle":"BIBM","crossref":"conf/bibm/2013","editor":[{"propositions":[],"lastnames":["Li"],"firstnames":["Guo-Zheng"],"suffixes":[]},{"propositions":[],"lastnames":["Kim"],"firstnames":["Sunghoon"],"suffixes":[]},{"propositions":[],"lastnames":["Hughes"],"firstnames":["Michael"],"suffixes":[]},{"propositions":[],"lastnames":["McLachlan"],"firstnames":["Geoffrey","J."],"suffixes":[]},{"propositions":[],"lastnames":["Sun"],"firstnames":["Hongye"],"suffixes":[]},{"propositions":[],"lastnames":["Hu"],"firstnames":["Xiaohua"],"suffixes":[]},{"propositions":[],"lastnames":["Ressom"],"firstnames":["Habtom","W."],"suffixes":[]},{"propositions":[],"lastnames":["Liu"],"firstnames":["Baoyan"],"suffixes":[]},{"propositions":[],"lastnames":["Liebman"],"firstnames":["Michael","N."],"suffixes":[]}],"ee":"https://doi.ieeecomputersociety.org/10.1109/BIBM.2013.6732539","interhash":"35a2e1817b6fe0cdc7b38a10210e0c50","intrahash":"c8ad424aae5c0551e41f75336d8eb6fe","isbn":"978-1-4799-1309-1","keywords":"dblp","pages":"473-476","publisher":"IEEE Computer Society","timestamp":"2024-04-09T21:33:52.000+0200","title":"StemFinder: An efficient algorithm for searching motif stems over large alphabets.","url":"http://dblp.uni-trier.de/db/conf/bibm/bibm2013.html#YuHVHN13","year":"2013","bibtex":"@inproceedings{conf/bibm/YuHVHN13,\n added-at = {2023-03-24T00:00:00.000+0100},\n author = {Yu, Qiang and Huo, Hongwei and Vitter, Jeffrey Scott and Huan, Jun and Nekrich, Yakov},\n biburl = {https://www.bibsonomy.org/bibtex/2c8ad424aae5c0551e41f75336d8eb6fe/dblp},\n booktitle = {BIBM},\n crossref = {conf/bibm/2013},\n editor = {Li, Guo-Zheng and Kim, Sunghoon and Hughes, Michael and McLachlan, Geoffrey J. and Sun, Hongye and Hu, Xiaohua and Ressom, Habtom W. and Liu, Baoyan and Liebman, Michael N.},\n ee = {https://doi.ieeecomputersociety.org/10.1109/BIBM.2013.6732539},\n interhash = {35a2e1817b6fe0cdc7b38a10210e0c50},\n intrahash = {c8ad424aae5c0551e41f75336d8eb6fe},\n isbn = {978-1-4799-1309-1},\n keywords = {dblp},\n pages = {473-476},\n publisher = {IEEE Computer Society},\n timestamp = {2024-04-09T21:33:52.000+0200},\n title = {StemFinder: An efficient algorithm for searching motif stems over large alphabets.},\n url = {http://dblp.uni-trier.de/db/conf/bibm/bibm2013.html#YuHVHN13},\n year = 2013\n}\n\n","author_short":["Yu, Q.","Huo, H.","Vitter, J. S.","Huan, J.","Nekrich, Y."],"editor_short":["Li, G.","Kim, S.","Hughes, M.","McLachlan, G. J.","Sun, H.","Hu, X.","Ressom, H. W.","Liu, B.","Liebman, M. N."],"key":"conf/bibm/YuHVHN13","id":"conf/bibm/YuHVHN13","bibbaseid":"yu-huo-vitter-huan-nekrich-stemfinderanefficientalgorithmforsearchingmotifstemsoverlargealphabets-2013","role":"author","urls":{"Link":"https://doi.ieeecomputersociety.org/10.1109/BIBM.2013.6732539","Paper":"http://dblp.uni-trier.de/db/conf/bibm/bibm2013.html#YuHVHN13"},"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":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/yakov nekrich?items=1000","creationDate":"2020-05-16T22:41:00.967Z","downloads":0,"keywords":["dblp"],"search_terms":["stemfinder","efficient","algorithm","searching","motif","stems","over","large","alphabets","yu","huo","vitter","huan","nekrich"],"title":"StemFinder: An efficient algorithm for searching motif stems over large alphabets.","year":2013,"dataSources":["f7XsgZohqQ3Rphbct"]}