Modified SIMPSON O(n3) algorithm for the full sibship reconstruction problem | Zendy

Dmitry A. Konovalov | Zendy; Nigel Bajema | Zendy; Bruce Litow | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Modified SIMPSON O(n3) algorithm for the full sibship reconstruction problem

Author(s) -

Dmitry A. Konovalov,

Nigel Bajema,

Bruce Litow

Publication year - 2005

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

Subject(s) - heuristic , algorithm , computer science , measure (data warehouse) , index (typography) , range (aeronautics) , mathematics , artificial intelligence , data mining , world wide web , composite material , materials science

The problem of reconstructing full sibling groups from DNA marker data remains a significant challenge for computational biology. A recently published heuristic algorithm based on Mendelian exclusion rules and the Simpson index was successfully applied to the full sibship reconstruction (FSR) problem. However, the so-called SIMPSON algorithm has an unknown complexity measure, questioning its applicability range.

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