Notes on sequence binary decision diagrams: Relationship to acyclic automata and complexities of binary set operations

Shuhei Denzumi, Ryo Yoshinaka, Hiroki Arimura, Shin ichi Minato

研究成果: Conference contribution

7 被引用数 (Scopus)

抄録

Manipulation of large sequence data is one of the most important problems in string processing. Recently, Loekito et al. (Knowl. Inf. Syst., 24(2), 235-268, 2009) have introduced a new data structure, called Sequence Binary Decision Diagrams (SeqBDDs, or SDDs), which are descendants of both acyclic DFAs (ADFAs) and binary decision diagrams (BDDs). SDDs can compactly represent sets of sequences as well as minimal ADFAs, while SDDs allow efficient set operations inherited from BDDs. A novel feature of the SDDs is that different SDDs can share equivalent subgraphs and duplicated computation in common to save the time and space in various operations. In this paper, we study fundamental properties of SDDs. In particular, we first present non-trivial relationships between sizes of minimum SDDs and minimal ADFAs. We then analyze the complexities of algorithms for Boolean set operations, called the binary synthesis. Finally, we show experimental results to confirm the results of the theoretical analysis on real data sets.

本文言語English
ホスト出版物のタイトルProceedings of the Prague Stringology Conference 2011
ページ147-161
ページ数15
出版ステータスPublished - 2011 12 1
外部発表はい
イベントPrague Stringology Conference 2011, PSC 2011 - Prague, Czech Republic
継続期間: 2011 8 292011 8 31

出版物シリーズ

名前Proceedings of the Prague Stringology Conference 2011

Other

OtherPrague Stringology Conference 2011, PSC 2011
国/地域Czech Republic
CityPrague
Period11/8/2911/8/31

ASJC Scopus subject areas

  • 数学 (全般)

フィンガープリント

「Notes on sequence binary decision diagrams: Relationship to acyclic automata and complexities of binary set operations」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル