Press "Enter" to skip to content

Algorithms in Bioinformatics: A Practical Introduction by Wing-Kin Sung

By Wing-Kin Sung

Built from the author’s personal educating fabric, Algorithms in Bioinformatics: a pragmatic advent presents an in-depth advent to the algorithmic thoughts utilized in bioinformatics. for every subject, the writer in actual fact information the organic motivation and accurately defines the corresponding computational difficulties. He additionally contains targeted examples to demonstrate every one set of rules and end-of-chapter routines for college kids to familiarize themselves with the themes. Supplementary fabric is obtainable at

This classroom-tested textbook starts off with easy molecular biology ideas. It then describes how one can degree series similarity, offers basic purposes of the suffix tree, and discusses the matter of looking out series databases. After introducing equipment for aligning a number of organic sequences and genomes, the textual content explores functions of the phylogenetic tree, tools for evaluating phylogenetic timber, the matter of genome rearrangement, and the matter of motif discovering. It additionally covers tools for predicting the secondary constitution of RNA and for reconstructing the peptide series utilizing mass spectrometry. the ultimate bankruptcy examines the computational challenge relating to inhabitants genetics.

Show description

Read Online or Download Algorithms in Bioinformatics: A Practical Introduction PDF

Similar algorithms books

The Nature of Code

How will we trap the unpredictable evolutionary and emergent homes of nature in software program? How can knowing the mathematical ideas at the back of our actual international support us to create electronic worlds? This publication specializes in a number of programming ideas and methods in the back of desktop simulations of common platforms, from simple innovations in arithmetic and physics to extra complex algorithms that allow subtle visible effects.

Creating New Medical Ontologies for Image Annotation: A Case Study

Developing New scientific Ontologies for picture Annotation specializes in the matter of the scientific pictures computerized annotation approach, that is solved in an unique demeanour through the authors. all of the steps of this procedure are defined intimately with algorithms, experiments and effects. the unique algorithms proposed via authors are in comparison with different effective related algorithms.

Algorithms and Models for the Web-Graph: 7th International Workshop, WAW 2010, Stanford, CA, USA, December 13-14, 2010. Proceedings

This booklet constitutes the refereed lawsuits of the seventh foreign Workshop on Algorithms and versions for the Web-Graph, WAW 2010, held in Stanford, CA, united states, in December 2010, which used to be co-located with the sixth foreign Workshop on net and community Economics (WINE 2010). The thirteen revised complete papers and the invited paper offered have been rigorously reviewed and chosen from 19 submissions.

Additional resources for Algorithms in Bioinformatics: A Practical Introduction

Sample text

Insert a letter into a sequence. 3. Delete a letter from a sequence. For example, given two strings S = interestingly and T = bioinformatics, S can be transformed to T using six replacements, three insertions, and two deletions. The minimum number of operations required to transform S to T is called the edit distance. For the above example, the edit distance is 11. In general, we can associate a cost to every edit operation. Let Σ be the alphabet set and ‘ ’ be a special symbol representing a null symbol.

Given any alignment of two sequences. For any operation (x, y), let nxy be the number of occurrences of the operation (x, y). Then, the edit distance of the alignment is: nx,y σ(x, y) x∈Σ∪{ } y∈Σ∪{ } The alignment score of the alignment is: nx,y δ(x, y) x∈Σ∪{ } y∈Σ∪{ } Because δ = −σ, minimizing the edit distance is equivalent to maximizing the alignment score. Although string edit and global alignment are equivalent, people in computational biology prefer to use global alignment to measure the similarity of DNA, RNA, and protein sequences.

To get the optimal score, we choose the maximum value among 0 and these three cases. Thus, we get the following recurrence relation: ⎧ 0 align empty strings ⎪ ⎪ ⎨ V (i − 1, j − 1) + δ(S[i], T [j]) match/mismatch V (i, j) = max delete V (i − 1, j) + δ(S[i], ) ⎪ ⎪ ⎩ insert V (i, j − 1) + δ( , T [j]) The optimal local alignment score is maxi,j V (i, j). Smith and Waterman proposed that this score can be computed by filling in the table V row by row using the above recursive equations. For example, consider S = ACAAT CG and T = CT CAT GC.

Download PDF sample

Rated 4.56 of 5 – based on 22 votes