{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T18:33:35Z","timestamp":1721932415189},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"S8","license":[{"start":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T00:00:00Z","timestamp":1285891200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1186\/1471-2105-11-s8-s1","type":"journal-article","created":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T18:16:56Z","timestamp":1288117016000},"source":"Crossref","is-referenced-by-count":22,"title":["Efficient motif finding algorithms for large-alphabet inputs"],"prefix":"10.1186","volume":"11","author":[{"given":"Pavel P","family":"Kuksa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Pavlovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,26]]},"reference":[{"key":"4255_CR1","first-page":"200","volume-title":"In Proc. of Advances in Neural Information Processing Systems","author":"EP Xing","year":"2003","unstructured":"Xing EP, Jordan MI, Karp RM, Russell S: A hierarchical Bayesian Markovian model for motifs in biopolymer sequences. In In Proc. of Advances in Neural Information Processing Systems. MIT Press; 2003:200\u20133."},{"key":"4255_CR2","unstructured":"Pevzner PA, Sze SH: Combinatorial Approaches to Finding Subtle Signals in DNA Sequences. In Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology. Volume 0. AAAI Press; 2000:269\u2013278."},{"issue":"12","key":"4255_CR3","doi-asserted-by":"publisher","first-page":"2989","DOI":"10.1523\/JNEUROSCI.4649-03.2004","volume":"24","author":"JM Fellous","year":"2004","unstructured":"Fellous JM, Tiesinga PHE, Thomas PJ, Sejnowski TJ: Discovering Spike Patterns in Neuronal Responses. J. Neurosci. 2004, 24(12):2989\u20133001. [\n                    http:\/\/www.jneurosci.org\/cgi\/content\/abstract\/24\/12\/2989\n                    \n                  ] 10.1523\/JNEUROSCI.4649-03.2004","journal-title":"J. Neurosci"},{"key":"4255_CR4","first-page":"587","volume-title":"Advances in Neural Information Processing Systems 18","author":"N Jojic","year":"2006","unstructured":"Jojic N, Jojic V, Frey B, Meek C, Heckerman D: Using \u201cepitomes\u201d to model genetic diversity: Rational design of HIV vaccine cocktails. In Advances in Neural Information Processing Systems 18. Edited by: Weiss Y, Sch\u00f6lkopf B, Platt J. Cambridge, MA: MIT Press; 2006:587\u2013594."},{"issue":"suppl1","key":"4255_CR5","doi-asserted-by":"publisher","first-page":"S354","DOI":"10.1093\/bioinformatics\/18.suppl_1.S354","volume":"18","author":"E Eskin","year":"2002","unstructured":"Eskin E, Pevzner PA: Finding composite regulatory patterns in DNA sequences. Bioinformatics 2002, 18(suppl1):S354\u2013363. [\n                    http:\/\/bioinformatics.oxfordjournals.org\/cgi\/content\/abstract\/18\/suppl_1\/S354\n                    \n                  ]","journal-title":"Bioinformatics"},{"key":"4255_CR6","first-page":"757","volume-title":"In LATIN","author":"N Pisanti","year":"2006","unstructured":"Pisanti N, Carvalho AM, Marsan L, Sagot MF: RISOTTO: Fast Extraction of Motifs with Mismatches. In LATIN 2006, 757\u2013768."},{"key":"4255_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1038\/nbt1053","volume":"23","author":"M Tompa","year":"2005","unstructured":"Tompa M, Li N, Bailey T, Church G, Moor BD: Assessing computational tools for the discovery of transcription factor binding sites. Nat Biotechnol 2005, 23: 137\u2013144. 10.1038\/nbt1053","journal-title":"Nat Biotechnol"},{"key":"4255_CR8","first-page":"261","volume-title":"APBC","author":"FYL Chin","year":"2005","unstructured":"Chin FYL, Leung HCM: Voting algorithms for discovering long motifs. APBC 2005, 261\u2013271. [\n                    http:\/\/www.comp.nus.edu.sg\/~wongls\/psZ\/apbc2005\/camera-ready\/212.pdf\n                    \n                  ]"},{"key":"4255_CR9","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/BFb0054337","volume-title":"LATIN \u201998: Proceedings of the Third Latin American Symposium on Theoretical Informatics","author":"MF Sagot","year":"1998","unstructured":"Sagot MF: Spelling Approximate Repeated or Common Motifs Using a Suffix Tree. In LATIN \u201998: Proceedings of the Third Latin American Symposium on Theoretical Informatics. London, UK: Springer-Verlag; 1998:374\u2013390. full_text"},{"issue":"4","key":"4255_CR10","doi-asserted-by":"publisher","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 Transactions on Computational Biology and Bioinformatics 2007, 4(4):544\u2013552. 10.1109\/TCBB.2007.70241","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"4255_CR11","first-page":"1435","volume":"5","author":"C Leslie","year":"2004","unstructured":"Leslie C, Kuang R: Fast String Kernels using Inexact Matching for Protein Sequences. J. Mach. Learn. Res. 2004, 5: 1435\u20131455. [\n                    http:\/\/jmlr.csail.mit.edu\/papers\/volume5\/leslie04a\/leslie04a.pdf\n                    \n                  ]","journal-title":"J. Mach. Learn. Res"},{"issue":"1-2","key":"4255_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF00993379","volume":"21","author":"TL Bailey","year":"1995","unstructured":"Bailey TL, Elkan C: Unsupervised Learning of Multiple Motifs in Biopolymers Using Expectation Maximization. Mach. Learn. 1995, 21(1\u20132):51\u201380. 10.1007\/BF00993379","journal-title":"Mach. Learn"},{"key":"4255_CR13","first-page":"881","volume-title":"In NIPS","author":"P Kuksa","year":"2008","unstructured":"Kuksa P, Huang PH, Pavlovic V: Scalable Algorithms for String Kernels with Inexact Matching. In NIPS 2008, 881\u2013888."},{"issue":"4","key":"4255_CR14","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1073\/pnas.86.4.1183","volume":"86","author":"GD Stormo","year":"1989","unstructured":"Stormo GD, Hartzell GW: Identifying protein-binding sites from unaligned DNA fragments. Proceedings of the National Academy of Sciences of the United States of America 1989, 86(4):1183\u20131187. [\n                    http:\/\/www.pnas.org\/content\/86\/4\/1183.abstract\n                    \n                  ] 10.1073\/pnas.86.4.1183","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"4255_CR15","unstructured":"RegulonDB.[\n                    http:\/\/regulondb.ccg.unam.mx\/\n                    \n                  ]"},{"key":"4255_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/prot.340070105","volume":"7","author":"C Lawrence","year":"1990","unstructured":"Lawrence C, Reilly A: An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins 1990, 7: 41\u201351. 10.1002\/prot.340070105","journal-title":"Proteins"},{"issue":"5131","key":"4255_CR17","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1126\/science.8211139","volume":"262","author":"C Lawrence","year":"1993","unstructured":"Lawrence C, Altschul S, Boguski M, Liu J, Neuwald A, Wootton J: Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment. Science 1993, 262(5131):208\u2013214. [\n                    http:\/\/www.sciencemag.org\/cgi\/content\/abstract\/262\/5131\/208\n                    \n                  ] 10.1126\/science.8211139","journal-title":"Science"},{"issue":"11","key":"4255_CR18","doi-asserted-by":"publisher","first-page":"4107","DOI":"10.1073\/pnas.0510747103","volume":"103","author":"AE Kister","year":"2006","unstructured":"Kister AE, Fokas AS, Papatheodorou TS, Gelfand IM: Strict rules determine arrangements of strands in sandwich proteins. Proceedings of the National Academy of Sciences of the United States of America 2006, 103(11):4107\u20134110. [\n                    http:\/\/www.pnas.org\/content\/103\/11\/4107.abstract\n                    \n                  ] 10.1073\/pnas.0510747103","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"4255_CR19","unstructured":"Super-Secondary Structure Database.[\n                    http:\/\/binfs.umdnj.edu\/sssdb\/\n                    \n                  ]"},{"key":"4255_CR20","first-page":"47","volume-title":"In WADS","author":"PA Evans","year":"2003","unstructured":"Evans PA, Smith AD: Toward Optimal Motif Enumeration. In WADS 2003, 47\u201358."}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-11-S8-S1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1471-2105-11-S8-S1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-11-S8-S1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,23]],"date-time":"2019-01-23T07:38:33Z","timestamp":1548229113000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-11-S8-S1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10]]},"references-count":20,"journal-issue":{"issue":"S8","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["4255"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-11-s8-s1","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10]]},"article-number":"S1"}}