A fast adaptive algorithm for computing whole-genome homology maps | Zendy

Chirag Jain | Zendy; Sergey Koren | Zendy; Alexander Dilthey | Zendy; Adam M. Phillippy | Zendy; Srinivas Aluru | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A fast adaptive algorithm for computing whole-genome homology maps

Author(s) -

Chirag Jain,

Sergey Koren,

Alexander Dilthey,

Adam M. Phillippy,

Srinivas Aluru

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/bty597

Subject(s) - computer science , genome , reference genome , smith–waterman algorithm , probabilistic logic , segmental duplication , comparative genomics , precision and recall , chromosome , genome project , algorithm , genomics , human genome , sequence alignment , data mining , artificial intelligence , biology , genetics , gene , gene family , peptide sequence

Whole-genome alignment is an important problem in genomics for comparing different species, mapping draft assemblies to reference genomes and identifying repeats. However, for large plant and animal genomes, this task remains compute and memory intensive. In addition, current practical methods lack any guarantee on the characteristics of output alignments, thus making them hard to tune for different application requirements.

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