Constructing small genome graphs via string compression | Zendy

Yutong Qiu | Zendy; Carl Kingsford | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Constructing small genome graphs via string compression

Author(s) -

Yutong Qiu,

Carl Kingsford

Publication year - 2021

Publication title -

bioinformatics

Language(s) - Uncategorized

Resource type - Journals

SCImago Journal Rank - 3.599

H-Index - 390

eISSN - 1367-4811

pISSN - 1367-4803

DOI - 10.1093/bioinformatics/btab281

Subject(s) - string (physics) , genome , computer science , computational biology , theoretical computer science , biology , genetics , mathematics , gene , mathematical physics

The size of a genome graph-the space required to store the nodes, node labels and edges-affects the efficiency of operations performed on it. For example, the time complexity to align a sequence to a graph without a graph index depends on the total number of characters in the node labels and the number of edges in the graph. This raises the need for approaches to construct space-efficient genome graphs.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research