1 |
On the Complexity of BWT-Runs Minimization via Alphabet Reordering ...
|
|
|
|
BASE
|
|
Show details
|
|
2 |
Fully-Functional Bidirectional Burrows-Wheeler Indexes and Infinite-Order De Bruijn Graphs
|
|
Belazzougui, Djamal; Cunial, Fabio. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. : LIPIcs - Leibniz International Proceedings in Informatics. 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 2019
|
|
BASE
|
|
Show details
|
|
3 |
Full Compressed Affix Tree Representations
|
|
|
|
In: IEEE Data Compression Conference ; DCC: Data Compression Conference ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-02093302 ; DCC: Data Compression Conference, IEEE, Apr 2017, Snowbird, UT, United States. pp.102-111, ⟨10.1109/DCC.2017.39⟩ ; http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7921793 (2017)
|
|
BASE
|
|
Show details
|
|
7 |
Sorting Suffixes of a Text via its Lyndon Factorization
|
|
|
|
In: http://www.stringology.org/cgi-bin/getfile.cgi?c%3D-%26n%3D11%26t%3Dpdf%26y%3D2013
|
|
BASE
|
|
Show details
|
|
|
|