Title

Authors

Affiliation

¹Center of Excellent in Biomathematics, School of Mathematics, Statistics, and Computer Science, University of Tehran, Tehran, Iran; ²Laboratoire d'Informatiques (LIX), Ecole Polytechnique, Palaiseau Cedex 91128, France; ³Institute of Biochemistry and Biophysics (IBB), University of Tehran, Tehran, Iran.

Email

mgtabesh@ut.ac.ir; *Corresponding author

Article Type

Hypothesis

Date

Received December 26, 2011; Accepted December 28, 2011; Published May 31, 2012

The strongly NP-Hard Double Digest Problem, for reconstructing the physical map of DNA sequence, in now using for efficient genotyping. Most of the existing methods are inefficient in tackling large instances due to the large search space for the problem which grows as a factorial function (a!)(b!) of the numbers (a) and (b) of the DNA fragments generated by the two restriction enzymes. Also, none of the existing methods are able to handle the erroneous data. In this paper, we develop a novel method based on genetic algorithm for solving this problem and it is adapted to handle the erroneous data. Our genetic algorithm is implemented and compared with the other well-known existing algorithms. The obtained results show the efficiency (speedup) of our algorithm with respect to the other methods, specially for erroneous data.

Citation

Ganjtabesh et al. Bioinformation 8(10): 453-456 (2012)
 

Edited by

P Kangueane

ISSN

0973-2063

Publisher

Biomedical Informatics

License

This is an Open Access article which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited. This is distributed under the terms of the Creative Commons Attribution License.