| 1 |
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures
|
|
|
|
BASE
|
|
Show details
|
|
|
| 2 |
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. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020
|
|
Abstract:
Two strings x and y over Σ ∪ Π of equal length are said to parameterized match (p-match) if there is a renaming bijection f:Σ ∪ Π → Σ ∪ Π that is identity on Σ and transforms x to y (or vice versa). The p-matching problem is to look for substrings in a text that p-match a given pattern. In this paper, we propose parameterized suffix automata (p-suffix automata) and parameterized directed acyclic word graphs (PDAWGs) which are the p-matching versions of suffix automata and DAWGs. While suffix automata and DAWGs are equivalent for standard strings, we show that p-suffix automata can have Θ(n²) nodes and edges but PDAWGs have only O(n) nodes and edges, where n is the length of an input string. We also give O(n |Π| log (|Π| + |Σ|))-time O(n)-space algorithm that builds the PDAWG in a left-to-right online manner. As a byproduct, it is shown that the parameterized suffix tree for the reversed string can also be built in the same time and space, in a right-to-left online manner. ... : LIPIcs, Vol. 161, 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), pages 26:1-26:14 ...
|
|
Keyword:
DAWGs; parameterized matching; suffix automata; suffix trees
|
|
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12151/
https://dx.doi.org/10.4230/lipics.cpm.2020.26
|
|
BASE
|
|
Hide 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
|
|
|
|
|
