{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T02:04:12Z","timestamp":1648519452876},"reference-count":35,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,6,1]],"date-time":"2015-06-01T00:00:00Z","timestamp":1433116800000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Discrete Algorithms"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1016\/j.jda.2010.08.005","type":"journal-article","created":{"date-parts":[[2010,11,7]],"date-time":"2010-11-07T04:08:12Z","timestamp":1289102892000},"page":"153-165","source":"Crossref","is-referenced-by-count":0,"title":["Missing pattern discovery"],"prefix":"10.1016","volume":"9","author":[{"given":"Stanislav","family":"Angelov","sequence":"first","affiliation":[]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[]},{"given":"Teemu","family":"Kivioja","sequence":"additional","affiliation":[]},{"given":"Veli","family":"M\u00e4kinen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.jda.2010.08.005_br0010","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1006\/jagm.1996.0850","article-title":"Inverse pattern matching","volume":"24","author":"Amir","year":"1997","journal-title":"Journal of Algorithms"},{"issue":"3","key":"10.1016\/j.jda.2010.08.005_br0020","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/PL00009260","article-title":"Suffix trees on words","volume":"23","author":"Andersson","year":"1999","journal-title":"Algorithmica"},{"key":"10.1016\/j.jda.2010.08.005_br0030","series-title":"Proceedings of the 12th International Symposium on String Processing and Information Retrieval (SPIRE 2005)","first-page":"167","article-title":"Composite pattern discovery for pcr application","volume":"vol. 3772","author":"Angelov","year":"2005"},{"key":"10.1016\/j.jda.2010.08.005_br0040","series-title":"Proceedings of the NATO Advanced Study Institute on Artificial Intelligence and Heuristic Methods in Bioinformatics","first-page":"111","article-title":"Pattern discovery and the algorithmics of surprise","volume":"vol. 183","author":"Apostolico","year":"2003"},{"key":"10.1016\/j.jda.2010.08.005_br0050","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF03037568","article-title":"Efficient discovery of optimal word-association patterns in large text databases","volume":"18","author":"Arimura","year":"2000","journal-title":"New Generation Computing"},{"key":"10.1016\/j.jda.2010.08.005_br0060","series-title":"Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching (CPM 2001)","first-page":"152","article-title":"Efficient discovery of proximity patterns with suffix arrays (extended abstract)","volume":"vol. 2089","author":"Arimura","year":"2001"},{"issue":"2","key":"10.1016\/j.jda.2010.08.005_br0070","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0304-3975(91)90358-9","article-title":"Searching subsequences (note)","volume":"78","author":"Baeza-Yates","year":"1991","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"10.1016\/j.jda.2010.08.005_br0080","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1109\/TCBB.2004.36","article-title":"An O(N2) algorithm for discovering optimal Boolean pattern pairs","volume":"1","author":"Bannai","year":"2004","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"issue":"2","key":"10.1016\/j.jda.2010.08.005_br0090","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1142\/S0219720004000612","article-title":"Efficiently finding regulatory elements using correlation with gene expression","volume":"2","author":"Bannai","year":"2004","journal-title":"Journal of Bioinformatics and Computational Biology"},{"issue":"11","key":"10.1016\/j.jda.2010.08.005_br0100","doi-asserted-by":"crossref","first-page":"3746","DOI":"10.1073\/pnas.83.11.3746","article-title":"Predicting DNA duplex stability from the base sequence","volume":"83","author":"Breslauer","year":"1986","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"10.1016\/j.jda.2010.08.005_br0110","series-title":"Proceedings of the 3rd Asia Pacific Bioinformatics Conference (APBC 2005)","first-page":"273","article-title":"A highly scalable algorithm for the extraction of cis-regulatory regions","author":"Carvalho","year":"2005"},{"key":"10.1016\/j.jda.2010.08.005_br0120","doi-asserted-by":"crossref","first-page":"S354","DOI":"10.1093\/bioinformatics\/18.suppl_1.S354","article-title":"Finding composite regulatory patterns in DNA sequences","volume":"18","author":"Eskin","year":"2002","journal-title":"Bioinformatics"},{"key":"10.1016\/j.jda.2010.08.005_br0130","series-title":"Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS 1997)","first-page":"137","article-title":"Optimal suffix tree construction with large alphabets","author":"Farach","year":"1997"},{"key":"10.1016\/j.jda.2010.08.005_br0140","doi-asserted-by":"crossref","unstructured":"L. Ga\u0327sieniec, P. Indyk, P. Krysta, External inverse pattern matching, in: Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching (CPM 1997), 1997, pp. 90\u2013101.","DOI":"10.1007\/3-540-63220-4_53"},{"key":"10.1016\/j.jda.2010.08.005_br0150","series-title":"Algorithms on Strings, Trees, and Sequences","author":"Gusfield","year":"1997"},{"key":"10.1016\/j.jda.2010.08.005_br0160","doi-asserted-by":"crossref","unstructured":"G. Hampikian, T. Andersen, Absent sequences: nullomers and primes, in: Proceedings of the Pacific Symposium on Biocomputing 2007, 2007, pp. 355\u2013366.","DOI":"10.1142\/9789812772435_0034"},{"key":"10.1016\/j.jda.2010.08.005_br0170","series-title":"Proceedings of the 3rd International Conference on Discovery Science (DS 2000)","first-page":"141","article-title":"A practical algorithm to find the best subsequence patterns","volume":"vol. 1967","author":"Hirao","year":"2000"},{"key":"10.1016\/j.jda.2010.08.005_br0180","series-title":"Proceedings of the 4th International Conference on Discovery Science (DS 2001)","first-page":"435","article-title":"A practical algorithm to find the best episode patterns","volume":"vol. 2226","author":"Hirao","year":"2001"},{"key":"10.1016\/j.jda.2010.08.005_br0190","series-title":"Proceedings of the 7th International Conference on Discovery Science (DS 2004)","first-page":"32","article-title":"Finding optimal pairs of cooperative and competing patterns with bounded distance","volume":"vol. 3245","author":"Inenaga","year":"2004"},{"key":"10.1016\/j.jda.2010.08.005_br0200","series-title":"Proceedings of the 5th International Conference on Discovery Science (DS 2002)","first-page":"86","article-title":"Discovering best variable-length-don\u02bct-care patterns","volume":"vol. 2534","author":"Inenaga","year":"2002"},{"key":"10.1016\/j.jda.2010.08.005_br0210","series-title":"Proceedings of the 4th Workshop on Algorithms in Bioinformatics (WABI 2004)","first-page":"463","article-title":"Finding missing patterns","volume":"vol. 3240","author":"Inenaga","year":"2004"},{"key":"10.1016\/j.jda.2010.08.005_br0220","series-title":"Proceedings of the 2nd Annual International Computing and Combinatorics Conference (COCOON 1996)","first-page":"219","article-title":"Sparse suffix trees","volume":"vol. 1090","author":"K\u00e4rkk\u00e4inen","year":"1996"},{"key":"10.1016\/j.jda.2010.08.005_br0230","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1147\/rd.312.0249","article-title":"Efficient randomized pattern-matching algorithms","volume":"31","author":"Karp","year":"1987","journal-title":"IBM Journal of Research and Development"},{"issue":"1","key":"10.1016\/j.jda.2010.08.005_br0240","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","article-title":"Distinguishing string selection problems","volume":"185","author":"Lanctot","year":"2003","journal-title":"Information and Computation"},{"key":"10.1016\/j.jda.2010.08.005_br0250","unstructured":"S.C. Li, Faster algorithms for finding missing patterns, in: Proceedings of the 12th Computing: The Australasian Theory Symposium (CATS 2006), 2006, pp. 107\u2013111."},{"key":"10.1016\/j.jda.2010.08.005_br0260","doi-asserted-by":"crossref","unstructured":"X. Liu, D. Brutlag, J. Liu, BioProspector, discovering conserved DNA motifs in upstream regulatory regions of co-expressed genes, in: Proceedings of the Pacific Symposium on Biocomputing 2001, 2001, pp. 127\u2013138.","DOI":"10.1142\/9789814447362_0014"},{"key":"10.1016\/j.jda.2010.08.005_br0270","series-title":"Proceedings of the 1st International Conference on Knowledge Discovery and Data Mining (KDD 1995)","first-page":"210","article-title":"Discovering frequent episodes in sequences","author":"Mannila","year":"1995"},{"key":"10.1016\/j.jda.2010.08.005_br0280","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1089\/106652700750050826","article-title":"Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification","volume":"7","author":"Marsan","year":"2000","journal-title":"Journal of Computational Biology"},{"issue":"14","key":"10.1016\/j.jda.2010.08.005_br0290","doi-asserted-by":"crossref","first-page":"4211","DOI":"10.1093\/nar\/gkg476","article-title":"Thermodynamic calculations and statistical correlations for oligo-probes design","volume":"31","author":"Matveeva","year":"2003","journal-title":"Nucleic Acids Research"},{"key":"10.1016\/j.jda.2010.08.005_br0300","series-title":"Pattern Discovery in Bioinformatics: Theory and Algorithms","author":"Parida","year":"2007"},{"issue":"10","key":"10.1016\/j.jda.2010.08.005_br0310","first-page":"2009","article-title":"Knowledge acquisition from amino acid sequences by machine learning system BONSAI","volume":"35","author":"Shimozono","year":"1994","journal-title":"Transactions of Information Processing Society of Japan"},{"key":"10.1016\/j.jda.2010.08.005_br0320","series-title":"Progress in Discovery Science","first-page":"307","article-title":"Finding best patterns practically","volume":"vol. 2281","author":"Shinohara","year":"2002"},{"key":"10.1016\/j.jda.2010.08.005_br0330","series-title":"Proceedings of the 6th International Conference on Discovery Science (DS 2003)","first-page":"486","article-title":"Discovering most classificatory patterns for very expressive pattern classes","volume":"vol. 2843","author":"Takeda","year":"2003"},{"key":"10.1016\/j.jda.2010.08.005_br0340","series-title":"Pattern Discovery in Biomolecular Data","author":"Wang","year":"1999"},{"key":"10.1016\/j.jda.2010.08.005_br0350","doi-asserted-by":"crossref","unstructured":"P. Weiner, Linear pattern matching algorithms, in: Proceedings of the IEEE 14th Annual Symposium on Switching and Automata Theory, 1973, pp. 1\u201311.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Journal of Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866710000523?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866710000523?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T23:40:33Z","timestamp":1559778033000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570866710000523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["S1570866710000523"],"URL":"https:\/\/doi.org\/10.1016\/j.jda.2010.08.005","relation":{},"ISSN":["1570-8667"],"issn-type":[{"value":"1570-8667","type":"print"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}