Parallel hierarchical adaptive genetic algorithm for fragment assembly

Research output: Contribution to conferencePaper

16 Scopus citations

Abstract

Fragment assembly is an important task in genome sequencing, and involves reconstructing a long sequence based on many overlapping subsequences (fragments) that contain errors. This paper presents a fragment assembler using a new parallel hierarchical adaptive variation of evolutionary algorithms. The innovative features include a new measure for evaluating sequence assembly quality and the development of a hybrid algorithm. Results from the simulation of 56 cases demonstrate that sequence assembly by the new sequencing method is highly accurate and noise-tolerant.

Original languageEnglish (US)
Pages600-607
Number of pages8
DOIs
StatePublished - Jan 1 2003
Event2003 Congress on Evolutionary Computation, CEC 2003 - Canberra, ACT, Australia
Duration: Dec 8 2003Dec 12 2003

Other

Other2003 Congress on Evolutionary Computation, CEC 2003
CountryAustralia
CityCanberra, ACT
Period12/8/0312/12/03

ASJC Scopus subject areas

  • Computational Mathematics

Fingerprint Dive into the research topics of 'Parallel hierarchical adaptive genetic algorithm for fragment assembly'. Together they form a unique fingerprint.

  • Cite this

    Kim, K., & Mohan, C. K. (2003). Parallel hierarchical adaptive genetic algorithm for fragment assembly. 600-607. Paper presented at 2003 Congress on Evolutionary Computation, CEC 2003, Canberra, ACT, Australia. https://doi.org/10.1109/CEC.2003.1299631