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 O (N2 log N) restriction map comparison and search algorithm.

E W Myers1, X Huang

  • 1Department of Computer Science, University of Arizona, Tucson 85721.

Bulletin of Mathematical Biology
|July 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

Modulation of recombinant human prostate-specific antigen: activation by Hofmeister salts and inhibition by azapeptides. Appendix: thermodynamic interpretation of the activation by concentrated salts.

Biochemistry·2001
Same author

p11 expression in human bronchial epithelial cells is increased by nitric oxide in a cGMP-dependent pathway involving protein kinase G activation.

The Journal of biological chemistry·2001
Same author

[Kinetic study on photocatalytic degradation of p-chlorobenzoate at different light intensities].

Huan jing ke xue= Huanjing kexue·2001
Same author

Artificial carbon dioxide source to attract lesser cornstalk borer (Lepidoptera: Pyralidae) larvae.

Journal of economic entomology·2001
Same author

Structural features of peptide analogs of human histocompatibility leukocyte antigen class I epitopes that are more potent and immunogenic than wild-type peptide.

The Journal of experimental medicine·2001
Same author

Effect of influenza virus matrix protein and viral RNA on ribonucleoprotein formation and nuclear export.

Virology·2001
Same journal

Slow Evolution Towards Generalism in a Model of Variable Dietary Range.

Bulletin of mathematical biology·2026
Same journal

CBINN: Cancer Biology-Informed Neural Network for Unknown Parameter Estimation and Missing Physics Identification.

Bulletin of mathematical biology·2026
Same journal

A Cost-Sensitive Behavioral Modeling Analysis of the Early Identification and Control of Infectious Diseases.

Bulletin of mathematical biology·2026
Same journal

Tracking Dynamics of Superspreading Through Contacts, Exposures, and Transmissions in Edge-Based Network Epidemics.

Bulletin of mathematical biology·2026
Same journal

The Exact Hypergeometric Posterior Method for Accurate Inference of Population Size from Mark-Recapture Data.

Bulletin of mathematical biology·2026
Same journal

Modeling, Analysis, and Optimal Control of Leukemic Cell Population Dynamics Under Therapy.

Bulletin of mathematical biology·2026
See all related articles

We developed an efficient algorithm for comparing restriction maps, significantly improving the speed of finding the best matches between DNA sequences. This method enhances biological data analysis by optimizing restriction map searching.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Molecular Biology

Background:

  • Restriction map analysis is crucial for DNA sequence comparison.
  • Existing algorithms can be computationally intensive for large datasets.

Purpose of the Study:

  • To develop a novel, time-efficient algorithm for searching restriction maps.
  • To optimize the scoring of matches based on site alignment and distance discrepancies.

Main Methods:

  • A sparse dynamic programming approach utilizing "candidate lists" was employed.
  • The algorithm achieves O(R log P) time complexity and O(M+P^2) space complexity for map searching.
  • A modification allows computation of map distances in O(MN(log M+log N)) time.

Main Results:

Related Experiment Videos

  • The new algorithm significantly reduces computational time for restriction map searching.
  • It provides an efficient method for identifying best matches between maps with M and P sites.
  • The modified algorithm offers a faster way to calculate distances between two restriction maps.

Conclusions:

  • The presented algorithm offers a substantial improvement in efficiency for restriction map analysis.
  • This computational advancement can accelerate research in genomics and molecular biology.
  • The method provides a valuable tool for comparative genomics and sequence alignment.