Skip Navigation



Bioinformatics Advance Access published online on August 23, 2005
Bioinformatics, doi:10.1093/bioinformatics/bti642
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrow All Versions of this Article:
21/20/3912    most recent
bti642v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Konovalov, D. A.
Right arrow Articles by Litow, B.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Konovalov, D. A.
Right arrow Articles by Litow, B.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author (2005). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oupjournals.org
Received June 20, 2005
Revised August 11, 2005
Accepted August 22, 2005

Article

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

Dmitry A. Konovalov 1*, Nigel Bajema 1, and Bruce Litow 1

1 School of Information Technology, James Cook University, Townsville, QLD 4811, Australia

* To whom correspondence should be addressed.
Dmitry A. Konovalov, E-mail: Dmitry.Konovalov{at}jcu.edu.au


  Abstract

Motivation: 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.

Results: We present a modified version of the SIMPSON (MS) algorithm that behaves as O(n3) and achieves the same or better accuracy when compared with the original algorithm. Performance of the MS algorithm was tested on a variety of simulated diploid population samples to verify its complexity measure and the significant improvement in efficiency (e.g. 100 times faster than SIMPSON in some cases). It has been shown that, in theory, the SIMPSON algorithm could run in non-polynomial time significantly limiting its usefulness. It has been also verified via simulation experiments that SIMPSON runs at least in O(na), where a>3.

Availability: Computer code written in java is available upon request from the first author.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Am. J. Enol. Vitic.Home page
A. Garris, P. Cousins, D. Ramming, and A. Baldo
Parentage Analysis of Freedom Rootstock
Am. J. Enol. Vitic., September 1, 2009; 60(3): 357 - 361.
[Abstract] [Full Text] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.