Download presentation

Presentation is loading. Please wait.

Published byMeryl Wiggins Modified over 3 years ago

1
Avrilia Floratou, Sandeep Tata, and Jignesh M. Patel ICDE 2010 Efficient and Accurate Discovery of Patterns in Sequence Datasets

2
Outline Motivation A powerful new model FLAME(FLexible and Accurate Motif Detector) algorithm Experimental Results Conclusion 2010/5/27 2

3
Motivation Existing sequence mining algorithms mostly focus on mining for subsequences(non-contiguous). For instance, assume that a sequence is “a, b, a, c, b, a, c”, the sequence “a, b, b, c” is a subsequence constructed by choosing the 1 st, 2 nd, 5 th, and 7 th. “Are there any frequently recurring patterns in this time series dataset?” The recurring subsequences are similar, but not identical. It allow for some noise. Approximate subsequence mining problem.(contiguous) 2010/5/27 3

4
(Cont.) 2010/5/27 4 Computational biology To detect short sequences, usually of length 6-15, that occur frequently in a given set of DNA or protein sequences. We call these frequently occurring patterns as motifs. Goal To present a new model for approximate motif mining in many different domains. To present FLAME algorithm to efficiently find motifs that satisfy these model.

5
The model 2010/5/27 5 (L, M, s, k) model L is the length of the motif. M is a distance matrix that is used to compute the similarity between two strings. s is the maximum distance threshold within which two strings are considered similar. k is the min_sup. If at least k strings T 1,…, T k in the DB each of them is length L, and d(S,T i ) s, where is a distance function. Then, a string S is an (L, M, s, k) motif.

6
(Cont.) 2010/5/27 6 Protein motif mining Some amino acids are very similar to each other, while some are very different. Because Alanine and Valine are both hydrophobic, the matrix can be used to award a small penalty for M(X,Y) when X and Y are similar. When Alanine is matched to Glycine, the large penalty is awarded. Because Glycine is a hydrophilic amino acid. (L, d, k) model (L, f, d, k) model

7
(L, d, k) model 2010/5/27 7 (L, d, k) model is a mismatch based model for finding DNA motifs. The distance measure between two strings is the Hamming distance, M(X,Y)=1 if X Y and M(X,Y)=0 if X=Y The signature is usually a short string of DNA 6-15 bases long. These signatures are seldom identical and differ in a few positions. For instance {ABCD, ACCD, ABCA} if ABCD is the model sequence, the other two sequences are within one mismatch of the motif, so these sequences would constitute a (4,1,3) motif.

8
(L, f, d, k) model 2010/5/27 8 This model builds on the (L, d, k) model to include positional constraints on the mismatches. To specify the number of fixed-position mismatches. {ABCD, ACCD, ADCD}, this set forms a (4,1,3) motif, but the mismatches, whenever they occur, are always in position two (AcCD, AdCD). The advantage of this model Consider a DNA DB consisting of 5 sequences, each of length 500. Assume that each sequence has in it the motif GTGAACAC, and each instance of the motif has a mismatch at the fifth position. ( 8,1,0,5) motif or (8,1,5) motif Use the (L, d, k) model to retrieve the pattern, we will end up with many extraneous hits that might not be meningful.

9
FLAME algorithm 2010/5/27 9 It first construct a data suffix tree and model suffix tree. To traversing the nodes of the model space in depth first order. Using two subroutines Evaluate_support: to compute the list of matches and the support. Expand_Matches: to ensure that the number of mismatches to the model string does not exceed d.

10
(Cont.) 2010/5/27 10 The data suffix tree: The model suffix tree: On the set of all possible model srtings. To help guide the exploration of the model space in a way that avoids redundant work.

11
(Cont.)the strategy of pruning the model suffix tree 2010/5/27 11 Assume that the dataset consists of sequences over the alphabet {A, B, C, D, E} All the strings of length L starting with the symbol A form a subset of the model space. A AEADACABAA … …

12
(Cont.) 2010/5/27 12 No mismatches are allowed. A AEADACABAA … …

13
(Cont.) 2010/5/27 13 As mismatches are allowed. A AEADACABAA … … B

14
Experimental results 2010/5/27 14

15
(Cont.) 2010/5/27 15

16
Conclusion 2010/5/27 16 This paper presented a powerful new model: (L, M, s, k) It also presented FLAME to find (L, M, s, k) motifs

Similar presentations

OK

1 Inverted Matrix: Efficient Discovery of Frequent Items in Large Datasets in the Context of Interactive Mining -SIGKDD’03 Mohammad El-Hajj, Osmar R. Zaïane.

1 Inverted Matrix: Efficient Discovery of Frequent Items in Large Datasets in the Context of Interactive Mining -SIGKDD’03 Mohammad El-Hajj, Osmar R. Zaïane.

© 2018 SlidePlayer.com Inc.

All rights reserved.

To ensure the functioning of the site, we use **cookies**. We share information about your activities on the site with our partners and Google partners: social networks and companies engaged in advertising and web analytics. For more information, see the Privacy Policy and Google Privacy & Terms.
Your consent to our cookies if you continue to use this website.

Ads by Google

Ovary anatomy and physiology ppt on cells Ppt on agriculture in punjab Ppt on pricing policy of htc Ppt on do's and don'ts of group discussions Ppt on ancient number system for class 9 Electronic paper display ppt on tv Marketing mix ppt on nokia Ppt on writing book reviews Ppt on cloud storage Interactive ppt on classification