{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T19:57:06Z","timestamp":1759694226765},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,2,23]],"date-time":"2016-02-23T00:00:00Z","timestamp":1456185600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,2,23]],"date-time":"2016-02-23T00:00:00Z","timestamp":1456185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"research center of ccis at king saud university"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cogn Comput"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s12559-016-9385-9","type":"journal-article","created":{"date-parts":[[2016,2,23]],"date-time":"2016-02-23T10:32:16Z","timestamp":1456223536000},"page":"603-613","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Identifying Minimal Absent and Unique Words: An Efficient Scheme"],"prefix":"10.1007","volume":"8","author":[{"given":"Aqil M.","family":"Azmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,23]]},"reference":[{"key":"9385_CR1","first-page":"207","volume-title":"Scientific data mining and knowledge discovery","author":"MI Abouelhoda","year":"2010","unstructured":"Abouelhoda MI, Ghanem M. String mining in bioinformatics. In: Gaber MM, editor. Scientific data mining and knowledge discovery. Berlin: Springer; 2010. p. 207\u201347."},{"issue":"1","key":"9385_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"MI Abouelhoda","year":"2004","unstructured":"Abouelhoda MI, Kurtz S, Ohlebusch E. Replacing suffix trees with enhanced suffix arrays. J Discret Algorithms. 2004;2(1):53\u201386.","journal-title":"J Discret Algorithms"},{"issue":"3","key":"9385_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.patrec.2014.12.009","volume":"54","author":"AM Azmi","year":"2015","unstructured":"Azmi AM, Al-Ssulami AM. Discovering common recurrent patterns in multiple strings over large alphabets. Pattern Recognit Lett. 2015;54(3):75\u201381.","journal-title":"Pattern Recognit Lett"},{"key":"9385_CR4","doi-asserted-by":"crossref","unstructured":"B\u00e9al MP, Mignosi F, Restivo A. Minimal forbidden words and symbolic dynamics. In: STACS 96 (Grenoble, 1996), Springer, Berlin, lecture notes in computer science; 1996. vol 1046, p. 555\u201366.","DOI":"10.1007\/3-540-60922-9_45"},{"key":"9385_CR5","doi-asserted-by":"crossref","unstructured":"Chairungsee S, Crochemore M. Building phylogeny with minimal absent words. In: Bouchou-Markhoff B, Caron P, Champarnaud JM, Maurel D, editors. Implementation and application of automata, vol. 6807., lecture notes in computer science. Berlin Heidelberg: Springer-Verlag; 2011. p. 100\u20139.","DOI":"10.1007\/978-3-642-22256-6_10"},{"key":"9385_CR6","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C. Introduction to algorithms. 2nd ed. Cambridge: The MIT Press; 2001.","edition":"2"},{"issue":"7","key":"9385_CR7","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1101\/gr.2289704","volume":"14","author":"A Darling","year":"2004","unstructured":"Darling A, Mau BF, Blattner N, Perna. Mauve: multiple alignment of conserved genomic sequence with rearrangements. Genome Res. 2004;14(7):394\u2013403.","journal-title":"Genome Res"},{"issue":"1","key":"9385_CR8","doi-asserted-by":"publisher","first-page":"e16065","DOI":"10.1371\/journal.pone.0016065","volume":"6","author":"SP Garcia","year":"2011","unstructured":"Garcia SP, Pinho AJ, Rodrigues JMOS, Bastos CAC, Ferreira PJSG. Minimal absent words in prokaryotic and eukaryotic genomes. PLoS One. 2011;6(1):e16065.","journal-title":"PLoS One"},{"key":"9385_CR9","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: Cambridge University Press; 1997."},{"key":"9385_CR10","first-page":"355","volume":"12","author":"G Hampikian","year":"2000","unstructured":"Hampikian G, Andersen T. Absent sequences: nullomers and primes. Pac Symp Biocomput. 2000;12:355\u201366.","journal-title":"Pac Symp Biocomput"},{"key":"9385_CR11","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1186\/1471-2105-6-123","volume":"6","author":"B Haubold","year":"2005","unstructured":"Haubold B, Pierstorff N, M\u00f6ller F, Wiehe T\n. Genome comparison without alignment using shortest unique substrings. BMC Bioinform. 2005;6:123. doi:10.1186\/1471-2105-6-123.","journal-title":"BMC Bioinform"},{"key":"9385_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1186\/1471-2105-9-167","volume":"9","author":"J Herold","year":"2008","unstructured":"Herold J, Kurtz S, Giegerich R. Efficient computation of absent words in genomic sequences. BMC Bioinform. 2008;9:167. doi:10.1186\/1471-2105-9-167.","journal-title":"BMC Bioinform"},{"key":"9385_CR13","doi-asserted-by":"crossref","unstructured":"Hu X, Pei J, Tai Y. Shortest unique queries on strings. In: Proceedings of the 21st International symposium on string processing and information retrieval (SPIRE 2014); 2014. vol 8799, p. 161\u201372.","DOI":"10.1007\/978-3-319-11918-2_16"},{"key":"9385_CR14","doi-asserted-by":"publisher","unstructured":"Malyshev DA, Dhami K, Lavergne T, Chen T, Dai N, Foster JM, Correa IR, Romesberg FE. A semi-synthetic organism with an expanded genetic alphabet. Nature. 2014. doi:10.1038\/nature13314.","DOI":"10.1038\/nature13314"},{"issue":"2","key":"9385_CR15","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"EM McCreight","year":"1976","unstructured":"McCreight EM. A space-economical suffix tree construction algorithm\n. J ACM. 1976;23(2):262\u201372.","journal-title":"J ACM"},{"key":"9385_CR16","doi-asserted-by":"publisher","unstructured":"Pinho AJ, Ferreira PJSG, Garcia SP. On finding minimal absent words. BMC Bioinform. 2009;10(137): doi:10.1186\/1471-2105-10-137.","DOI":"10.1186\/1471-2105-10-137"},{"issue":"6184","key":"9385_CR17","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1126\/science.344.6184.571","volume":"344","author":"RF Service","year":"2014","unstructured":"Service RF. Designer microbes expand life\u2019s genetic alphabet. Science. 2014;344(6184):571. doi:10.1126\/science.344.6184.571.","journal-title":"Science"},{"issue":"3","key":"9385_CR18","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E Ukkonen","year":"1995","unstructured":"Ukkonen E. On-line construction of suffix trees. Algorithmica. 1995;14(3):249\u201360.","journal-title":"Algorithmica"},{"issue":"14\u201315","key":"9385_CR19","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1016\/j.ipl.2010.05.008","volume":"110","author":"ZD Wu","year":"2010","unstructured":"Wu ZD, Jiang T, Su WJ. Efficient computation of shortest absent words in a genomic sequence. Inf Process Lett. 2010;110(14\u201315):596\u2013601.","journal-title":"Inf Process Lett"}],"container-title":["Cognitive Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12559-016-9385-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12559-016-9385-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12559-016-9385-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12559-016-9385-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T18:25:28Z","timestamp":1684866328000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12559-016-9385-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,23]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9385"],"URL":"https:\/\/doi.org\/10.1007\/s12559-016-9385-9","relation":{},"ISSN":["1866-9956","1866-9964"],"issn-type":[{"value":"1866-9956","type":"print"},{"value":"1866-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,23]]},"assertion":[{"value":"23 February 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"Aqil M. Azmi declare that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"All procedures followed were in accordance with the ethical standards of the responsible committee on human  experimentation (institutional and national) and with the Helsinki Declaration of 1975, as revised in 2008 (5). Additional informed consent was obtained from all patients for which identifying information is included in this article.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed Consent"}},{"value":"This article does not contain any studies with human or animal subjects performed by the any of the authors.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and Animal Rights"}}]}}