1 |
On Extensions of Maximal Repeats in Compressed Strings
|
|
Pape-Lange, Julian. - : LIPIcs - Leibniz International Proceedings in Informatics. 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), 2020
|
|
BASE
|
|
Show details
|
|
2 |
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures
|
|
|
|
BASE
|
|
Show details
|
|
4 |
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures ...
|
|
|
|
BASE
|
|
Show details
|
|
5 |
On Maximal Repeats in Compressed Strings
|
|
Pape-Lange, Julian. - : 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
|
|
6 |
Linear-size suffix tries
|
|
|
|
In: ISSN: 1879-2294 ; EISSN: 0304-3975 ; Theoretical Computer Science ; https://hal.inria.fr/hal-01388452 ; Theoretical Computer Science, Elsevier, 2016, 638, pp.171 - 178. ⟨10.1016/j.tcs.2016.04.002⟩ (2016)
|
|
BASE
|
|
Show details
|
|
10 |
From Nerode’s congruence to Suffix Automata with mismatches
|
|
|
|
In: http://hal.inria.fr/docs/00/74/18/71/PDF/From_Nerode_s_congruence_to_Suffix_Automata_with_mismatches.pdf (2009)
|
|
BASE
|
|
Show details
|
|
11 |
From Nerode’s congruence to suffix automata with mismatches
|
|
|
|
BASE
|
|
Show details
|
|
12 |
On the Suffix Automaton with mismatches
|
|
|
|
In: http://www.dcs.kcl.ac.uk/staff/mac/DOC/07-CEGM-ciaa.pdf (2007)
|
|
BASE
|
|
Show details
|
|
13 |
On the suffix automaton with mismatches
|
|
|
|
In: Implementation and Application of Automata ; 12th International Conference on Implementation and Application of Automata (CIAA'07) ; https://hal-upec-upem.archives-ouvertes.fr/hal-00620159 ; 12th International Conference on Implementation and Application of Automata (CIAA'07), 2007, Prague, Czech Republic. pp.144-156, ⟨10.1007/978-3-540-76336-9_15⟩ (2007)
|
|
BASE
|
|
Show details
|
|
15 |
Combinatorial Characterization of the Language Recognized by Factor and Suffix Oracles
|
|
|
|
In: ISSN: 0129-0541 ; International Journal of Foundations of Computer Science ; https://hal.archives-ouvertes.fr/hal-00487228 ; International Journal of Foundations of Computer Science, World Scientific Publishing, 2005, 16 (6), pp.1179-1191. ⟨10.1142/S0129054105003741⟩ (2005)
|
|
BASE
|
|
Show details
|
|
16 |
A Trie-Based Approach for Compacting Automata
|
|
|
|
In: http://www.di.unipi.it/~grossi/PAPERS/cpm04.ps.gz (2004)
|
|
BASE
|
|
Show details
|
|
17 |
Combinatorial Characterization of the Language Recognized by Factor and Suffix Oracles
|
|
|
|
In: http://www.sciences.univ-nantes.fr/lina/bioserv/PagesPersos/mancheron/download/publis/MancheronMoan04.pdf (2004)
|
|
BASE
|
|
Show details
|
|
18 |
Combinatorial Characterization of the Language Recognized by Factor and Suffix Oracles
|
|
|
|
In: http://www.stringology.org/cgi-bin/getfile.cgi?c%3D-%26n%3D12%26t%3Dpdf%26y%3D2004 (2004)
|
|
BASE
|
|
Show details
|
|
19 |
A Trie-Based Approach for Compacting Automata
|
|
|
|
In: http://hal-enpc.archives-ouvertes.fr/docs/00/61/99/74/PDF/cpm04.pdf (2004)
|
|
BASE
|
|
Show details
|
|
20 |
Combinatorial Characterization of the Language Recognized by Factor and Suffix Oracles
|
|
|
|
In: Proceedings of the 4th Prague Stringology Conference (PSC) ; Prague Stringology Conference ; https://hal.archives-ouvertes.fr/hal-00487234 ; Prague Stringology Conference, Aug 2004, Prague, Czech Republic. pp.139--154 (2004)
|
|
BASE
|
|
Show details
|
|
|
|