{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:27:38Z","timestamp":1725492458084},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442110"},{"type":"electronic","value":"9783540457848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45784-4_11","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T10:33:38Z","timestamp":1192530818000},"page":"140-156","source":"Crossref","is-referenced-by-count":7,"title":["Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation"],"prefix":"10.1007","author":[{"given":"Ezekiel F.","family":"Adebiyi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"crossref","first-page":"S5","DOI":"10.1093\/bioinformatics\/17.suppl_1.S5","volume":"17","author":"E. F. Adebiyi","year":"2001","unstructured":"E. F. Adebiyi, T. Jiang, and M. Kaufmann. An efficient algorithm for finding short approximate non-tandem repeats (Extended Abstract). Bioinformatics, 17(1):S5\u2013S13, 2001.","journal-title":"Bioinformatics"},{"key":"11_CR2","unstructured":"E. F. Adebiyi. Pattern Discovery in Biology and Strings Sorting: Theory and Experimentation. Ph. D Thesis, 2002."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0166-218X(92)90270-K","volume":"24","author":"A. Blumer","year":"1989","unstructured":"A. Blumer and A. Ehrenfeucht and others. Average size of suffix trees and DAWGS. Discrete Applied Mathematics, 24, 37\u201345, 1989.","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"11_CR4","first-page":"431","volume":"12","author":"J.-M. Claverie","year":"1996","unstructured":"J.-M. Claverie and S. Audic. The Statistical significance of nucleotide position-weight matrix matches. Computer Applications in Biosciences 12(5), 431\u2013439, 1996.","journal-title":"Computer Applications in Biosciences"},{"key":"11_CR5","unstructured":"M. Crochemore and M.-F. Sagot. Motifs in sequences: localization and extraction. In Handbook of Computational Chemistry, Crabbe, Drew, Konopka, eds., Marcel Dekker, Inc., 2001. To appear."},{"key":"11_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees and sequences","author":"D. Gusfield","year":"1997","unstructured":"D. Gusfield. Algorithms on strings, trees and sequences. Cambridge University Press, New York, 1997."},{"issue":"13","key":"11_CR7","doi-asserted-by":"publisher","first-page":"2351","DOI":"10.1093\/nar\/23.13.2351","volume":"23","author":"J. D. Helmann","year":"1995","unstructured":"J. D. Helmann. Compilation and analysis of Bacillus Subtilis \u03c3 A -dependent promoter sequences: evidence for extended contact between RNA polymerase and up-stream promoter DNA., Nucleic Acids Research, 23(13): 2351\u20132360, 1995.","journal-title":"Nucleic Acids Research"},{"key":"11_CR8","series-title":"Lect Notes Comput Sci","first-page":"230","volume-title":"Color set size problem with applications to string matching","author":"L. C. K. Hui","year":"1992","unstructured":"L. C. K. Hui. Color set size problem with applications to string matching. In CPM Proceeding, vol. 644 of LNCS, 230\u2013243, 1992."},{"key":"11_CR9","unstructured":"S. Karlin, F. Ost, and B. E. Blaisdell. Patterns in DNA and amino acid sequences and their statistical significance. In M. S. Waterman, editor, Mathematical Methods for DNA Sequences, 133\u2013158, 1989."},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1101\/gad.11.10.1277","volume":"11","author":"C. J. McInerny","year":"1997","unstructured":"C. J. McInerny, J. F. Patridge, G. E. Mikesell, D. P. Creemer, and L. L. Breeden. A novel Mcm1-dependent element in the SWI4, CLN3, CDC6, CDC46, and CDC47 promoters activates M\/G 1 -specific transcription. Genes and Development, 11: 1277\u20131288, 1997.","journal-title":"Genes and Development"},{"issue":"4\u20135","key":"11_CR11","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF01185432","volume":"12","author":"E. Myers","year":"1994","unstructured":"E. Myers. A sub-linear algorithm for approximate keyword matching. Algorithmica 12, 4\u20135, 345\u2013374, 1994.","journal-title":"Algorithmica"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"L. Marsan and M. F. Sagot. Extracting structured motifs using a suffix tree-algorithms and application to promoter consensus identification. RECOMB 2000.","DOI":"10.1145\/332306.332553"},{"key":"11_CR13","unstructured":"P. Pevzner and S.-H. Sze. Combinatorial approaches to finding subtle signals in DNA sequences. ISMB, 269\u2013278, 2000."},{"key":"11_CR14","unstructured":"W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes. In The Art of Scientific Computing, Cambridge University Press, Cambridge."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"E. Rocke and M. Tompa. An algorithm for finding novel gaped motifs in DNA sequences. RECOMB, 228\u2013233, 1998.","DOI":"10.1145\/279069.279119"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"B. Schieber and U. Vishkin. On Finding Lowest Common Ancestors: Simplification and Parallelization. SIAM Journal on Computing, 17:1253\u20131262, 1988.","journal-title":"SIAM Journal on Computing"},{"key":"11_CR17","series-title":"Lect Notes Comput Sci","first-page":"111","volume-title":"Spelling approximate repeated or common motifs using a suffix tree","author":"M.-F. Sagot","year":"1998","unstructured":"M.-F. Sagot. Spelling approximate repeated or common motifs using a suffix tree. LNCS 1380: 111\u2013127, 1998."},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1038\/41483","volume":"388","author":"J. F. Tomb","year":"1997","unstructured":"J. F. Tomb et al. The complete genome sequence of the gastric pathogen Helicobacter pylori. Nature, 388, 539\u2013547, 1997.","journal-title":"Nature"},{"key":"11_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/BFb0029808","volume-title":"Approximate string matching over suffix trees","author":"E. Ukkonen","year":"1993","unstructured":"E. Ukkonen. Approximate string matching over suffix trees. LNCS 684: 228\u2013242, 1993."},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jmbi.2000.3576","volume":"297","author":"A. Vanet","year":"2000","unstructured":"A. Vanet, L. Marsan, A. Labigne and M.-F. Sagot. Inferring regulatory elements from a whole genome. an analysis of Helicobacter pylori \u03c3 80 family of promoter signals. J. Mol. Biol., 297, 335\u2013353, 2000.","journal-title":"J. Mol. Biol."}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45784-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T16:24:00Z","timestamp":1556900640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45784-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442110","9783540457848"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45784-4_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}