Pattern Matching Techniques and Their Applications to Computational Molecular Biology - A Review

Authors

Eric C. Rouchka, Washington University in St Louis

Document Type

Technical Report

Department

Computer Science and Engineering

Publication Date

1999-01-01

Filename

WUCS-99-09.PDF

Technical Report Number

WUCS-99-09

Abstract

Pattern matching techniques have been useful in solving many problems associated with computer science, including data compression (Chrochemore and Lecroq, 1996), data encryption (RSA Laboratories, 1993), and computer vision (Grimson and Huttenlocher, 1990). In recent years, developments in molecular biology have led to large scale sequencing of genomic DNA. Since this data is being produced in such rapid fasion, tools to analyze DNA segments are desired. The goal here is to discuss various techniques and tools for solving various pattern matching questions in computational biology, including optimal sequence alignment, multiple sequence alignment, and buidling models to describe sequence families using Hidden Markov Models (HMMs) and regular expressions.

Comments

Permanent URL: http://dx.doi.org/10.7936/K7V69GT1

Recommended Citation

Rouchka, Eric C., "Pattern Matching Techniques and Their Applications to Computational Molecular Biology - A Review" Report Number: WUCS-99-09 (1999). All Computer Science and Engineering Research.
https://openscholarship.wustl.edu/cse_research/487