Benchmark datasets for the DNA fragment assembly problem
by Guillermo M. Mallén-Fullerton; James Alexander Hughes; Sheridan Houghten; Guillermo Fernández-Anaya
International Journal of Bio-Inspired Computation (IJBIC), Vol. 5, No. 6, 2013

Abstract: Many computational intelligence approaches have been used for the fragment assembly problem. However, the comparison and analysis of these approaches is difficult due to the lack of availability of standard benchmarks. Although similar datasets may be used as a starting point, there is not enough information to reproduce the exact overlaps matrix for the fragments used by the various approaches, creating a problem for consistency. This paper presents a collection of benchmark datasets for a wide range of fragment lengths, number of fragments, and sequence lengths, along with a description of the method used to produce them. A website has been created to maintain the datasets and the tables of results at Researchers are invited to add to the datasets by following the method described, as well as to submit results obtained by their algorithms on the benchmarks.

Online publication date: Mon, 31-Mar-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email