×

Found 9 Documents (Results 1–9)

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
Full Text: arXiv

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
Full Text: DOI

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
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Main Field

Software