4 citations · 7 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023
Sketching methods with small window guarantee using minimum decycling sets
Guillaume Marçais, Dan DeBlasio, Carl Kingsford
Most sequence sketching methods work by selecting specific -mers from sequences so that the similarity between two sequences can be estimated using only the sketches. Estimating…
cs.DS2020★ 3 cited
Lower density selection schemes via small universal hitting sets with short remaining path length
Hongyu Zheng, Carl Kingsford, Guillaume Marçais
Universal hitting sets are sets of words that are unavoidable: every long enough sequence is hit by the set (i.e., it contains a word from the set). There is a tight relationship b…