7 citations · 11 across the 8 of their papers we have counts for
5 papers · 1 filter
An In-place Framework for Exact and Approximate Shortest Unique Substring Queries
Wing-Kai Hon, Sharma V. Thankachan, Bojian Xu
We revisit the exact shortest unique substring (SUS) finding problem, and propose its approximate version where mismatches are allowed, due to its applications in subfields such as…
On Stabbing Queries for Generalized Longest Repeat
Bojian Xu
A longest repeat query on a string, motivated by its applications in many subfields including computational biology, asks for the longest repetitive substring(s) covering a particu…
CloudTree: A Library to Extend Cloud Services for Trees
Yun Tian, Bojian Xu, Yanqing Ji +1
In this work, we propose a library that enables on a cloud the creation and management of tree data structures from a cloud client. As a proof of concept, we implement a new cloud…
On Longest Repeat Queries Using GPU
Yun Tian, Bojian Xu
Repeat finding in strings has important applications in subfields such as computational biology. The challenge of finding the longest repeats covering particular string positions w…
On Longest Repeat Queries
Atalay Mert İleri, M. Oğuzhan Külekci, Bojian Xu
Repeat finding in strings has important applications in subfields such as computational biology. Surprisingly, all prior work on repeat finding did not consider the constraint on t…