lecture8_S2009

# lecture8_S2009 - 18.417 Introduction to Computational...

This preview shows pages 1–10. Sign up to view the full content.

18.417: Introduction to Computational Structural Biology Evolution of RNA sequences Jerome Waldispuhl Department of Mathematics, MIT

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Principles Figure from (Cowperthwaite&Meyers,2007) Central assumptions: • The structure of a sequence is only determined by its (minimum) free energy. •The structure determines the function. •Evolution tends to preserve and optimize the function.
Sequence evolution Figure from (Gobel,2000) For short sequences, the set of evolutionary operations can be restricted to: • Insertion • Insertion/Deletion • Mutation We also limit their effect to single nucleotides.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Modeling the mutation landscape Figure from (Gobel,2000) When the length of the sequence is fixed, the set of operations can be restricted to mutations. The mutation landscape is represented with Hamming graphs, where nodes are the sequences and edges connect sequences differing from one single nucleotide (i.e. 1 mutation).
Fitness model Figure from (Cowperthwaite&Meyers,2007) Objective: Evaluate the dynamic of the evolution of shapes. Requirement: a metric to compare a predicted structure and a target shape. Models: • simple: The predicted structure is the m.f.e. structure. • plastic: Suboptimal structures can be considered.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Structure comparison Hamming distance: Base pair distance: Figure from (Schuster&Stadler,2007) Base pair distance is the standard. It corresponds to the number of base pairs we have to remove and add to obtain one structure from the other. Both metrics have to be applied on structures of equal length.
Neutral network Figure from (Cowperthwaite&Meyers,2007) • A structure is associated to each node (sequence) of the Hamming graph. • Nodes connected and labeled with the same structure form a neutral network. • Introduced by P.Schuster and Vienna group in 1992. Genotype network Phenotype network

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Compatible mutations and structures Figure from (Gobel,2000) • Mutations in neutral networks must conserve the phenotype. • But it is hard to decide if a mutation conserve the m.f.e. structure and hence the phenotype. • The networks have been explored through simulations. • The number of acceptable structures can be recursively computed: Hairpin minimum length ± required and length of stacks bounded ² .
Role of neutral networks Figure from (Gobel,2000) • Evolution tends to select mutations improving the structure.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern