TY - JOUR AU - Haubold, B. AU - Pierstorff, N. AU - Möller, F. AU - Wiehe, T. PY - 2005 DA - 2005// TI - Genome comparison without alignment using shortest unique substrings JO - BMC Bioinformatics VL - 6 UR - https://doi.org/10.1186/1471-2105-6-123 DO - 10.1186/1471-2105-6-123 ID - Haubold2005 ER - TY - JOUR AU - Domazet-Lošo, M. AU - Haubold, B. PY - 2009 DA - 2009// TI - Efficient estimation of pairwise distances between genomes JO - Bioinformatics VL - 25 UR - https://doi.org/10.1093/bioinformatics/btp590 DO - 10.1093/bioinformatics/btp590 ID - Domazet-Lošo2009 ER - TY - CHAP AU - Hampikian, G. AU - Andersen, T. ED - Altman, R. B. ED - Dunker, A. K. ED - Hunter, L. ED - Murray, T. ED - Klein, T. E. PY - 2007 DA - 2007// TI - Absent sequences: nullomers and primes BT - Pacific Symposium on Biocomputing PB - World Scientific, Maui CY - Hawaii, USA ID - Hampikian2007 ER - TY - JOUR AU - Herold, J. AU - Kurtz, S. AU - Giegerich, R. PY - 2008 DA - 2008// TI - Efficient computation of absent words in genomic sequences JO - BMC Bioinformatics VL - 9 UR - https://doi.org/10.1186/1471-2105-9-167 DO - 10.1186/1471-2105-9-167 ID - Herold2008 ER - TY - JOUR AU - Wu, Z. D. AU - Jiang, T. AU - Su, W. J. PY - 2010 DA - 2010// TI - Efficient computation of shortest absent words in a genomic sequence JO - Inform Process Lett VL - 110 UR - https://doi.org/10.1016/j.ipl.2010.05.008 DO - 10.1016/j.ipl.2010.05.008 ID - Wu2010 ER - TY - STD TI - Pinho AJ, Ferreira PJSG, Garcia SP: On finding minimal absent words. BMC Bioinformatics200911. [http://dx.doi.org/10.1186/1471-2105-10-137] UR - http://dx.doi.org/10.1186/1471-2105-10-137 ID - ref6 ER - TY - JOUR AU - Crochemore, M. AU - Mignosi, F. AU - Restivo, A. PY - 1998 DA - 1998// TI - Automata and forbidden words JO - Inform Process Lett VL - 67 UR - https://doi.org/10.1016/S0020-0190(98)00104-5 DO - 10.1016/S0020-0190(98)00104-5 ID - Crochemore1998 ER - TY - JOUR AU - Mignosi, F. AU - Restivo, A. AU - Sciortino, M. PY - 2002 DA - 2002// TI - Words and forbidden factors JO - Theor Comput Sci VL - 273 UR - https://doi.org/10.1016/S0304-3975(00)00436-9 DO - 10.1016/S0304-3975(00)00436-9 ID - Mignosi2002 ER - TY - STD TI - Fici G: Minimal forbidden words and applications. PhD thesis. Université de Marne-la-Vallée; 2006. ID - ref9 ER - TY - JOUR AU - Acquisti, C. AU - Poste, G. AU - Curtiss, D. AU - Kumar, S. PY - 2007 DA - 2007// TI - Nullomers: really a matter of natural selection? JO - PLoS ONE VL - 2 UR - https://doi.org/10.1371/journal.pone.0001022 DO - 10.1371/journal.pone.0001022 ID - Acquisti2007 ER - TY - JOUR AU - Garcia, S. P. AU - Pinho, A. J. AU - Rodrigues, J. M. AU - Bastos, C. A. AU - Ferreira, P. J. PY - 2011 DA - 2011// TI - Minimal absent words in prokaryotic and eukaryotic genomes JO - PLoS ONE VL - 6 UR - https://doi.org/10.1371/journal.pone.0016065 DO - 10.1371/journal.pone.0016065 ID - Garcia2011 ER - TY - JOUR AU - Garcia, S. P. AU - Pinho, A. J. PY - 2011 DA - 2011// TI - Minimal absent words in four human genome assemblies JO - PLoS ONE VL - 6 UR - https://doi.org/10.1371/journal.pone.0029344 DO - 10.1371/journal.pone.0029344 ID - Garcia2011 ER - TY - JOUR AU - Chairungsee, S. AU - Crochemore, M. PY - 2012 DA - 2012// TI - Using minimal absent words to build phylogeny JO - Theor Comput Sci VL - 450 UR - https://doi.org/10.1016/j.tcs.2012.04.031 DO - 10.1016/j.tcs.2012.04.031 ID - Chairungsee2012 ER - TY - CHAP AU - Belazzougui, D. AU - Cunial, F. AU - Kärkkäinen, J. AU - Mäkinen, V. ED - Bodlaender, H. L. ED - Italiano, G. F. PY - 2013 DA - 2013// TI - Versatile succinct representations of the bidirectional burrows-wheeler transform BT - ESA, Volume 8125 of Lecture Notes in Computer Science PB - Springer, Sophia Antipolis CY - France ID - Belazzougui2013 ER - TY - JOUR AU - Manber, U. AU - Myers, E. W. PY - 1993 DA - 1993// TI - Suffix arrays: a new method for on-line string searches JO - SIAM J Comput VL - 22 UR - https://doi.org/10.1137/0222058 DO - 10.1137/0222058 ID - Manber1993 ER - TY - CHAP AU - Nong, G. AU - Zhang, S. AU - Chan, W. H. PY - 2009 DA - 2009// TI - Linear suffix array construction by almost pure induced-sorting BT - Proceedings of the 2009 Data Compression Conference, DCC ’09 PB - IEEE Computer Society CY - Washington, DC, USA UR - https://doi.org/10.1109/DCC.2009.42 DO - 10.1109/DCC.2009.42 ID - Nong2009 ER - TY - CHAP AU - Fischer, J. ED - Dehne, F. ED - Iacono, J. ED - Sack, J. R. PY - 2011 DA - 2011// TI - Inducing the LCP-Array BT - Algorithms and Data Structures - 12th International Symposium, Volume 6844 of Lecture Notes in Computer Science PB - Springer CY - New York, NY, USA ID - Fischer2011 ER -