5 citations · 5 across the 8 of their papers we have counts for
10 papers
Faster algorithms for 1-mappability of a sequence
Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos +3
In the k-mappability problem, we are given a string x of length n and integers m and k, and we are asked to count, for each length-m factor y of x, the number of other factors of l…
A Faster Construction of Greedy Consensus Trees
Paweł Gawrychowski, Gad M. Landau, Wing-Kin Sung +1
A consensus tree is a phylogenetic tree that captures the similarity between a set of conflicting phylogenetic trees. The problem of computing a consensus tree is a major step in p…
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…
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…
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
Viet Tung Hoang, Wing-Kin Sung
Consider a set of labels and a set of trees ${\mathcal T} = \{{\mathcal T}^{(1), {\mathcal T}^{(2), ..., {\mathcal T}^{(k) \$ where each tree ${\mathcal T}^{(i)$ is distinctly…
Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs
Samuel Ieong, Ming-Yang Kao, Tak-Wah Lam +2
The paper investigates the computational problem of predicting RNA secondary structures. The general belief is that allowing pseudoknots makes the problem hard. Existing polynomial…