{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:36:17Z","timestamp":1725489377210},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734369"},{"type":"electronic","value":"9783540734376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73437-6_26","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T17:36:44Z","timestamp":1187026604000},"page":"253-264","source":"Crossref","is-referenced-by-count":1,"title":["Identification of Distinguishing Motifs"],"prefix":"10.1007","author":[{"given":"WangSen","family":"Feng","sequence":"first","affiliation":[]},{"given":"Zhanyong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","first-page":"28","volume-title":"Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology (ISMB-1994)","author":"T. Bailey","year":"1994","unstructured":"Bailey, T., Elkan, C.: Fitting a mixture model by expectation maximization to discover motifs in biopolymers. In: Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology (ISMB-1994), pp. 28\u201336. AAAI Press, Menlo PArk (1994)"},{"key":"26_CR2","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":"26_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":"26_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0022-2836(92)90723-W","volume":"223","author":"L.R. Cardon","year":"1992","unstructured":"Cardon, L.R., Stormo, G.D.: Expectation maximization algorithm for identifying protein-binding sites with variable lengths from unaligned DNA fragments. J. Mol. Biol.\u00a0223, 159\u2013170 (1992)","journal-title":"J. Mol. Biol."},{"issue":"4","key":"26_CR5","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/S0097539701397825","volume":"32","author":"X. Deng","year":"2003","unstructured":"Deng, X., Li, G., Li, Z., Ma, B., Wang, L.: Generic Drug Design without Side Effect. SIAM J on Computing\u00a032(4), 1073\u20131090 (2003)","journal-title":"SIAM J on Computing"},{"key":"26_CR6","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":"26_CR7","doi-asserted-by":"crossref","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)"},{"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 Intl Conf. Bioinformatics and Genome Research, pp. 201\u2013216 (1995)","key":"26_CR8"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0169-2607(01)00198-5","volume":"70","author":"Y.-J.H. Hu","year":"2003","unstructured":"Hu, Y.-J.H: Finding subtle motifs with variable gaps in unaligned DNA sequences. Computer Methods and Programs in Biomedicine\u00a070, 11\u201320 (2003)","journal-title":"Computer Methods and Programs in Biomedicine"},{"key":"26_CR10","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":"26_CR11","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 (2002b)","journal-title":"Bioinformatics"},{"doi-asserted-by":"crossref","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\u2013642 (Also to appear in Information and Computation)","key":"26_CR12","DOI":"10.1016\/S0890-5401(03)00057-9"},{"key":"26_CR13","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"},{"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, Atlanta, pp. 473\u2013482 (1999)","key":"26_CR14","DOI":"10.1145\/301250.301376"},{"key":"26_CR15","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 (special issue for Thirty-first Annual ACM Symposium on Theory of Computing). J. Comput. Syst. Sci.\u00a065, 73\u201396 (2002a)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"26_CR16","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 (2002b)","journal-title":"JACM"},{"key":"26_CR17","first-page":"525","volume":"7","author":"K. Lucas","year":"1991","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. CABIOS\u00a07, 525\u2013529 (1991)","journal-title":"CABIOS"},{"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":"26_CR18"},{"key":"26_CR19","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. CABIOS\u00a012, 253\u2013255 (1996)","journal-title":"CABIOS"},{"unstructured":"Stormo, G.: Consensus patterns in DNA. In: Doolittle, R.F.(ed.) Molecular evolution: computer analysis of protein and nucleic acid sequences, Methods in Enzymology, vol. 183, pp. 211\u2013221 (1990)","key":"26_CR20"},{"key":"26_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/bioinformatics\/btg1072","volume":"19","author":"A. Price","year":"2003","unstructured":"Price, A., Ramabhadran, S., Pevzner, P.: Finding Subtle Motifs by Branching from Sample Strings, Bioinformatics\u00a019, 149\u2013155 (2003)","journal-title":"Bioinformatics"},{"unstructured":"Keller, G.H., Manak, M.M.: DNA Probes, Stockton Press, p. 12 (1989)","key":"26_CR22"},{"key":"26_CR23","first-page":"8","volume-title":"PCR A Practical Approach","author":"M.J. McPearson","year":"1991","unstructured":"McPearson, M.J., Quirke, M.J., Taylor, G.R: PCR A Practical Approach, p. 8. Oxford University Press, New York (1991)"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"884","DOI":"10.1007\/978-3-540-30551-4_75","volume-title":"Algorithms and Computation","author":"L. Wang","year":"2004","unstructured":"Wang, L., Dong, L., Fan, H.: Randomized Algorithms for Motif Detection. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 884\u2013895. Springer, Heidelberg (2004)"},{"key":"26_CR25","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF02459500","volume":"46","author":"M. Waterman","year":"1984","unstructured":"Waterman, M., Arratia, R., Galas, E.: Pattern recognition in several sequences:consenus and alignment. Bull. Math. Biol.\u00a046, 515\u2013527 (1984)","journal-title":"Bull. Math. Biol."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73437-6_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:12:09Z","timestamp":1619518329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73437-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734369","9783540734376"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73437-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}