Implementation of sequence BDDs in Erlang

Denzumi, Shuhei; Arimura, Hiroki; Minato, Shin-ichi

doi:10.1145/2034654.2034672

Search citation statements

Order By: Relevance

Paper Sections

Select...

Methods1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2012

2016

Publication Types

Select...

Article1

Book1

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…6. The first version 2 [11] is implemented in a functional language, Erlang [23] and used in Exp. 1.…”

Section: Methodsmentioning

confidence: 99%

Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations

Denzumi

Yoshinaka

Arimura

et al. 2016

Discrete Applied Mathematics

Self Cite

View full text Add to dashboard Cite

The manipulation of large sequence data is one of the most important problems in string processing. In this paper, we discuss a new data structure for storing and manipulating sets of strings, called Sequence Binary Decision Diagrams (sequence BDDs), which has recently been introduced by Loekito et al. (Knowl. Inf. Syst., 24(2), 235-268, 2009) as a descendant of both acyclic DFAs (ADFAs) and binary decision diagrams (BDDs). Sequence BDDs can compactly represent sets of sequences similarly to minimal ADFAs, and allow efficient set operations inherited from BDDs. We study fundamental properties of sequence BDDs, such as the characterization of minimal sequence BDDs by reduced sequence BDDs, non-trivial relationships between sizes of minimal sequence BDDs and minimal ADFAs, the complexities of minimization, Boolean set operations, and sequence BDD construction. We also show experimental results for real and artificial data sets.

show abstract

“…6. The first version 2 [11] is implemented in a functional language, Erlang [23] and used in Exp. 1.…”

Section: Methodsmentioning

confidence: 99%