cath-resolve-hits: a new tool that resolves domain matches suspiciously quickly | Zendy

Tony E. Lewis | Zendy; Ian Sillitoe | Zendy; Jonathan Lees | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

cath-resolve-hits: a new tool that resolves domain matches suspiciously quickly

Author(s) -

Tony E. Lewis,

Ian Sillitoe,

Jonathan Lees

Publication year - 2018

Publication title -

bioinformatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.599

H-Index - 390

eISSN - 1367-4811

pISSN - 1367-4803

DOI - 10.1093/bioinformatics/bty863

Subject(s) - computer science , json , benchmark (surveying) , documentation , set (abstract data type) , source code , domain (mathematical analysis) , code (set theory) , codebase , data mining , programming language , information retrieval , mathematical analysis , mathematics , geodesy , geography

Many bioinformatics areas require us to assign domain matches onto stretches of a query protein. Starting with a set of candidate matches, we want to identify the optimal subset that has limited/no overlap between matches. This may be further complicated by discontinuous domains in the input data. Existing tools are increasingly facing very large data-sets for which they require prohibitive amounts of CPU-time and memory.

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