Basic Bioinformatics Algorithms - 12 August 2011 - BioInformatics Pakistan
Thursday, 2016-12-08, 3:12 AM
Welcome Guest | RSS

Login form

Statistics
Total online: 1
Guests: 1
Users: 0

Is Online User
Site Search
Main » 2011 » August » 12 » Basic Bioinformatics Algorithms
9:40 PM
Basic Bioinformatics Algorithms



This section contains commonly used bioinformatics algorithms.
  1. Sequence Alignment
  2. RNA / Protein Structure Prediction
    • Chou–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.
  3. Statistics
  4. Optimization Algorithms
  5. Machine Learning And Statistical Classification
    • UPGMA: 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: 12450 | Added by: Ansari | Rating: 0.0/0
Total comments: 0
Name *:
Email *:
Code *:
Tag Board
200
Your Ads
Site friends

Copyright MyCorp © 2016
Free website builderuCoz