New Algorithms for Manipulating Sequence BDDs
Sequence binary decision diagram (SeqBDD) is a data structure to represent and manipulate sets of strings. This is a variant of zero-suppressed binary decision diagram (ZDD) that manipulates combinatorial sets. Nowadays, binary decision diagrams (BDDs) and its family have been recognized as an important data structure to manipulate discrete structures. SeqBDD has some set manipulation operations inherited from ZDD, but the number of the operations is not enough to deal with a wide variety of requests in string processing area. In this paper, we propose 50 new algorithms for manipulating SeqBDDs. We divide the operations into three categories and list up them. We also analyzed the time and space complexities of some new algorithms.
KeywordsManipulation algorithm Operation Sequence binary decision diagram Data structure Complexity
- 3.Aoki, H., Yamashita, S., Minato, S.: An efficient algorithm for constructing a sequence binary decision diagram representing a set of reversed sequences. In: Hong, T., et al. (eds.) Proceedings of 2011 IEEE International Conference on Granular Computing, pp. 54–59. IEEE Computer Society (2011). https://doi.org/10.1109/GRC.2011.6122567
- 6.Bubenzer, J.: Minimization of acyclic DFAs. In: Holub, J., Ždárek, J. (eds.) Proceedings of Prague Stringology Conference 2011, pp. 132–146. Czech Technical University (2011). http://www.stringology.org/event/2011/p12.html
- 18.Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Dunlop, A.E. (ed.) Proceedings of 30th Design Automation Conference, pp. 272–277. ACM Press (1993). https://doi.org/10.1145/157485.164890