Part I: Sequence Alignment
نویسنده
چکیده
Current DNA sequencing methods can accurately determine only a few hundred ‘letters’ (bases) off each end of a contiguous stretch of DNA. It is therefore impossible to read a complete genome all at once. The human genome, for example, consists of about 3 billion base pairs — in contrast to about 500 that can be read at a time. The Whole Genome Shotgun Sequencing Method addresses this problem by randomly cutting multiple samples of identical DNA into small chunks, each of which is sequenced separately. If we were to cut up only a single DNA sample into many pieces, there would be no way of reconstructing the original sequence from the individual pieces. By cutting up multiple copies of the sequence in different ways, we can reconstruct the original sequence by aligning segments with overlapping reads, as illustrated in Fig. 1. Reads are asymmetric: They have an ‘outside’ end (where the DNA has been cut) and an ‘inside’ end (where the chunk of DNA continues but can’t be read). Reads can overlap in three ways (‘· · · ’ indicates the inside end of a read):
منابع مشابه
Genetic variations of avian Pasteurella multocida as demonstrated by 16S-23S rRNA gene sequences comparison
Pasteurella multocida is known as an important heterogenic bacterial agent causes some severe diseases such as fowl cholera in poultry and haemorrhagic septicaemia in cattle and buffalo. A polymerase chain reaction (PCR) assay was developed using primers derived from conserved part of 16S-23S rRNA gene. The PCR amplified a fragment size of 0.7 kb using DNA from nine avian P. multocida isolates...
متن کاملAn Application of the ABS LX Algorithm to Multiple Sequence Alignment
We present an application of ABS algorithms for multiple sequence alignment (MSA). The Markov decision process (MDP) based model leads to a linear programming problem (LPP), whose solution is linked to a suggested alignment. The important features of our work include the facility of alignment of multiple sequences simultaneously and no limit for the length of the sequences. Our goal here is to ...
متن کامل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...
متن کاملStreaming from MIDI Using Constraint Satisfaction Optimization and Sequence Alignment
We present a new system for separating streams in musical pieces encoded as MIDI files. Our approach is to: (1) divide the music under analysis into short segments, (2) analyze each segment using constraint satisfaction optimization, and (3) connect these analyses using a sequence alignment algorithm. Parameters for the system are learned automatically on a small training corpus and generalize ...
متن کاملMolecular characterization of apolipoprotein A-I from the skin mucosa of Cyprinus carpio
Apolipoprotein A-I is the most abundant protein in Cyprinus carpio plasma that plays an important role in lipid transport and protection of the skin by means of its antimicrobial activity. A 527 bp cDNA fragment encoding C terminus part of apoA-I from the skin mucosa of common carp was isolated using RT-PCR. After GenBank database searching, a partial sequence containing a coding sequence (CDS)...
متن کاملTandem Cyclic Alignment
We present a solution for the following problem. Given two sequences X = x1x2 · · ·xn and Y = y1y2 · · · ym, n ≤ m, find the best scoring alignment of X ′ = X[i] vs Y over all possible pairs (k, i), for k = 1, 2, . . . and 1 ≤ i ≤ n, where X[i] is the cyclic permutation of X, X[i] is the concatenation of k complete copies of X[i] (k tandem copies), and the alignment must include all of Y and al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006