{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T10:59:12Z","timestamp":1780743552893,"version":"3.54.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T00:00:00Z","timestamp":1417392000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1186\/s12859-014-0388-9","type":"journal-article","created":{"date-parts":[[2014,12,19]],"date-time":"2014-12-19T12:22:03Z","timestamp":1418991723000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Linear-time computation of minimal absent words using suffix array"],"prefix":"10.1186","volume":"15","author":[{"given":"Carl","family":"Barton","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alice","family":"Heliou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laurent","family":"Mouchard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Solon P","family":"Pissis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,12,20]]},"reference":[{"key":"388_CR1","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: Genome comparison without alignment using shortest unique substrings. BMC Bioinformatics. 2005, 6: 123-10.1186\/1471-2105-6-123.","journal-title":"BMC Bioinformatics"},{"issue":"24","key":"388_CR2","doi-asserted-by":"publisher","first-page":"3221","DOI":"10.1093\/bioinformatics\/btp590","volume":"25","author":"M Domazet-Lo\u0161o","year":"2009","unstructured":"Domazet-Lo\u0161o M, Haubold B: Efficient estimation of pairwise distances between genomes. Bioinformatics. 2009, 25 (24): 3221-3227. 10.1093\/bioinformatics\/btp590.","journal-title":"Bioinformatics"},{"key":"388_CR3","first-page":"355","volume-title":"Pacific Symposium on Biocomputing","author":"G Hampikian","year":"2007","unstructured":"Hampikian G, Andersen T: Absent sequences: nullomers and primes. Pacific Symposium on Biocomputing . Edited by: Altman RB, Dunker AK, Hunter L, Murray T, Klein TE. 2007, World Scientific, Maui, Hawaii, USA, 355-366."},{"key":"388_CR4","doi-asserted-by":"publisher","first-page":"1","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 Bioinformatics. 2008, 9: 1-9. 10.1186\/1471-2105-9-167.","journal-title":"BMC Bioinformatics"},{"issue":"14-15","key":"388_CR5","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. Inform Process Lett. 2010, 110 (14-15): 596-601. 10.1016\/j.ipl.2010.05.008.","journal-title":"Inform Process Lett"},{"key":"388_CR6","doi-asserted-by":"crossref","unstructured":"Pinho AJ, Ferreira PJSG, Garcia SP: On finding minimal absent words. BMC Bioinformatics200911. [http:\/\/dx.doi.org\/10.1186\/1471-2105-10-137]","DOI":"10.1186\/1471-2105-10-137"},{"key":"388_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0020-0190(98)00104-5","volume":"67","author":"M Crochemore","year":"1998","unstructured":"Crochemore M, Mignosi F, Restivo A: Automata and forbidden words. Inform Process Lett. 1998, 67: 111-117. 10.1016\/S0020-0190(98)00104-5.","journal-title":"Inform Process Lett"},{"issue":"1\u20132","key":"388_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(00)00436-9","volume":"273","author":"F Mignosi","year":"2002","unstructured":"Mignosi F, Restivo A, Sciortino M: Words and forbidden factors. Theor Comput Sci. 2002, 273 (1\u20132): 99-117. 10.1016\/S0304-3975(00)00436-9.","journal-title":"Theor Comput Sci"},{"key":"388_CR9","unstructured":"Fici G: Minimal forbidden words and applications. PhD thesis. Universit\u00e9 de Marne-la-Vall\u00e9e; 2006."},{"issue":"10","key":"388_CR10","doi-asserted-by":"publisher","first-page":"e1022","DOI":"10.1371\/journal.pone.0001022","volume":"2","author":"C Acquisti","year":"2007","unstructured":"Acquisti C, Poste G, Curtiss D, Kumar S: Nullomers: really a matter of natural selection?. PLoS ONE. 2007, 2 (10): e1022-10.1371\/journal.pone.0001022.","journal-title":"PLoS ONE"},{"issue":"1","key":"388_CR11","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 JM, Bastos CA, Ferreira PJ: Minimal absent words in prokaryotic and eukaryotic genomes. PLoS ONE. 2011, 6 (1): e16065-10.1371\/journal.pone.0016065.","journal-title":"PLoS ONE"},{"issue":"12","key":"388_CR12","doi-asserted-by":"publisher","first-page":"e29344","DOI":"10.1371\/journal.pone.0029344","volume":"6","author":"SP Garcia","year":"2011","unstructured":"Garcia SP, Pinho AJ: Minimal absent words in four human genome assemblies. PLoS ONE. 2011, 6 (12): e29344-10.1371\/journal.pone.0029344.","journal-title":"PLoS ONE"},{"issue":"0","key":"388_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.tcs.2012.04.031","volume":"450","author":"S Chairungsee","year":"2012","unstructured":"Chairungsee S, Crochemore M: Using minimal absent words to build phylogeny. Theor Comput Sci. 2012, 450 (0): 109-116. 10.1016\/j.tcs.2012.04.031.","journal-title":"Theor Comput Sci"},{"key":"388_CR14","first-page":"133","volume-title":"ESA, Volume 8125 of Lecture Notes in Computer Science","author":"D Belazzougui","year":"2013","unstructured":"Belazzougui D, Cunial F, K\u00e4rkk\u00e4inen J, M\u00e4kinen V: Versatile succinct representations of the bidirectional burrows-wheeler transform. ESA, Volume 8125 of Lecture Notes in Computer Science . Edited by: Bodlaender HL, Italiano GF. 2013, Springer, Sophia Antipolis, France, 133-144."},{"issue":"5","key":"388_CR15","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber U, Myers EW: Suffix arrays: a new method for on-line string searches. SIAM J Comput. 1993, 22 (5): 935-948. 10.1137\/0222058.","journal-title":"SIAM J Comput"},{"key":"388_CR16","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/DCC.2009.42","volume-title":"Proceedings of the 2009 Data Compression Conference, DCC \u201909","author":"G Nong","year":"2009","unstructured":"Nong G, Zhang S, Chan WH: Linear suffix array construction by almost pure induced-sorting. Proceedings of the 2009 Data Compression Conference, DCC \u201909 . 2009, IEEE Computer Society, Washington, DC, USA, 193-202."},{"key":"388_CR17","first-page":"374","volume-title":"Algorithms and Data Structures - 12th International Symposium, Volume 6844 of Lecture Notes in Computer Science","author":"J Fischer","year":"2011","unstructured":"Fischer J: Inducing the LCP-Array. Algorithms and Data Structures - 12th International Symposium, Volume 6844 of Lecture Notes in Computer Science . Edited by: Dehne F, Iacono J, Sack JR. 2011, Springer, New York, NY, USA, 374-385."}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s12859-014-0388-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-014-0388-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-014-0388-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-014-0388-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,2]],"date-time":"2021-09-02T07:11:18Z","timestamp":1630566678000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-014-0388-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["388"],"URL":"https:\/\/doi.org\/10.1186\/s12859-014-0388-9","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12]]},"assertion":[{"value":"27 June 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2014","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2014","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"388"}}