Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Genetic algorithms for DNA sequence assembly

R Parsons1, S Forrest, C Burks

  • 1Los Alamos National Laboratory, Computer Research Applications Group, NM 87545, USA.

Proceedings. International Conference on Intelligent Systems for Molecular Biology
|January 1, 1993
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

A practical, adaptive compliance management framework for improving marine protected area effectiveness.

Conservation biology : the journal of the Society for Conservation Biology·2026
Same author

The effect of DNA recovery on the subsequent quality of latent fingermarks: A pseudo-operational trial.

Forensic science international·2019
Same author

Combined effect of toe out gait and high tibial osteotomy on knee adduction moment in patients with varus knee deformity.

Clinical biomechanics (Bristol, Avon)·2017
Same author

Prevention of postsurgical wound dehiscence after abdominal surgery with NPWT: a multicentre randomised controlled trial protocol.

Journal of wound care·2017
Same author

Compliance of post-radiation therapy head and neck cancer patients with caries preventive protocols.

Australian dental journal·2016
Same author

Evaluation of the first pharmacist-administered vaccinations in Western Australia: a mixed-methods study.

BMJ open·2016
Same journal

Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology (ISMB 2000). San Diego, California, USA. August 19-23, 2000.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2001
Same journal

Analysis of gene expression data with pathway scores.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
Same journal

Towards a complete map of the protein space based on a unified sequence and structure analysis of all known proteins.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
Same journal

Mining for putative regulatory elements in the yeast genome using gene expression data.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
Same journal

A multiple alignment algorithm for metabolic pathway analysis using enzyme hierarchy.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
Same journal

Sequence database search using jumping alignments.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
See all related articles

This study applies a genetic algorithm to DNA sequence assembly, finding it a fast method for fragment ordering. However, current fitness functions need improvement for better accuracy in DNA fragment assembly.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • DNA sequence assembly is a critical step in genomics.
  • Computational methods are essential for efficient assembly of DNA fragments.
  • Genetic algorithms offer a potential approach for complex optimization problems like sequence assembly.

Purpose of the Study:

  • To investigate the application of a genetic algorithm for DNA sequence assembly.
  • To evaluate the effectiveness of different fitness functions in guiding the genetic algorithm for fragment ordering.

Main Methods:

  • A genetic algorithm was employed to solve the DNA sequence assembly problem.
  • A sorted order representation was used to encode fragment permutations.
  • Two distinct fitness functions, based on fragment overlap strengths, were tested.

Related Experiment Videos

Main Results:

  • The genetic algorithm demonstrated the ability to achieve usable DNA fragment assembly solutions rapidly.
  • Performance was evaluated using fitness functions based on pairwise overlap strengths.
  • The study identified limitations in the current fitness functions used.

Conclusions:

  • Genetic algorithms show promise as a viable method for DNA sequence assembly.
  • Further research is needed to refine fitness functions for improved accuracy.
  • Alternative representations may offer better performance for genetic algorithm-based assembly.