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

An algorithm for searching restriction maps.

W Miller1, J Ostell, K E Rudd

  • 1Department of Computer Science, Pennsylvania State University, University Park 16802.

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

Achievement of Target Gain Larger than Unity in an Inertial Fusion Experiment.

Physical review letters·2024
Same author

Lawson Criterion for Ignition Exceeded in an Inertial Fusion Experiment.

Physical review letters·2022
Same author

Letter from New York-Yellow Fever Prevented by Innoculation.

The Southern medical record·2022
Same author

Scintillation light detection in the 6-m drift-length ProtoDUNE Dual Phase liquid argon TPC.

The European physical journal. C, Particles and fields·2022
Same author

Prospects for beyond the Standard Model physics searches at the Deep Underground Neutrino Experiment: DUNE Collaboration.

The European physical journal. C, Particles and fields·2021
Same author

STAGdb: a 30K SNP genotyping array and Science Gateway for Acropora corals and their dinoflagellate symbionts.

Scientific reports·2020
Same journal

DCA: an efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment.

Computer applications in the biosciences : CABIOS·1998
Same journal

Two applications to facilitate the viewing of database search result files on the Macintosh.

Computer applications in the biosciences : CABIOS·1998
Same journal

BioWish: a molecular biology command extension to Tcl/Tk.

Computer applications in the biosciences : CABIOS·1998
Same journal

The Sequence Alerting Server--a new WEB server.

Computer applications in the biosciences : CABIOS·1998
Same journal

A software tool for the analysis of mass spectrometric disulfide mapping experiments.

Computer applications in the biosciences : CABIOS·1998
Same journal

SAMBA: hardware accelerator for biological sequence comparison.

Computer applications in the biosciences : CABIOS·1998
See all related articles

This study introduces a novel algorithm for DNA restriction mapping. It efficiently finds short DNA sequences within large restriction maps, aiding genomic analysis.

Area of Science:

  • Genomics
  • Bioinformatics
  • Molecular Biology

Background:

  • Restriction enzyme mapping is crucial for DNA analysis.
  • Comparing DNA sequences to large restriction maps presents computational challenges.
  • The generation of large physical maps necessitates efficient comparison algorithms.

Purpose of the Study:

  • To develop and present an algorithm for searching DNA restriction maps.
  • To enable approximate matching of shorter probe maps within larger restriction maps.
  • To address the increasing need for comparing short DNA sequences with extensive genomic maps.

Main Methods:

  • The algorithm compares DNA restriction maps based on address-enzyme pairs.
  • It penalizes matches for undetected/missing sites and inaccurate distances between sites.

Related Experiment Videos

  • The method is designed for comparing short DNA sequences against long restriction maps.

    • Main Results:

    • The algorithm successfully searches for approximate matches of probe maps within larger restriction maps.
    • It effectively handles discrepancies in restriction sites and inter-site distances.
    • The algorithm has been applied to analyze the restriction map of the Escherichia coli genome.

    Conclusions:

    • The developed algorithm provides an effective solution for comparing short DNA sequences with large restriction maps.
    • This method is valuable for extracting information from complex genomic restriction maps.
    • The algorithm is well-suited for future large-scale genomic mapping projects.