690 citations · 1.5k across the 11 of their papers we have counts for
12 papers
Revisiting the Complexity of and Algorithms for the Graph Traversal Edit Distance and Its Variants
Yutong Qiu, Yihang Shen, Carl Kingsford
The graph traversal edit distance (GTED), introduced by Ebrahimpour Boroojeny et al.~(2018), is an elegant distance measure defined as the minimum edit distance between strings rec…
Computationally Efficient High-Dimensional Bayesian Optimization via Variable Selection
Yihang Shen, Carl Kingsford
Bayesian Optimization (BO) is a method for globally optimizing black-box functions. While BO has been successfully applied to many scenarios, developing effective BO algorithms tha…
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…
How much data is sufficient to learn high-performing algorithms? Generalization guarantees for data-driven algorithm design
Maria-Florina Balcan, Dan DeBlasio, Travis Dick +3
Algorithms often have tunable parameters that impact performance metrics such as runtime and solution quality. For many algorithms used in practice, no parameter settings admit mea…
Mapping the Human Body at Cellular Resolution -- The NIH Common Fund Human BioMolecular Atlas Program
Michael P Snyder, Shin Lin, Amanda Posgai +22
Transformative technologies are enabling the construction of three dimensional (3D) maps of tissues with unprecedented spatial and molecular resolution. Over the next seven years,…
Efficient Index Maintenance Under Dynamic Genome Modification
Nitish Gupta, Komal Sanjeev, Tim Wall +2
Efficient text indexing data structures have enabled large-scale genomic sequence analysis and are used to help solve problems ranging from assembly to read mapping. However, these…