Presentation is loading. Please wait.

Presentation is loading. Please wait.

Segment Alignment (SEA) Yuzhen Ye Adam Godzik The Burnham Institute.

Published bySage Bradwell Modified over 10 years ago

Similar presentations

Presentation on theme: "Segment Alignment (SEA) Yuzhen Ye Adam Godzik The Burnham Institute."— Presentation transcript:

1 Segment Alignment (SEA) Yuzhen Ye Adam Godzik The Burnham Institute

2 Outline A new look at the local structure prediction Network matching problem Practical issues Applications

3 GSDKKGNGVALMTTLFADN EEEEEE HHHHHHHHHHHHHH EEEEEE LLHHHHHHHHLLL LHHHHHLLLL LLLEEEEEEEEE LLLLL Description of local structure one or many answers? GSDKKGNGVALMTTLFADN LLHHHHHHHHLLLEEEEEE A prediction HHHHHHHHLLLLLHHHHHH Real structure

4 Motivation A natural description of local structures: keep the segment information of local structures Keep uncertainties in local structure predictions: drawbacks of prediction programs and intrinsic uncertainties of local structures in absence of global interactions Incorporating the protein local structure in protein sequence comparison may help to detect the distant homologies and to improve their alignments (for homology modeling)

5 Proteins are described as a network of PLSSs (predicted local structure segments)

6 Protein comparison problem is equivalent to a network matching problem Given two networks of PLSSs, find two optimal paths from the source to the sink in each of the networks, whose corresponding PLSSs are most similar to each other. It does not follow the typical position-by-position alignment mode

7 Solving the network matching problem: dynamic programming V(i,j) i j V(i 1,j 1 ) V(i 1,j 2 ) V(i 3,j 1 ) V(i 3,j 2 ) (i-1) 1 i1i1  3 2 1 2 4 (i-1) 3, (i-1) 4 i2i2

8 Example: (1e68A,1nkl) Each protein is represented as a collection of potentially overlapping and contradictory PLSSs (a network). SEA finds an optimal alignment between these two proteins Simultaneously, SEA identifies the optimal subset of PLSSs (a path in the network) describing each protein. 1e68A: Bacteriocin As-48 1nkl : Nk-lysin

9 General performance of SEA incorporating different local structure diversities

10 Keeping local structure diversity helps improve alignment quality alignment between -repressor from E.coli (1lliA) and 434 repressor (1r69)

11 Stable region Variable region Local structure information is crucial for improving alignments, especially in the more divergent regions 1esfA: straphylococcal enterotoxin 2tssA: toxic shock syndrome toxin-1

12 Practical issue: local structural prediction Searching I-site database (web-server or standalone program) Our solution: FragLib –using sensitive profile-profile alignment program FFAS to predict local structures

13 Applications Distant homology detection Local structure prediction Improving alignments for protein modeling

14 Reference A segment alignment approach to protein comparison (Bioinformatics, April issue) Web server http://ffas.ljcrf.edu/sea

15 Related work Spliced sequence alignment –Gelfand et al., 1996, PNAS; Novichkov et al., 2001 –Assembling genes from alternative exons Jumping alignment –Spang R, Rehmsmeier M, Stoye J. JCB, 2002 –Computes a local alignment of a single sequence and a multiple alignment –The sequence is at each position aligned to one sequence of the multiple alignment (reference sequence) instead of a profile Partial order alignment –Lee C, Grasso C, Sharlow MF, Bioinformatics, 2002 –Multiple alignment

16 Acknowledgements Dariusz Plewczyński Iddo Friedberg Łukasz Jaroszewski Weizhong Li This project is supported by SPAM grant GM63208

Download ppt "Segment Alignment (SEA) Yuzhen Ye Adam Godzik The Burnham Institute."

Similar presentations

Gene Prediction: Similarity-Based Approaches

Gene Prediction: Similarity-Based Approaches
Unravelling the biochemical reaction kinetics from time-series data Santiago Schnell Indiana University School of Informatics and Biocomplexity Institute.

Unravelling the biochemical reaction kinetics from time-series data Santiago Schnell Indiana University School of Informatics and Biocomplexity Institute.
Bioinformatics (4) Sequence Analysis. figure NA1: Common & simple DNA2: the last 5000 generations Sequence Similarity and Homology.

