Pathgroups, a dynamic data structure for genome reconstruction problems | Zendy

Chunfang Zheng | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Pathgroups, a dynamic data structure for genome reconstruction problems

Author(s) -

Chunfang Zheng

Publication year - 2010

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

Subject(s) - heuristics , computer science , heuristic , greedy algorithm , genome , set (abstract data type) , data structure , sequence (biology) , algorithm , scheme (mathematics) , theoretical computer science , data mining , computational biology , gene , artificial intelligence , biology , mathematics , genetics , programming language , operating system , mathematical analysis

Ancestral gene order reconstruction problems, including the median problem, quartet construction, small phylogeny, guided genome halving and genome aliquoting, are NP hard. Available heuristics dedicated to each of these problems are computationally costly for even small instances.

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