{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:18Z","timestamp":1725559158827},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_75","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"884-895","source":"Crossref","is-referenced-by-count":3,"title":["Randomized Algorithms for Motif Detection"],"prefix":"10.1007","author":[{"given":"Lusheng","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"75_CR1","first-page":"51","volume":"21","author":"T. Bailey","year":"1995","unstructured":"Bailey, T., Elkan, C.: Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Machine Learning\u00a021, 51\u201380 (1995)","journal-title":"Machine Learning"},{"key":"75_CR2","doi-asserted-by":"crossref","unstructured":"Blanchette, M.: Algorithms for phylogenetic footprinting. In: RECOMB 01: Proceedings of the Fifth Annual International Conference on Computational Molecular Biology, pp. 49\u201358 (2001)","DOI":"10.1145\/369133.369170"},{"key":"75_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1089\/10665270252935430","volume":"9","author":"J. Buhler","year":"2002","unstructured":"Buhler, J., Tompa, M.: Finding motifs using random projections. Journal of Computational Biology\u00a09, 225\u2013242 (2002)","journal-title":"Journal of Computational Biology"},{"key":"75_CR4","first-page":"123","volume":"9","author":"J. Dopazo","year":"1993","unstructured":"Dopazo, J., Rodr\u00edguez, A., S\u00e1iz, J.C., Sobrino, F.: Design of primers for PCR amplification of highly variable genomes. CABIOS\u00a09, 123\u2013125 (1993)","journal-title":"CABIOS"},{"key":"75_CR5","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/S0959-440X(97)80058-9","volume":"7","author":"L. Duret","year":"1997","unstructured":"Duret, L., Bucher, P.: Searching for regulatory elements in human noncoding sequences. Curr. Opin. Struct. Biol.\u00a07, 399\u2013406 (1997)","journal-title":"Curr. Opin. Struct. Biol."},{"key":"75_CR6","doi-asserted-by":"publisher","first-page":"2315","DOI":"10.1093\/nar\/21.10.2315","volume":"21","author":"L. Duret","year":"1993","unstructured":"Duret, L., Dorkeld, F., Gautier, C.: Strong conservation of non-coding sequences during vertebrates evolution: potential involvement in post-transcriptional regulation of gene expression. Nucleic Acids Research\u00a021, 2315\u20132322 (1993)","journal-title":"Nucleic Acids Research"},{"key":"75_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"75_CR8","unstructured":"Hertz, G., Stormo, G.: Identification of consensus patterns in unaligned DNA and protein sequences: a large-deviation statistical basis for penalizing gaps. In: Proc. 3rd Int\u2019l Conf. Bioinformatics and Genome Research, pp. 201\u2013216 (1995)"},{"key":"75_CR9","doi-asserted-by":"publisher","first-page":"1374","DOI":"10.1093\/bioinformatics\/18.10.1374","volume":"18","author":"U. Keich","year":"2002","unstructured":"Keich, U., Pevzner, P.: Finding motifs in the twilight zone. Bioinformatics\u00a018, 1374\u20131381 (2002a)","journal-title":"Bioinformatics"},{"key":"75_CR10","doi-asserted-by":"publisher","first-page":"1382","DOI":"10.1093\/bioinformatics\/18.10.1382","volume":"18","author":"U. Keich","year":"2002","unstructured":"Keich, U., Pevzner, P.: Subtle motifs: defining the limits of motif finding algorithms. Bioinformatics\u00a018, 1382\u20131390 (2002)","journal-title":"Bioinformatics"},{"key":"#cr-split#-75_CR11.1","unstructured":"Lanctot, K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. In: Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, pp. 633???642 (1999);"},{"key":"#cr-split#-75_CR11.2","unstructured":"Also to appear in Information and Computation."},{"key":"75_CR12","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\u00a07, 41\u201351 (1990)","journal-title":"Proteins"},{"key":"75_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jcss.2002.1823","volume":"65","author":"M. Li","year":"2002","unstructured":"Li, M., Ma, B., Wang, L.: Finding Similar Regions in Many Sequences. J. Comput. Syst. Sci.\u00a065, 73\u201396 (2002); special issue for Thirty-first Annual ACM Symposium on Theory of Computing","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"75_CR14","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/506147.506150","volume":"49","author":"M. Li","year":"2002","unstructured":"Li, M., Ma, B., Wang, L.: On the closest string and substring problems. JACM\u00a049(2), 157\u2013171 (2002)","journal-title":"JACM"},{"key":"75_CR15","doi-asserted-by":"crossref","unstructured":"Lucas, K., Busch, M., M\u00f6ssinger, S., Thompson, J.A.: An improved microcomputer program for finding gene- or gene family-specific oligonucleotides suitable as primers for polymerase chain reactions or as probes. In: CABIOS, vol.\u00a07, pp. 525\u2013529 (1991)","DOI":"10.1093\/bioinformatics\/7.4.525"},{"key":"75_CR16","unstructured":"Pevzner, P., Sze, S.: Combinatorial approaches to finding subtle signals in DNA sequences. In: Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology, pp. 269\u2013278 (2000)"},{"key":"75_CR17","doi-asserted-by":"crossref","unstructured":"Proutski, V., Holme, E.C.: Primer Master: a new program for the design and analysis of PCR primers. In: CABIOS, vol.\u00a012, pp. 253\u2013255 (1996)","DOI":"10.1093\/bioinformatics\/12.3.253"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_75.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:33Z","timestamp":1605759693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}