Tuesday, 2019-05-21 BioInfo Pakistan
 Home | Sign Up | Log In Welcome Guest | RSS
 Site menu
Section categories
 Related Subjects [38]This category includes brief overview of all related subjects. Defining BioInformatics [7]In this section we tried to briefly explain what bioinformatics is ? Unviersities [30]This contains information about universities that are offering bioinformatics degree programs. Resources [24]Contains information about bioinformatics resources including databases, tools and techniques. Algorithms [31]This category includes some of the basic algorithms that are usually used by bioinformaticians.
 Our poll Pakistani Students Should Join Bio-Informatics Yes No Total of answers: 35
 Chat Box Only authorized users can post messages
 Statistics Total online: 1 Guests: 1 Users: 0
Home » 2011 » August » 12 » Basic Bioinformatics Algorithms
9:40 PM
Basic Bioinformatics Algorithms

 This section contains commonly used bioinformatics algorithms.Sequence AlignmentNeedleman–Wunsch algorithm: find global alignment between two sequencesSmith–Waterman algorithm: find local sequence alignmentBasic Local Alignment Search Tool also known as BLAST: an algorithm for comparing primary biological sequence informationDynamic time warping: measure similarity between two sequences which may vary in time or speedHirschberg's algorithm: finds the least cost sequence alignment between two sequences, as measured by their Levenshtein distanceRNA / Protein Structure PredictionChou–Fasman method: The Chou–Fasman method are an empirical technique for the prediction of secondary structures in proteins, originally developed in the 1970s.Nussinov Algorithm: Nussinov algorithm is an algorithm to predict possible RNA secondary structure (folding), discovering parts that have complementary sequences. Example Of Nussinov Algorithm.Kabsch algorithm: calculate the optimal alignment of two sets of points in order to compute the root mean squared deviation between two protein structures.StatisticsMarkov ModelsMarkov ChainsHidden Markov modelBaum–Welch algorithm: compute maximum likelihood estimates and posterior mode estimates for the parameters of a hidden markov modelForward-backward algorithm a dynamic programming algorithm for computing the probability of a particular observation sequenceViterbi algorithm: find the most likely sequence of hidden states in a hidden markov modelOptimization AlgorithmsEvolutionary computation: optimization inspired by biological mechanisms of evolutionSimulated annealingMachine Learning And Statistical ClassificationUPGMA: UPGMA (Unweighted Pair Group Method with Arithmetic Mean) is a simple agglomerative or hierarchical clustering method used in bioinformatics for the creation of phenetic trees (phenograms). Neighbor Joining: In bioinformatics, neighbor joining is a bottom-up clustering method for the creation of phenetic trees (phenograms), created by Naruya Saitou and Masatoshi Nei.
Category: Algorithms | Views: 13813 | Added by: Ansari | Rating: 0.0/0
 Total comments: 0
Name *:
Email *:
Code *:
 Log In
 Search
Calendar
 «  August 2011  » Su Mo Tu We Th Fr Sa 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
 Entries archive
 Site friends
 Copyright MyCorp © 2019 Free website builder — uCoz