by Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis and Dimitris Polychronopoulos
Reference:
Y. Almirantis, P. Charalampopoulos, J. Gao, C. S. Iliopoulos, M. Mohamed, S. P. Pissis, D. Polychronopoulos, "Optimal Computation of Overabundant Words", in 17th International Workshop on Algorithms in Bioinformatics (WABI 2017), R. Schwartz, K. Reinert, Eds., Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, pp. 4:1–4:14.
Bibtex Entry:
@InProceedings{almirantis_et_al:LIPIcs:2017:7646,
author = {Yannis Almirantis and Panagiotis Charalampopoulos and Jia Gao and Costas S. Iliopoulos and Manal Mohamed and Solon P. Pissis and Dimitris Polychronopoulos},
title = {{Optimal Computation of Overabundant Words}},
booktitle = {17th International Workshop on Algorithms in Bioinformatics (WABI 2017)},
pages = {4:1--4:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-050-7},
ISSN = {1868-8969},
year = {2017},
volume = {88},
editor = {Russell Schwartz and Knut Reinert},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7646},
URN = {urn:nbn:de:0030-drops-76468},
doi = {10.4230/LIPIcs.WABI.2017.4},
annote = {Keywords: overabundant words, avoided words, suffix tree, DNA sequence analysis}
}