|
Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >
Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations
This item is licensed under:Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
| Title: | Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations |
| Authors: | Denzumi, Shuhei Browse this author | | Yoshinaka, Ryo Browse this author | | Arimura, Hiroki Browse this author →KAKEN DB | | Minato, Shin-ichi Browse this author →KAKEN DB |
| Keywords: | Sequence binary decision diagram | | Persistent data structure | | Deterministic finite automaton | | Minimization | | Boolean set operation |
| Issue Date: | 30-Oct-2016 |
| Publisher: | Elsevier |
| Journal Title: | Discrete applied mathematics |
| Volume: | 212 |
| Start Page: | 61 |
| End Page: | 80 |
| Publisher DOI: | 10.1016/j.dam.2014.11.022 |
| Abstract: | 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. (2010) 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. (C) 2014 Elsevier B.V. All rights reserved. |
| Rights: | © 2014. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ | | http://creativecommons.org/licenses/by-nc-nd/4.0/ |
| Type: | article (author version) |
| URI: | http://hdl.handle.net/2115/71749 |
| Appears in Collections: | 情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)
|
Submitter: 湊 真一
|
