Jacquet, Philippe; Szpankowski, Wojciech Average size of a suffix tree for Markov sources. (English) Zbl 1411.68038 Neininger, Ralph (ed.) et al., Proceedings of the 27th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms – AofA’16, Kraków, Poland, July 4–8, 2016. Kraków: Jagiellonian University, Department of Theoretical Computer Science. 13 p. (2016). MSC: 68P05 68R15 PDFBibTeX XMLCite \textit{P. Jacquet} and \textit{W. Szpankowski}, in: Proceedings of the 27th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms -- AofA'16, Kraków, Poland, July 4--8, 2016. Kraków: Jagiellonian University, Department of Theoretical Computer Science. 13 p. (2016; Zbl 1411.68038) Full Text: arXiv
Christiansen, Anders Roy; Farach-Colton, Martín Parallel lookups in string indexes. (English) Zbl 1397.68237 Inenaga, Shunsuke (ed.) et al., String processing and information retrieval. 23rd international symposium, SPIRE 2016, Beppu, Japan, October 18–20, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-46048-2/pbk; 978-3-319-46049-9/ebook). Lecture Notes in Computer Science 9954, 61-67 (2016). MSC: 68W32 68P05 68W10 PDFBibTeX XMLCite \textit{A. R. Christiansen} and \textit{M. Farach-Colton}, Lect. Notes Comput. Sci. 9954, 61--67 (2016; Zbl 1397.68237) Full Text: DOI
Fujishige, Yuta; Tsujimaru, Yuki; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki Computing DAWGs and minimal absent words in linear time for integer alphabets. (English) Zbl 1398.68703 Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 38, 14 p. (2016). MSC: 68W32 68Q25 PDFBibTeX XMLCite \textit{Y. Fujishige} et al., LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 38, 14 p. (2016; Zbl 1398.68703) Full Text: DOI
Takagi, Takuya; Inenaga, Shunsuke; Arimura, Hiroki Fully-online construction of suffix trees for multiple texts. (English) Zbl 1380.68159 Grossi, Roberto (ed.) et al., 27th annual symposium on combinatorial pattern matching, CPM 2016, Tel Aviv, Israel, June 27–29, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-012-5). LIPIcs – Leibniz International Proceedings in Informatics 54, Article 22, 13 p. (2016). MSC: 68P05 68U15 68W27 68W32 PDFBibTeX XMLCite \textit{T. Takagi} et al., LIPIcs -- Leibniz Int. Proc. Inform. 54, Article 22, 13 p. (2016; Zbl 1380.68159) Full Text: DOI
Navarro, Gonzalo; Ordóñez Pereira, Alberto Faster compressed suffix trees for repetitive collections. (English) Zbl 1365.68184 ACM J. Exp. Algorithm. 21, Article No. 1.8, 38 p. (2016). MSC: 68P05 68P30 PDFBibTeX XMLCite \textit{G. Navarro} and \textit{A. Ordóñez Pereira}, ACM J. Exp. Algorithm. 21, Article No. 1.8, 38 p. (2016; Zbl 1365.68184) Full Text: DOI Link
Vásárhelyi, Bálint An estimation of the size of non-compact suffix trees. (English) Zbl 1374.68132 Acta Cybern. 22, No. 4, 823-832 (2016). MSC: 68P05 PDFBibTeX XMLCite \textit{B. Vásárhelyi}, Acta Cybern. 22, No. 4, 823--832 (2016; Zbl 1374.68132) Full Text: DOI arXiv
Badkobeh, Golnaz; Bannai, Hideo; Goto, Keisuke; I, Tomohiro; Iliopoulos, Costas S.; Inenaga, Shunsuke; Puglisi, Simon J.; Sugimoto, Shiho Closed factorization. (English) Zbl 1350.68299 Discrete Appl. Math. 212, 23-29 (2016). MSC: 68W32 68R15 PDFBibTeX XMLCite \textit{G. Badkobeh} et al., Discrete Appl. Math. 212, 23--29 (2016; Zbl 1350.68299) Full Text: DOI
Navarro, Gonzalo; Thankachan, Sharma V. Reporting consecutive substring occurrences under bounded gap constraints. (English) Zbl 1344.68061 Theor. Comput. Sci. 638, 108-111 (2016). MSC: 68P05 68P20 68W32 PDFBibTeX XMLCite \textit{G. Navarro} and \textit{S. V. Thankachan}, Theor. Comput. Sci. 638, 108--111 (2016; Zbl 1344.68061) Full Text: DOI
Bille, Philip; Gawrychowski, Paweł; Gørtz, Inge Li; Landau, Gad M.; Weimann, Oren Longest common extensions in trees. (English) Zbl 1345.68115 Theor. Comput. Sci. 638, 98-107 (2016). MSC: 68P05 68P15 68Q25 PDFBibTeX XMLCite \textit{P. Bille} et al., Theor. Comput. Sci. 638, 98--107 (2016; Zbl 1345.68115) Full Text: DOI