1 |
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures
|
|
Nakashima, Katsuhito; Fujisato, Noriki; Hendrian, Diptarama; Nakashima, Yuto; Yoshinaka, Ryo; Inenaga, Shunsuke; Bannai, Hideo; Shinohara, Ayumi; Takeda, Masayuki. - : LIPIcs - Leibniz International Proceedings in Informatics. 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), 2020
|
|
Keyword:
Data processing Computer science; DAWGs; parameterized matching; suffix automata; suffix trees
|
|
URN:
urn:nbn:de:0030-drops-121512
|
|
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12151/ https://doi.org/10.4230/LIPIcs.CPM.2020.26
|
|
BASE
|
|
Hide details
|
|
2 |
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures ...
|
|
|
|
BASE
|
|
Show details
|
|
3 |
DAWGs for parameterized matching: online construction and related indexing structures ...
|
|
|
|
BASE
|
|
Show details
|
|
4 |
An Extension of Linear-size Suffix Tries for Parameterized Strings ...
|
|
|
|
BASE
|
|
Show details
|
|
5 |
Efficiency in the Identification in the Limit Learning Paradigm
|
|
|
|
In: Topics in Grammatical Inference ; https://hal.archives-ouvertes.fr/hal-01399418 ; Jeffrey Heinz and José M. Sempere. Topics in Grammatical Inference, pp.25 - 46, 2016, 978-3-662-48395-4. ⟨10.1007/978-3-662-48395-4_2⟩ ; http://www.springer.com/la/book/9783662483930 (2016)
|
|
BASE
|
|
Show details
|
|
6 |
Well-Nestedness Properly Subsumes Strict Derivational Minimalism
|
|
|
|
In: LACL 2011 ; Logical Aspects of Computational Linguistics - 6th international conference ; https://hal.archives-ouvertes.fr/hal-00959629 ; Logical Aspects of Computational Linguistics - 6th international conference, 2011, Montpellier, France. pp.112-128 (2011)
|
|
BASE
|
|
Show details
|
|
|
|