CS 284 A : Algorithms for Computational Biology

نویسنده

  • Oleksii Kuchaiev
چکیده

To be able quickly find exact matches BLAST uses strategy of dot plots. Dot Plot is a table whose rows and columns are marked using sequences letters.For example: Identify internal repeats and inversions C A T D O G C A T G O D C * * A * * T * * D * * O * * G * * C * * A * * T * * G * * O * * D * * This dot plot allows us quickly identify internal repeats and inversions. Repeats are dot lines which go from left to right, inversions dot lines which go from right to left.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed and Cooperative Compressive Sensing Recovery Algorithm for Wireless Sensor Networks with Bi-directional Incremental Topology

Recently, the problem of compressive sensing (CS) has attracted lots of attention in the area of signal processing. So, much of the research in this field is being carried out in this issue. One of the applications where CS could be used is wireless sensor networks (WSNs). The structure of WSNs consists of many low power wireless sensors. This requires that any improved algorithm for this appli...

متن کامل

Block-Based Compressive Sensing Using Soft Thresholding of Adaptive Transform Coefficients

Compressive sampling (CS) is a new technique for simultaneous sampling and compression of signals in which the sampling rate can be very small under certain conditions. Due to the limited number of samples, image reconstruction based on CS samples is a challenging task. Most of the existing CS image reconstruction methods have a high computational complexity as they are applied on the entire im...

متن کامل

gpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences

Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...

متن کامل

A hybrid CS-SA intelligent approach to solve uncertain dynamic facility layout problems considering dependency of demands

This paper aims at proposing a quadratic assignment-based mathematical model to deal with the stochastic dynamic facility layout problem. In this problem, product demands are assumed to be dependent normally distributed random variables with known probability density function and covariance that change from period to period at random. To solve the proposed model, a novel hybrid intelligent algo...

متن کامل

The rise of computational biology

The era of computer simulations (CS) started with the development of the first digital computers in ‘40s and ’50s (for example, MANIAC (stands for “Mathematical and Numerical Integrator and Computer) computer in Los Alamos). First Molecular Dynamics simulations were reported in 1956. Now CS are the standard tool for studying diverse set of problems. The need in CS arises because very few proble...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008