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

Dynamic programming algorithms for restriction map comparison.

X Huang1, M S Waterman

  • 1Department of Computer Science, Michigan Technological University, Houghton 49931-1295.

Computer Applications in the Biosciences : CABIOS
|October 1, 1992
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

Topological classification and enumeration of RNA structures by genus.

Journal of mathematical biology·2012
Same author

DNA sequence assembly and multiple sequence alignment by an Eulerian path approach.

Cold Spring Harbor symposia on quantitative biology·2004
Same author

An Eulerian path approach to DNA fragment assembly.

Proceedings of the National Academy of Sciences of the United States of America·2001
Same author

Creation of chimeric mutant axolotls: a model to study early embryonic heart development in Mexican axolotls.

Anatomy and embryology·2001
Same author

Exploring the DNA-binding specificities of zinc fingers with DNA microarrays.

Proceedings of the National Academy of Sciences of the United States of America·2001
Same author

Generation and reaction of alkene radical cations under nonoxidizing conditions: synthesis of the pyrrolizidine nucleus.

Organic letters·2001

This study presents new dynamic programming algorithms for restriction map comparison, effectively handling errors in site ordering and mapping. These efficient algorithms extend previous models and are applied to analyze the Escherichia coli restriction map.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Sequence comparison problems often have corresponding map comparison algorithms.
  • Dynamic programming offers rigor and efficiency for sequence analysis.
  • Map data presents unique challenges for traditional dynamic programming approaches.

Purpose of the Study:

  • To adapt dynamic programming for restriction map comparison.
  • To develop algorithms that address specific types of errors in restriction maps.
  • To find similar regions within genomic maps using novel algorithms.

Main Methods:

  • Extension of a previous map comparison model.
  • Development of dynamic programming algorithms for optimal global and local alignments.

Related Experiment Videos

  • Implementation of algorithms to analyze the Escherichia coli restriction map.

    • Main Results:

    • New algorithms effectively handle errors in restriction site ordering and mapping.
    • The computational time complexity remains comparable to previous map comparison algorithms.
    • Similar regions were identified within the Escherichia coli restriction map.

    Conclusions:

    • Dynamic programming can be successfully applied to restriction map comparison.
    • The developed algorithms provide efficient solutions for analyzing genomic maps with errors.
    • The findings facilitate the identification of conserved or similar genomic regions.