This summer three publications from the group were awarded at different international conferences.
In postdoctoral researcher , professor and research assistant introduce the Spectral Burrows-Wheeler Transform (SBWT), a static representation of the k-length substrings of a genomic collection (k-spectrum). In the publication, the team also proposed different succinct representations of the SBWT and experimentally demonstrate their dominance to the state-of-the-art. The work was presented at the and received the best paper prize.
In doctoral researcher shows algorithms solving the string matching problem between a string and a directed acyclic graph (DAG), a fundamental problem in pangenomics and modern bioinformatics. While the problem admits a , the algorithms developed by the doctoral researcher run in linear time for an broad class of DAGs: k-funnels. The work was presented at the and it was chosen as the best paper.
Finally, in doctoral researcher shows a fast algorithm to find a decomposition of a DAG into a minimum number of chains (path in the transitive closure) or minimum chain cover (MCC). Finding an MCC is a fundamental problem with applications to pangenomics and multi-assembly. The algorithm developed by the doctoral researcher is the first to run in almost linear time in the size of the DAG. The work was presented at the and received the best student paper award of track A.