1 citations · 1 across the 6 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2017★ 1 cited
New and Improved Algorithms for Unordered Tree Inclusion
Tatsuya Akutsu, Jesper Jansson, Ruiming Li +2
The tree inclusion problem is, given two node-labeled trees and (the ``pattern tree'' and the ``target tree''), to locate every minimal subtree in (if any) that can be…
cs.DS2013
Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree
Jesper Jansson, Chuanqi Shen, Wing-Kin Sung
This paper presents two new deterministic algorithms for constructing consensus trees. Given an input of k phylogenetic trees with identical leaf label sets and n leaves each, the…
cs.DS2010
CRAM: Compressed Random Access Memory
Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
We present a new data structure called the \emph{Compressed Random Access Memory} (CRAM) that can store a dynamic string of characters, e.g., representing the memory of a compu…