{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T17:10:40Z","timestamp":1724087440357},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"S9","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1186\/s12859-016-1130-6","type":"journal-article","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T03:43:00Z","timestamp":1468899780000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["RefSelect: a reference sequence selection algorithm for planted (l, d) motif search"],"prefix":"10.1186","volume":"17","author":[{"given":"Qiang","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongwei","family":"Huo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruixing","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dazheng","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey Scott","family":"Vitter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Huan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,19]]},"reference":[{"issue":"1","key":"1130_CR1","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1038\/nbt1053","volume":"23","author":"M Tompa","year":"2005","unstructured":"Tompa M, Li N, Bailey TL, Church GM, Moor BM, Eskin E, Favorov AV, Frith MC, Fu Y, Kent WJ, Makeev VJ, Mironov AA, Noble WS, Pavesi G, Pesole G, R\u00e9gnier M, Simonis N, Sinha S, Thijs G, van Helden J, Vandenbogaert M, Weng Z, Workman C, Ye C, Zhu Z. Assessing computational tools for the discovery of transcription factor binding sites. Nat Biotechnol. 2005;23(1):137\u201344.","journal-title":"Nat Biotechnol"},{"issue":"8","key":"1130_CR2","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1038\/nbt0806-959","volume":"24","author":"P D\u2019haeseleer","year":"2006","unstructured":"D\u2019haeseleer P. How does DNA sequence motif discovery work. Nat Biotechnol. 2006;24(8):959\u201361.","journal-title":"Nat Biotechnol"},{"key":"1130_CR3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1186\/1471-2105-6-277","volume":"6","author":"J Fang","year":"2005","unstructured":"Fang J, Haasl RJ, Dong Y, Lushington GH. Discover protein sequence signatures from protein-protein interaction data. BMC Bioinform. 2005;6:277.","journal-title":"BMC Bioinform"},{"key":"1130_CR4","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1186\/1471-2105-8-385","volume":"8","author":"E Redhead","year":"2007","unstructured":"Redhead E, Bailey TL. Discriminative motif discovery in DNA and protein sequences using the DEME algorithm. BMC Bioinform. 2007;8:385.","journal-title":"BMC Bioinform"},{"key":"1130_CR5","first-page":"269","volume-title":"Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology","author":"PA Pevzner","year":"2000","unstructured":"Pevzner PA, Sze SH. Combinatorial approaches to finding subtle signals in DNA sequences. In: Altman R, Bailey TL, editors. Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology. California: AAAI Press; 2000. p. 269\u201378."},{"key":"1130_CR6","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S0304-3975(03)00320-7","volume":"306","author":"PA Evans","year":"2003","unstructured":"Evans PA, Smith A, Wareham HT. On the complexity of finding common approximate substrings. Theor Comput Sci. 2003;306:407\u201330.","journal-title":"Theor Comput Sci"},{"key":"1130_CR7","first-page":"28","volume-title":"Proceedings of the 2nd International Conference on Intelligent Systems for Molecular Biology","author":"TL Bailey","year":"1994","unstructured":"Bailey TL, Elkan C. Fitting a mixture model by expectation maximization to discover motifs in biopolymers. In: Altman R, Brutlag D, editors. Proceedings of the 2nd International Conference on Intelligent Systems for Molecular Biology. California: AAAI Press; 1994. p. 28\u201336."},{"issue":"Suppl 7","key":"1130_CR8","doi-asserted-by":"crossref","first-page":"S21","DOI":"10.1186\/1471-2105-8-S7-S21","volume":"8","author":"M Das","year":"2007","unstructured":"Das M, Dai H. A survey of DNA motif finding algorithms. BMC Bioinform. 2007;8 Suppl 7:S21.","journal-title":"BMC Bioinform"},{"issue":"2","key":"1130_CR9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1093\/bib\/bbs016","volume":"14","author":"F Zambelli","year":"2013","unstructured":"Zambelli F, Pesole G, Pavesi G. Motif discovery and transcription factor binding sites before and after the next generation sequencing era. Brief Bioinform. 2013;14(2):225\u201337.","journal-title":"Brief Bioinform"},{"key":"1130_CR10","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1093\/nar\/gkl198","volume":"34","author":"TL Bailey","year":"2006","unstructured":"Bailey TL, Williams N, Misleh C, Li WW. MEME: discovering and analying DNA and protein sequence motifs. Nucleic Acids Res. 2006;34:369\u201373.","journal-title":"Nucleic Acids Res"},{"key":"1130_CR11","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1126\/science.8211139","volume":"262","author":"CE Lawrence","year":"1993","unstructured":"Lawrence CE, Altschul SF, Boguski MS, Liu JS, Neuwald AF, Wootton JC. Detecting subtle sequence signals: a Gibb's sampling strategy for multiple alignment. Science. 1993;262:208\u201314.","journal-title":"Science"},{"key":"1130_CR12","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1089\/10665270252935430","volume":"9","author":"J Buhler","year":"2002","unstructured":"Buhler J, Tompa M. Finding motifs using random projections. J Comput Biol. 2002;9:225\u201342.","journal-title":"J Comput Biol"},{"issue":"2","key":"1130_CR13","first-page":"52","volume":"15","author":"X Yang","year":"2004","unstructured":"Yang X, Rajapakse JC. Graphical approach to weak motif recognition. Genome Inform. 2004;15(2):52\u201362.","journal-title":"Genome Inform"},{"issue":"Suppl 11","key":"1130_CR14","doi-asserted-by":"crossref","first-page":"S8","DOI":"10.1186\/1471-2105-11-S11-S8","volume":"11","author":"H Sun","year":"2010","unstructured":"Sun H, Low MYH, Hsu WJ, Rajapakse JC. RecMotif: a novel fast algorithm for weak motif discovery. BMC Bioinform. 2010;11 Suppl 11:S8.","journal-title":"BMC Bioinform"},{"key":"1130_CR15","first-page":"822","volume-title":"Proceedings of the Second International Workshop on Bioinformatics Research and Applications","author":"J Davila","year":"2006","unstructured":"Davila J, Balla S, Rajasekaran S. Space and time efficient algorithms for planted motif search. In: Yi P, Zelikovsky A, editors. Proceedings of the Second International Workshop on Bioinformatics Research and Applications. UK: LNCS; 2006. p. 822\u20139."},{"issue":"4","key":"1130_CR16","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1109\/TCBB.2007.70241","volume":"4","author":"J Davila","year":"2007","unstructured":"Davila J, Balla S, Rajasekaran S. Fast and practical algorithms for planted (l, d) motif search. IEEE\/ACM Trans Comput Biol Bioinform. 2007;4(4):544\u201352.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"2","key":"1130_CR17","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TCBB.2014.2361668","volume":"12","author":"Q Yu","year":"2015","unstructured":"Yu Q, Huo H, Vitter JS, Huan J, Nekrich Y. An efficient exact algorithm for the motif stem search problem over large alphabets. IEEE\/ACM Trans Comput Biol Bioinform. 2015;12(2):384\u201394.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"10","key":"1130_CR18","volume":"7","author":"Q Yu","year":"2012","unstructured":"Yu Q, Huo H, Zhang Y, Guo H. PairMotif: a new pattern-driven algorithm for planted (l, d) DNA motif search. PLoS ONE. 2012;7(10), e48442.","journal-title":"PLoS ONE"},{"issue":"7","key":"1130_CR19","volume":"7","author":"H Dinh","year":"2012","unstructured":"Dinh H, Rajasekaran S, Davila J. qPMS7: a fast algorithm for finding (l, d)-motifs in DNA and protein sequences. PLoS ONE. 2012;7(7), e41425.","journal-title":"PLoS ONE"},{"issue":"2","key":"1130_CR20","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1109\/TCBB.2014.2306842","volume":"11","author":"S Tanaka","year":"2014","unstructured":"Tanaka S. Improved exact enumerative algorithms for the planted (l, d)-motif search problem. IEEE\/ACM Trans Comput Biol Bioinform. 2014;11(2):361\u201374.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"1130_CR21","doi-asserted-by":"crossref","unstructured":"Ho ES, Jakubowski CD, Gunderson SI. iTriplet, a rule-based nucleic acid sequence motif finder. Algorithm Mol Biol. 2009;4(14).","DOI":"10.1186\/1748-7188-4-14"},{"key":"1130_CR22","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1186\/1471-2105-12-410","volume":"12","author":"H Dinh","year":"2011","unstructured":"Dinh H, Rajasekaran S, Kundeti VK. PMS5: an efficient exact algorithm for the (l, d)-motif finding problem. BMC Bioinform. 2011;12:410.","journal-title":"BMC Bioinform"},{"key":"1130_CR23","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1186\/1471-2105-15-34","volume":"15","author":"M Nicolae","year":"2014","unstructured":"Nicolae M, Rajasekaran S. Efficient sequential and parallel algorithms for planted motif search. BMC Bioinform. 2014;15:34.","journal-title":"BMC Bioinform"},{"key":"1130_CR24","doi-asserted-by":"crossref","first-page":"7813","DOI":"10.1038\/srep07813","volume":"5","author":"M Nicolae","year":"2015","unstructured":"Nicolae M, Rajasekaran S. qPMS9: an efficient algorithm for querum planted motif search. Sci Rep. 2015;5:7813.","journal-title":"Sci Rep"},{"key":"1130_CR25","unstructured":"van Dongen S. Graph clustering by flow simulation. PhD thesis. The Netherlands: University of Utrecht; 2000."},{"key":"1130_CR26","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1186\/1471-2105-7-488","volume":"7","author":"S Brohee","year":"2006","unstructured":"Brohee S, van Helden J. Evaluation of clustering algorithms for protein-protein interaction. BMC Bioinform. 2006;7:488.","journal-title":"BMC Bioinform"},{"issue":"1","key":"1130_CR27","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L Dagum","year":"1998","unstructured":"Dagum L, Menon R. OpenMP: an industry-standard API for shared-memory programming. IEEE Comput Sci Eng. 1998;5(1):46\u201355.","journal-title":"IEEE Comput Sci Eng"},{"key":"1130_CR28","first-page":"109","volume-title":"Proceedings of the 15th international symposium on system synthesis","author":"M Sato","year":"2002","unstructured":"Sato M. OpenMP: parallel programming API for shared memory multiprocessors and on-chip multiprocessors. In: Aboulhamid EM, editor. Proceedings of the 15th international symposium on system synthesis. New York, USA: ACM Press; 2002. p. 109\u201311."},{"issue":"2","key":"1130_CR29","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1038\/nprot.2006.98","volume":"1","author":"TI Lee","year":"2006","unstructured":"Lee TI, Johnstone SE, Young RA. Chromatin immunoprecipitation and microarray-based analysis of protein location. Nature Protocols. 2006;1(2):729\u201348.","journal-title":"Nature Protocols"},{"key":"1130_CR30","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1038\/nmeth0807-613","volume":"4","author":"ER Mardis","year":"2007","unstructured":"Mardis ER. ChIP-seq: welcome to the new frontier. Nature Methods. 2007;4:613\u20134.","journal-title":"Nature Methods"},{"issue":"12","key":"1130_CR31","doi-asserted-by":"crossref","first-page":"1696","DOI":"10.1093\/bioinformatics\/btr189","volume":"27","author":"P Machanick","year":"2011","unstructured":"Machanick P, Bailey TL. MEME-ChIP: motif analysis of large DNA datasets. Bioinformatics. 2011;27(12):1696\u20137.","journal-title":"Bioinformatics"},{"issue":"12","key":"1130_CR32","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1093\/bioinformatics\/btu093","volume":"30","author":"D Quang","year":"2014","unstructured":"Quang D, Xie X. EXTREME: an online EM algorithm for motif discovery. Bioinformatics. 2014;30(12):1667\u201373.","journal-title":"Bioinformatics"},{"key":"1130_CR33","first-page":"569","volume-title":"Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine","author":"Q Yu","year":"2015","unstructured":"Yu Q, Huo H, Zhao R, Feng D, Vitter JS, Huan J. Reference sequence selection for motif searches. In: Ma B, Rajasekaran S, editors. Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine. Washington D.C., USA: IEEE Press; 2015. p. 569\u201374."}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-016-1130-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T06:32:20Z","timestamp":1568183540000},"score":1,"resource":{"primary":{"URL":"http:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-016-1130-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":33,"journal-issue":{"issue":"S9","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["1130"],"URL":"https:\/\/doi.org\/10.1186\/s12859-016-1130-6","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7]]},"article-number":"266"}}