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

Pattern matching between two non-aligned random sequences

K N Sheng1, J I Naus

  • 1Department of Statistics, Rutgers, State University of New Jersey, New Brunswick 08903.

Bulletin of Mathematical Biology
|November 1, 1994
PubMed
Summary

We determined the probability distribution for the longest matching word between two independent sequences. This research has applications in DNA sequence analysis and generalized sequence matching.

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 double-blind, dose-response study of midodrine in neurogenic orthostatic hypotension.

Neurology·1998
Same author

Efficacy of midodrine for neurogenic orthostatic hypotension. Reply.

JAMA·1997
Same author

Matching among multiple random sequences.

Bulletin of mathematical biology·1997
Same author

Efficacy of midodrine vs placebo in neurogenic orthostatic hypotension. A randomized, double-blind multicenter study. Midodrine Study Group.

JAMA·1997

Area of Science:

  • Computational Biology
  • Probability Theory
  • Bioinformatics

Background:

  • Sequence analysis is crucial in bioinformatics and molecular biology.
  • Understanding matching patterns in biological sequences aids in functional and evolutionary studies.
  • Probabilistic models are essential for analyzing random sequences.

Purpose of the Study:

  • To derive the probability distribution for the length of the longest matching word between two independent letter sequences.
  • To analyze both perfect and nearly perfect matches.
  • To develop bounds and approximations for this probability distribution.

Main Methods:

  • Mathematical derivation of probability distributions.
  • Development of analytical bounds and approximations.
  • Comparison of derived results with existing methods.
  • Application to random sequences and DNA sequences.

Main Results:

  • Established a probability distribution for the longest matching word length.
  • Derived novel bounds and approximations for this distribution.
  • Demonstrated the utility of the methods for DNA sequence analysis.
  • Showcased applicability to generalized matching problems.

Conclusions:

  • The study provides a robust framework for analyzing sequence matching probabilities.
  • The derived bounds and approximations offer valuable tools for bioinformatics research.
  • The findings contribute to a deeper understanding of sequence comparison methodologies.

Related Experiment Videos