4 papers
Efficient k-mer Dataset Compression Using Eulerian Covers of de Bruijn Graphs and BWT
H. Z. Q. Chen, S. Kitaev, X. Lang +2
Transforming an input sequence into its constituent k-mers is a fundamental operation in computational genomics. To reduce storage costs associated with k-mer datasets, we introduc…
On the word-representability of - graphs
Herman Z. Q. Chen, Humaira Hameed, Sergey Kitaev
Word-representable graphs are a class of graphs that can be represented by words, where edges and non-edges are determined by the alternation of letters in those words. Several pap…
On the representation number of grid graphs and cylindric grid graphs
Nawaf Shafi Alshammari, Sergey Kitaev, Artem Pyatkin
The representation number of a graph is the minimum number of copies of each vertex required to represent the graph as a word, such that the letters corresponding to vertices a…
On 1-11-representability and multi-1-11-representability of graphs
Mohammed Alshammari, Sergey Kitaev, Chaoliang Tang +2
Jeff Remmel introduced the concept of a -11-representable graph in 2017. This concept was first explored by Cheon et al. in 2019, who considered it as a natural extension of wor…