1 / 11

A Compressing Method for Genome Sequence Cluster using Sequence Alignment

A Compressing Method for Genome Sequence Cluster using Sequence Alignment. Author: Kwang Su Jung, Nam Hee Yu, Seung Jung Shin, Keun Ho Ryu Publisher: International Conference on Computer and Information Technology ICCIT 2008 Presenter: Chin-Chung Pan Date: 2010/10/27. Outline. Introduction

vito
Télécharger la présentation

A Compressing Method for Genome Sequence Cluster using Sequence Alignment

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. A Compressing Method for Genome Sequence Cluster using SequenceAlignment Author: Kwang Su Jung, Nam Hee Yu, Seung Jung Shin, Keun Ho RyuPublisher: International Conference on Computer and Information Technology ICCIT 2008 Presenter: Chin-Chung Pan Date:2010/10/27

  2. Outline • Introduction • The proposed method • The representative sequence of a cluster • The sequence distance • The soring matrix • The Edit-Script, ε • Creating a member sequence from a representative sequence • Evaluation

  3. Introduction • We suggest a new compressing technique for these sequence clusters using the Smith-Waterman sequence alignment method. • We select a representative sequence which has a minimum sequence distance (the Smith-Waterman alignment score) in a cluster by scanning the distances of all sequences. • Then, only store representative sequences and Edit-Scripts for each cluster into a database.

  4. The representative sequence of a cluster

  5. The sequence distance • The Euclidean distance is widely used when calculating distance between objects in a common cluster. • In the case of a genome sequence, applying the Euclidean distance is not acceptable because sequences do not have any absolute position.

  6. The sequence distance

  7. The soring matrix

  8. The Edit-Script, ε • Starting Index is an index that starts a matched sequence in sequence Sx. • Ending Index indicates an index that ends the matched sequence Sy. • Prior MatSeq denotes a prior sequence of the matched sequence in Sy. • Posterior MatSeq describes the posterior sequence of the matched sequence in sequence Sy.

  9. The Edit-Script, ε • Focusing on Matched Sequences, there exist three kinds of events such as insertion, deletion, and substitution. • We can simply express the Edit-Script, ε = { {Prior MatSeq}, Starting Index, {operator1, operator2, operator3, … }, Ending Index, {Posterior MatSeq}. 01234567891011121314 Sequence Sx: R N M K ─ G I T A T Y L S Sequence Sy: T I M K R G I I A ─ Y L S W P 012345678910 ε={ {TI}, 2, { ins(2,R),sub(5,I), del(7,T) }, 12, {WP} }

  10. Creating a member sequence from a representative sequence • RS: Representative Sequence. • MS: Member Sequence. Change Operators MS id, RS id Database Matched Sequence of RS Matched Sequence of MS Member Sequence RS of Cluster Edit-Scripts of MS (Starting, Ending Index) Prior MatSeq Posterior MatSeq

  11. Evaluation • The size reduction was discovered when the homology (sequence identity) between sequences was over 50% for 2KB, 55% for 4KB, and 52% for 8KB.

More Related