DE eng

Search in the Catalogues and Directories

Hits 1 – 10 of 10

1
Tight Upper and Lower Bounds on Suffix Tree Breadth
In: Accepted Version (2021)
BASE
Show details
2
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time ...
BASE
Show details
3
Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet ...
Kärkkäinen, Juha; Kempa, Dominik. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2017
BASE
Show details
4
String Inference from Longest-Common-Prefix Array ...
Kärkkäinen, Juha; Piatkowski, Marcin; Puglisi, Simon J.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2017
BASE
Show details
5
Faster External Memory LCP Array Construction ...
Kärkkäinen, Juha; Kempa, Dominik. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2016
BASE
Show details
6
Linear-time string indexing and analysis in small space ...
BASE
Show details
7
String Inference from the LCP Array ...
BASE
Show details
8
Computing the Burrows–Wheeler transform in place and in small space
In: ISSN: 1570-8667 ; Journal of Discrete Algorithms ; https://hal.inria.fr/hal-01248855 ; Journal of Discrete Algorithms, Elsevier, 2015, 32, pp.44-52. ⟨10.1016/j.jda.2015.01.004⟩ (2015)
BASE
Show details
9
Faster Sparse Suffix Sorting ...
I, Tomohiro; Kärkkäinen, Juha; Kempa, Dominik. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2014
BASE
Show details
10
Better External Memory Suffix Array Construction
BASE
Show details

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
10
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern