We present a practical algorithm to find such best VLDC patterns exactly, powerfully sped up by pruning heuristics. We introduce two versions of our algorithm: ...

Discovering Best Variable-Length-Don't-Care. Patterns. Shunsuke Inenaga. 1. , Hideo Bannai. 3. , Ayumi Shinohara. 1,2. ,. Masayuki Takeda. 1,2. , and Setsuo ...

We present a practical algorithm to find such best VLDC patterns exactly, powerfully sped up by pruning heuristics. We introduce two versions of our algorithm: ...

A variable-length-don't-care pattern (VLDC pattern) is an element of set Π = (Σ∪{∗})∗, where Σ is an alphabet and ∗ is a wildcard matching any string in ...

We present a practical algorithm to find such best VLDC patterns exactly, powerfully sped up by pruning heuristics. We introduce two versions of our algorithm: ...

We present a practical algorithm to find such best VLDC patterns exactly, powerfully sped up by pruning heuristics. We introduce two versions of our algorithm: ...

Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara , Masayuki Takeda, Setsuo Arikawa: Discovering Best Variable-Length-Don't-Care Patterns.

Fingerprint. Dive into the research topics of 'Discovering best variable-length-don't-care patterns'. Together they form a unique fingerprint.

Discovering best variable-length-don't-care patterns. In Proc. Discovery Science 2002, volume 2534 of LNCS, pages 86–97. Springer-Verlag, 2002. 6. E. W. ...

We propose a new string kernel based on variable-length-don't-care patterns (VLDC patterns). A VLDC pattern is an element of (Σ ∪ { ⋆ })*, where Σ is an ...