{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:07Z","timestamp":1725512107167},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_21","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T05:07:56Z","timestamp":1209445676000},"page":"234-245","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences"],"prefix":"10.1007","author":[{"given":"Bin","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming-Yang","family":"Kao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Chin, F., Leung, H.: Voting algorithms for discovering long motifs. In: Proceedings of the 3rd Asia-Pacific Bioinformatics Conference, pp. 261\u2013272 (2005)","DOI":"10.1142\/9781860947322_0026"},{"key":"21_CR2","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. Computer Applications in the Biosciences\u00a09, 123\u2013125 (1993)","journal-title":"Computer Applications in the Biosciences"},{"key":"21_CR3","first-page":"113","volume":"30","author":"M. Frances","year":"1997","unstructured":"Frances, M., Litman, A.: On covering problems of codes. Theoretical Computer Science\u00a030, 113\u2013119 (1997)","journal-title":"Theoretical Computer Science"},{"key":"21_CR4","unstructured":"Ga\u0327sieniec, L., Jansson, J., Lingas, A.: Efficient approximation algorithms for the Hamming center problem. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. S905\u2013S906 (1999)"},{"key":"21_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)"},{"key":"21_CR6","unstructured":"Hertz, G., Stormo, G.: Identification of consensus patterns in unaligned DNA and protein sequences: a large-deviation statistical basis for penalizing gaps. In: Proceedings of the 3rd International Conference on Bioinformatics and Genome Research, pp. 201\u2013216 (1995)"},{"key":"21_CR7","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 (2002)","journal-title":"Bioinformatics"},{"key":"21_CR8","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":"21_CR9","unstructured":"Lanctot, J.K., Li, M., Ma, B., Wang, L., Zhang, L.: Distinguishing string selection problems. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 633\u2013642 (1999)"},{"key":"21_CR10","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":"21_CR11","doi-asserted-by":"crossref","unstructured":"Li, M., Ma, B., Wang, L.: Finding similar regions in many strings. In: Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing, pp. 473\u2013482 (1999)","DOI":"10.1145\/301250.301376"},{"issue":"2","key":"21_CR12","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. Journal of the ACM\u00a049(2), 157\u2013171 (2002)","journal-title":"Journal of the ACM"},{"key":"21_CR13","first-page":"525","volume":"7","author":"K. Lucas","year":"1991","unstructured":"Lucas, K., Busch, M., Mossinger, S., Thompson, J.: An improved microcomputer program for finding gene- or gene family-specific oligonucleotides suitable as primers for polymerase chain reactions or as probes. Computer Applications in the Biosciences\u00a07, 525\u2013529 (1991)","journal-title":"Computer Applications in the Biosciences"},{"key":"21_CR14","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"2000","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (2000)"},{"key":"21_CR15","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":"21_CR16","first-page":"253","volume":"12","author":"V. Proutski","year":"1996","unstructured":"Proutski, V., Holme, E.C.: Primer master: a new program for the design and analysis of PCR primers. Computer Applications in the Biosciences\u00a012, 253\u2013255 (1996)","journal-title":"Computer Applications in the Biosciences"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Stormo, G.: Consensus patterns in DNA. In: Doolitle, R.F. (ed.) Molecular evolution: computer analysis of protein and nucleic acid sequences. Methods in Enzymolog, 183, 211\u2013221 (1990)","DOI":"10.1016\/0076-6879(90)83015-2"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"5699","DOI":"10.1073\/pnas.88.13.5699","volume":"88","author":"G. Stormo","year":"1991","unstructured":"Stormo, G., Hartzell III, G.: Identifying protein-binding sites from unaligned DNA fragments. Proceedings of the National Academy of Sciences of the United States of America\u00a088, 5699\u20135703 (1991)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"issue":"5","key":"21_CR19","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1142\/S0219720005001508","volume":"3","author":"L. Wang","year":"2005","unstructured":"Wang, L., Dong, L.: Randomized algorithms for motif detection. Journal of Bioinformatics and Computational Biology\u00a03(5), 1039\u20131052 (2005)","journal-title":"Journal of Bioinformatics and Computational Biology"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:14:14Z","timestamp":1619522054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_21","relation":{},"subject":[]}}