14 citations · 20 across the 7 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2011★ 1 cited
LGM: Mining Frequent Subgraphs from Linear Graphs
Yasuo Tabei, Daisuke Okanohara, Shuichi Hirose +1
A linear graph is a graph whose vertices are totally ordered. Biological and linguistic sequences with interactions among symbols are naturally represented as linear graphs. Exampl…
cs.DS2006★ 2 cited
Practical Entropy-Compressed Rank/Select Dictionary
Daisuke Okanohara, Kunihiko Sadakane
Rank/Select dictionaries are data structures for an ordered set to compute $\rank(x,S)$ (the number of elements in which are no greater than ), a…