Bioinformatics (4) Sequence Analysis. figure NA1: Common & simple DNA2: the last 5000 generations Sequence Similarity and Homology.
Blast to Psi-Blast Blast makes use of Scoring Matrix derived from large number of proteins. What if you want to find homologs based upon a specific gene.

Blast to Psi-Blast Blast makes use of Scoring Matrix derived from large number of proteins. What if you want to find homologs based upon a specific gene.
1 Applications of Dynamic Programming zTo sequence analysis Shotgun sequence assembly Multiple alignments Dispersed & tandem repeats Bird song alignments.

1 Applications of Dynamic Programming zTo sequence analysis Shotgun sequence assembly Multiple alignments Dispersed & tandem repeats Bird song alignments.
Alignment methods Introduction to global and local sequence alignment methods Global : Needleman-Wunch Local : Smith-Waterman Database Search BLAST FASTA.

Alignment methods Introduction to global and local sequence alignment methods Global : Needleman-Wunch Local : Smith-Waterman Database Search BLAST FASTA.
Profile Hidden Markov Models Bioinformatics Fall-2004 Dr Webb Miller and Dr Claude Depamphilis Dhiraj Joshi Department of Computer Science and Engineering.

Profile Hidden Markov Models Bioinformatics Fall-2004 Dr Webb Miller and Dr Claude Depamphilis Dhiraj Joshi Department of Computer Science and Engineering.
Hidden Markov models for detecting remote protein homologies Kevin Karplus, Christian Barrett, Richard Hughey Georgia Hadjicharalambous.

Hidden Markov models for detecting remote protein homologies Kevin Karplus, Christian Barrett, Richard Hughey Georgia Hadjicharalambous.
15-20 september WABI031 A Method to Detect Gene Structure and Alternative Splice Sites by Agreeing ESTs to a Genomic Sequence Paola Bonizzoni Graziano.

15-20 september WABI031 A Method to Detect Gene Structure and Alternative Splice Sites by Agreeing ESTs to a Genomic Sequence Paola Bonizzoni Graziano.
Introduction to Bioinformatics

Introduction to Bioinformatics
1 Computational Molecular Biology MPI for Molecular Genetics DNA sequence analysis Gene prediction Gene prediction methods Gene indices Mapping cDNA on.

1 Computational Molecular Biology MPI for Molecular Genetics DNA sequence analysis Gene prediction Gene prediction methods Gene indices Mapping cDNA on.
Gene Prediction: Similarity-Based Approaches (selected from Jones/Pevzner lecture notes)

Gene Prediction: Similarity-Based Approaches (selected from Jones/Pevzner lecture notes)
Structural bioinformatics

Structural bioinformatics
Clustered alignments of gene- expression time series data Adam A. Smith, Aaron Vollrath, Cristopher A. Bradfield and Mark Craven Department of Biosatatistics.

Clustered alignments of gene- expression time series data Adam A. Smith, Aaron Vollrath, Cristopher A. Bradfield and Mark Craven Department of Biosatatistics.
HMM Sampling and Applications to Gene Finding and Alignment European Conference on Computational Biology 2003 Simon Cawley * and Lior Pachter + and thanks.

HMM Sampling and Applications to Gene Finding and Alignment European Conference on Computational Biology 2003 Simon Cawley * and Lior Pachter + and thanks.
Sequence Similarity Searching 75321 Class 4 March 2010.

Sequence Similarity Searching Class 4 March 2010.
1 Gene Finding Charles Yan. 2 Gene Finding Genomes of many organisms have been sequenced. We need to translate the raw sequences into knowledge. Where.

1 Gene Finding Charles Yan. 2 Gene Finding Genomes of many organisms have been sequenced. We need to translate the raw sequences into knowledge. Where.
Expect value Expect value (E-value) Expected number of hits, of equivalent or better score, found by random chance in a database of the size.

Expect value Expect value (E-value) Expected number of hits, of equivalent or better score, found by random chance in a database of the size.
Gene Finding Charles Yan.

Gene Finding Charles Yan.
Comparative ab initio prediction of gene structures using pair HMMs

Comparative ab initio prediction of gene structures using pair HMMs

Similar presentations

Ads by Google