2 papers
cs.DS2023
Finding a reconfiguration sequence between longest increasing subsequences
Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi +1
In this note, we consider the problem of finding a step-by-step transformation between two longest increasing subsequences in a sequence, namely Longest Increasing Subsequence Reco…
cs.DS2012
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data
Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh
We study a character-based phylogeny reconstruction problem when an incomplete set of data is given. More specifically, we consider the situation under the directed perfect phyloge…