{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:32:22Z","timestamp":1725471142386},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540395836"},{"type":"electronic","value":"9783540395843"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11851561_19","type":"book-chapter","created":{"date-parts":[[2006,9,22]],"date-time":"2006-09-22T08:49:41Z","timestamp":1158914981000},"page":"197-206","source":"Crossref","is-referenced-by-count":9,"title":["Accelerating Motif Discovery: Motif Matching on Parallel Hardware"],"prefix":"10.1007","author":[{"given":"Geir Kjetil","family":"Sandve","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magnar","family":"Nedland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00d8yvind B\u00f8","family":"Syrstad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars Andreas","family":"Eidsheim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Osman","family":"Abul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Finn","family":"Drabl\u00f8s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Bailey, T.L., Elkan, C.: Fitting a mixture model by expectation maximization to discover motifs in biopolymers. In: Proc. Int. Conf. Intell. Syst. Mol. Biol. ISMB 1994, pp. 28\u201336 (1994)"},{"key":"19_CR2","first-page":"303","volume":"12","author":"W.N. Grundy","year":"1996","unstructured":"Grundy, W.N., Bailey, T.L., Elkan, C.P.: ParaMEME: a parallel implementation and a web interface for a DNA and protein motif discovery tool. Comput. Appl. Biosci.\u00a012, 303\u2013310 (1996)","journal-title":"Comput. Appl. Biosci."},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/3-540-46117-5_30","volume-title":"Field-Programmable Logic and Applications. Reconfigurable Computing Is Going Mainstream","author":"Y. Yamaguchi","year":"2002","unstructured":"Yamaguchi, Y., Miyajima, Y., Maruyama, T., Konagaya, A.: High speed homology search using run-time reconfiguration. In: Glesner, M., Zipf, P., Renovell, M. (eds.) FPL 2002. LNCS, vol.\u00a02438, pp. 281\u2013291. Springer, Heidelberg (2002)"},{"issue":"16","key":"19_CR4","doi-asserted-by":"publisher","first-page":"3431","DOI":"10.1093\/bioinformatics\/bti508","volume":"21","author":"T. Oliver","year":"2005","unstructured":"Oliver, T., Schmidt, B., Nathan, D., Clemens, R., Maskell, D.: Using reconfigurable hardware to accelerate multiple sequence alignment with ClustalW. Bioinformatics\u00a021(16), 3431\u20133432 (2005)","journal-title":"Bioinformatics"},{"key":"19_CR5","first-page":"512","volume-title":"Proc. Comput. Systems Bioinformatics Conf. CSB 2004","author":"T.S.T. Mak","year":"2004","unstructured":"Mak, T.S.T., Lam, K.P.: Embedded computation of maximum-likelihood phylogeny inference using platform FPGA. In: Proc. Comput. Systems Bioinformatics Conf. CSB 2004, pp. 512\u2013514. IEEE, Los Alamitos (2004)"},{"issue":"7","key":"19_CR6","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1109\/TVLSI.2004.830918","volume":"12","author":"A. Halaas","year":"2004","unstructured":"Halaas, A., Svingen, B., Nedland, M., S\u00e6trom, P., Sn\u00f8ve Jr., O., Birkeland, O.R.: A recursive MISD architecture for pattern matching. IEEE Trans. Very Large Scale Integr. Syst.\u00a012(7), 727\u2013734 (2004)","journal-title":"IEEE Trans. Very Large Scale Integr. Syst."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1145\/332306.332553","volume-title":"RECOMB 2000: Proceedings of the fourth annual international conference on Computational molecular biology","author":"L. Marsan","year":"2000","unstructured":"Marsan, L., Sagot, M.F.: Extracting structured motifs using a suffix tree-algorithms and application to promoter consensus identification. In: RECOMB 2000: Proceedings of the fourth annual international conference on Computational molecular biology, pp. 210\u2013219. ACM Press, New York (2000)"},{"issue":"5","key":"19_CR8","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1101\/gr.6902","volume":"12","author":"M. Blanchette","year":"2002","unstructured":"Blanchette, M., Tompa, M.: Discovery of regulatory elements by a computational method for phylogenetic footprinting. Genome Res.\u00a012(5), 739\u2013748 (2002)","journal-title":"Genome Res."},{"issue":"13","key":"19_CR9","doi-asserted-by":"publisher","first-page":"3586","DOI":"10.1093\/nar\/gkg618","volume":"31","author":"S. Sinha","year":"2003","unstructured":"Sinha, S., Tompa, M.: YMF: A program for discovery of novel transcription factor binding sites by statistical overrepresentation. Nucleic Acids Res.\u00a031(13), 3586\u20133588 (2003)","journal-title":"Nucleic Acids Res."},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1186\/1471-2105-6-121","volume":"6","author":"S. Bortoluzzi","year":"2005","unstructured":"Bortoluzzi, S., Coppe, A., Bisognin, A., Pizzi, C., Danieli, G.: A multistep bioinformatic approach detects putative regulatory elements in gene promoters. BMC Bioinformatics\u00a06(1), 121 (2005)","journal-title":"BMC Bioinformatics"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/prot.340070105","volume":"7","author":"C.E. Lawrence","year":"1990","unstructured":"Lawrence, C.E., Reilly, A.A.: An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins\u00a07(1), 41\u201351 (1990)","journal-title":"Proteins"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11851561_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:19:39Z","timestamp":1619493579000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11851561_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540395836","9783540395843"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11851561_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}