5 citations · 5 across the 8 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
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…
cs.DS2017
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…