SLIDER: Mining correlated motifs in protein-protein interaction networks
|
|
- Joella Allen
- 5 years ago
- Views:
Transcription
1 SLIDER: Mining correlated motifs in protein-protein interaction networks Peter Boyen, Frank Neven, Dries Van Dyck Hasselt University, Transnational University of Limburg {peter.boyen, frank.neven, Aalt D.J. van Dijk, Roeland C.H.J. van Ham Applied Bioinformatics - Plant Research International Wageningen UR Abstract Correlated motif mining (CMM) is the problem to find overrepresented pairs of patterns, called motif pairs, in interacting protein sequences. Algorithmic solutions for CMM thereby provide a computational method for predicting binding sites for protein interaction. In this paper, we adopt a motif-driven approach where the support of candidate motif pairs is evaluated in the network. We experimentally establish the superiority of the Chi-square-based support measure over other support measures. Furthermore, we obtain that CMM is an NP-hard problem for a large class of support measures (including Chi-square) and reformulate the search for correlated motifs as a combinatorial optimization problem. We then present the method SLIDER which uses local search with a neighborhood function based on sliding motifs and employs the Chi-square-based support measure. We show that SLIDER outperforms existing motif-driven CMM methods and scales to large protein-protein interaction networks. Keywords-correlated motifs; PPI networks; local search; I. INTRODUCTION Large-scale biological networks describing interactions between proteins are available now for several organisms [13]. Such data demonstrate how proteins function as part of an interaction network, but provide no insight into how interactions are encoded in protein sequences. In particular, it is unknown which part of the sequences correspond with physical interaction sites. Unfortunately, the discovery of these sites requires laborious and expensive biological experiments. In fact, it is estimated that it would take 20 years to determine all interactions types using current experimental techniques [2]. Therefore, several computational approaches have been proposed to locate binding sites by mining overrepresented pairs of patterns (called motifs) in the sequences of interacting proteins [8], [9], [10], [11], [14]. Correlated motif mining (CMM) is an approach to identify binding sites by looking for a consensus pattern in one set of proteins which interact with (almost) all proteins which contain another consensus pattern. If so, both patterns are likely to represent a part of the surface of the molecules which makes interactions possible through a physical binding. For instance, in Fig. 1 the patterns {1, A} and {2, B} represent two such correlated motifs. In particular, there is an undirected edge between two protein sequences when the first one contains motif 1 (resp., 2) and the second one motif A (resp., B). These methods can be subdivided into two classes: (i) Figure 1: Compatible binding sites {1, A} and {2, B} as correlated motifs in sequences interaction-driven [9], [10], [11]; and, (ii) motif-driven approaches [8], [14]. Interaction-driven methods mine for (quasi-)bicliques, that is, disjoint subsets of vertices for which every vertex from one set is connected to (almost) all vertices of the other set. Such subgraphs exhibit a type of all-versus-all (or most-versus-most) interaction. A motif pair representing the corresponding interaction sites is then derived from the sequence carried by the vertices. The motif-driven approach, in contrast, starts from candidate motif pairs whose support is then evaluated in the network. Although both approaches have shown to produce biologically meaningful results, the second approach has several conceptual advantages over the first: (i) motif pairs are mined directly, not derived; (ii) all proteins containing one of the motifs, and not a subset, are taken into account; (iii) if the interactions between two sets of proteins is a consequence of multiple compatible binding sites, such as {1, A} and {2, B} in Fig. 1, the interaction-driven method necessarily merges them into one motif pair; and, (iv) all interactions of proteins having both binding sites described by the motif pair are taken into account, i.e., the subsets containing each motif do not have to be disjoint. In this article, we study different aspects of the motifdriven approach towards CMM for which currently only two techniques have been introduced and implemented. Unfortunately, both methods differ not only in the mining method but also in the used notion of support for correlated motifs. The first method by Tan et al. [14], called D-STAR, uses a χ 2 -based scoring function to determine the support but the underlying mining method does not scale to networks containing more than 250 proteins. As contemporary biological networks contain up to thousands proteins (for instance the protein-protein interaction networks of yeast and human [4]), scalability is an increasingly important issue. The second method called MotifHeuristics employs a different, probabilistically motivated notion of support called p-score, is developed by Leung et al. [8] and does B A A B
2 scale to larger networks. Although the authors argue in their paper that MotifHeuristics is superior to D-STAR, it remains unclear if the latter is due to the different support measure or the underlying mining method. Moreover, an in-depth study of support measures as such has never been undertaken. The contributions of this paper are: (i) a thorough empirical study of the effectiveness of various notions of support for correlated motifs; (ii) we have proven that, under reasonable assumptions concerning the used notion of support, the complexity of the correlated motif mining problem is NP-hard and its associated decision problem is in NP. We therefore approach the problem as a combinatorial optimization problem. And (iii) SLIDER, a local search method in which the key component is its neighborhood function which views a motif as a window which slides over the amino acid sequences of the proteins. We validate SLIDER by showing that it outperforms all existing motifdriven approaches on retrieving implanted motif pairs from artificial networks. Furthermore our experiments show that SLIDER is able to tackle CMM on large protein-protein interaction networks. We assume the reader is familiar with basic concepts of graph theory and computational complexity; any basic textbook in each of these areas, like [6] and [5], will supply the necessary background. We will often use the popular abbreviation biclique for a complete bipartite subgraph. II. CORRELATED MOTIF MINING PROBLEM We model a protein-protein interaction (PPI) network by an undirected labeled graph G = (V, E, λ) in which the vertices V correspond to the proteins, the edges E to the interactions and the labels of the vertices to the amino acid sequence of the proteins. Hence, the label function λ maps each vertex v V to a string λ(v) over the alphabet Σ = {A,..., Z} \ {B, J, O, U, X, Z}. An (l, d)-motif is a string of length l over the alphabet Σ {x} containing exactly d x-characters. The character x is interpreted as a wildcard-symbol, i.e., it matches with any character of Σ. For instance, GAQPRNMY matches the (8, 4)- motif GxxPxNxY. A protein contains an (l, d)-motif X if its amino acid sequence contains a substring of length l that matches X. Given an (l, d)-motif X and a PPI-network G = (V, E, λ), let V X = {v V λ(v) contains X}, be the set of proteins in the network containing the motif X, and E X,Y = {{u, v} E u V X v V Y }, be the set of interactions between proteins containing X and proteins containing Y. Hence, the subgraph G X,Y selected by a motif pair {X, Y } is G X,Y = (V X V Y, E X,Y, λ VX V Y ) with λ VX V Y the restriction of λ to V X V Y. Note that V X and V Y can share proteins. A support measure f is simply a function mapping a motif pair {X, Y } and a graph G to a positive real number f({x, Y }, G). We refer to f({x, Y }, G) as the support of {X, Y } in G. We next formulate the correlated motif pair mining problem in a PPI-network (Correlated Motif Mining, CMM): Input: a PPI-network G = (V, E, λ), three natural numbers l, d, k and a support measure f. Output: the k (l, d)-motif pairs {X 1, Y 1 },..., {X k, Y k } with highest support in G with respect to f. III. SUPPORT MEASURES Support measures should reflect the power of a motif pair to describe interactions. Several considerations should be taken into account in deciding how to measure the descriptive power of a motif pair for a given PPI-network G = (V, E, λ): (i) E X,Y should be significantly larger than expected given G, V X and V Y ; and, (ii) V X and V Y should be large enough in order to minimize the likelihood that the appearance of the motif X, respectively Y, in the sequences of the proteins in V X, respectively V Y, is just by chance. In other words, we want the motifs X and Y to truly represent an overrepresented consensus pattern in the sequences of the proteins in V X respectively V Y in order to increase the likelihood that they correspond to, or at least overlap with, a so called binding site a part of the molecule on the surface that makes interactions between proteins from V X and V Y possible through a molecular lock-and-key mechanism. We call a motif pair {X, Y } complete if each protein from V X interacts with each protein from V Y. A. A χ 2 -based support measure Tan et al. [14] introduced the χ 2 -score for statistical significance as a support measure for CMM: f χ 2({X, Y }, G) = { ( EX,Y E X,Y ) 2 E X,Y if E X,Y > E X,Y 0 if E X,Y E X,Y with E X,Y the expected number of interactions between V X and V Y, which is calculated by assuming a uniform density of edges. To that end, let ed(g) = E / ( ) V 2 be the edge density of G, i.e., the proportion of edges it has of all its potential edges. Then, E X,Y = ed(g)m(v X, V Y ), with the maximum amount of edges in the subnetwork ( ( ) ) VX V Y M(V X, V Y ) = V X V Y V X V Y. 2 If we also use the edge density of the selected subnetwork ed(g X,Y ) = E X,Y /M(V X, V Y ), we can rewrite the χ 2 - support of {X, Y } for which E X,Y > E X,Y as f χ 2({X, Y }, G) = M(V X, V Y ) (ed(g X,Y ) ed(g)) 2. ed(g) As ed(g) is a constant for a fixed PPI-network, we clearly see in this form that f χ 2 uses two criteria to determine the support of a motif pair {X, Y }: (i) the difference in edge density of G X,Y and G, which rewards a larger E X,Y than
3 expected; and, (ii) the (potential) size of G X,Y in terms of the number of edges, which rewards larger V X and V Y. B. p-score: a probabilistic support measure The p-score is a measure introduced by Leung et al. [8] to evaluate the statistical significance of a motif pair {X, Y } in a PPI-network G = (V, E, λ) by estimating the conditional probability that there are E X,Y or more interactions between V X and V Y given the number of interactions involving V X and assuming a uniform distribution of interactions over all interaction partners. Motif pairs for which this probability is small are considered to be statistically significant. C. Comparison of f χ 2 and f p Comparing f p with f χ 2, a major difference is that f χ 2 bases its support on the whole network G, while f p -support uses only a small environment of the selected subnetwork. Moreover, besides the typical edge distribution assumption, f p makes implicitly the following additional assumptions: (i) V X and V Y are disjoint; and, (ii) every interaction from E X (E Y ) can be described using X (Y ), thus to calculate the support of {X, Y } each protein is assumed to have only one binding site. Finally, we stress a design flaw in the definition of f p : the approximation used becomes less precise when ed(g X,Y ) becomes larger, i.e., becomes more interesting. IV. COMPLEXITY OF CMM We can prove that CMM is NP-hard for a whole class of support measures and show at the end of the section that f χ 2 is a member of that class. We call a support measures compliant if it abides to three reasonable conditions: (i) the support can be computed efficiently; (ii) if the topology of the selected subnetworks of two motif pairs differ only in the number of edges, the one which covers more interactions has higher support; and, (iii) the support of a complete motif pair increases with the size of the selected subnetwork. We call a support measure f biclique-maximal if any complete motif {X, Y } with V X = V Y scores highest if G X,Y is a biclique and clique-maximal if the motif scores highest if it is a clique. We can show that CMM is NP-hard by proving that even a simplified version of the associated decision (D) problem is already NP-complete. Let D-CMM be the problem to decide whether for a given PPI-network G = (V, E, λ), natural numbers l, d, a real number t and a support measure f, there exists an (l, d)-motif pair {X, Y } for which f({x, Y }, G) t. Theorem 1: D-CMM is NP-complete for any clique- or biclique-maximal compliant support measure f. For the proof and a more formal treatment, we refer to [3]. It is easy to see that f χ 2 abides the conditions and is biclique-maximal. Indeed, the support for a complete motif pair {X, Y } where V X = V Y in any PPI-network G is M(V X, V Y )(1 ed(g)) 2 /ed(g), which is maximal for V X V Y = 0. RTxTxx xtxtxx xxxtxt KxxTxT RTxTxx AKKGTLKYRTITCFGKI xxxtxtxx AKKGTLKYRTITCFGKI KxxTxT Figure 2: Two neighboring (6, 3)-motifs as sliding windows on a sequence. Moving from RTxTxx to KxxTxT, shifts the window to the left. V. SLIDER Since the decision problem associated with CMM is in NP, CMM can be tackled efficiently as a search problem in the space of all possible (l, d)-motif pairs. If we add the assumption that similar motifs can be expected to get similar support, it has the typical form of a combinatorial optimization problem. A number of heuristic algorithms called meta-heuristics are known to yield good solutions to a wide variety of combinatorial optimization problems. One such meta-heuristic is local search [1]. Local search algorithms move from the current point to a neighboring point in the space of candidate solutions until a locally optimal solution is found, i.e., a solution that maximizes f in its neighborhood. This process is repeated with many initial random starting points and the best results are saved. Thus, in order to apply local search to CMM, we need to define a neighborhood function N which maps a motif pair {X, Y } to its neighbors N({X, Y }) in the space of all motif pairs. Consider a motif pair {X, Y } and the selected subnetwork G X,Y. Ideally, the subnetwork G X,Y selected by a neighbor {X, Y } N({X, Y }) should also be close to G X,Y in the sense that at least some proteins and interactions should be shared between G X,Y and G X,Y. To that end, we first define a neighbor function N slide on motifs, which will be the basis for a neighbor function on motif pairs. Looking for a match of an (l, d)-motif X in a protein can be seen as sliding a window of length l with l d holes over the sequence until the characters in the holes match the non-wildcard characters of X. Hence, a motif X obtained by closing a hole on a matching substring and creating a new one while respecting the window size l, guarantees that the same protein will contain X. In this way, we can slide the motif window to the left or right by punching the new hole before the first or after the last original character, as illustrated in Fig. 2 and formally defined next. For a motif X, denote by trim(x), the motif obtained from X by removing leading and trailing wildcards. That is, trim(xtxtxx) = TxT. A motif X N slide (X) if X and X have the same length and trim(y ) = trim(y ) where Y (resp., Y ) is obtained from X (resp., X ) by changing one non-wildcard character into a wildcard. In Fig. 2, X equals RTxTxx while X equals KxxTxT. Now, X N slide (X) as X (resp., X ) can be transformed into Y = xtxtxx (resp., Y = xxxtxt) by changing one nonwildcard character into a wildcard and Y equals Y after
4 stripping leading and trailing wildcards. Next, we define N slide for motif pairs. That is, {X, Y } N slide ({X, Y }) if X N slide (X) Y = Y or Y N slide (Y ) X = X. Note that when applying N slide to pairs of motifs, one of the motifs remains fixed. Our experiments, reported in Section 7.3, show that fixing one motif at each step greatly improves the effectiveness. We define the method SLIDER as local search with: (i) neighbor function N slide ; and, (ii) support measure f χ 2. VI. DATASETS Artificial data. To evaluate the biological relevance of the different notions of support and the power of heuristic methods to retrieve the best motif pairs in terms of describing interactions, we created a number of artificial networks as follows. Each network is composed of 100 proteins which are randomly chosen out of the well-known yeast network [4]. We then generate 50 random (8, 3)- motifs 1 and implant 3 to 10 instances of each motif in the sequences of randomly chosen proteins. Then, we implant motif pairs by randomly selecting two implanted motifs X and Y and connecting each protein containing X with each protein containing Y until a chosen minimal edge density is obtained we used 0.1, 0.2 and 0.3. Consequently, the network obtained is perfect in the sense that each interaction is a direct consequence of an implanted motif pair. Because noise and missing data are an important factor in biological networks, we also evaluate the resistance to noise of both the support measures and heuristic methods. To that end, we create diluted versions of each network, by choosing a dilution level a (from 0.05 to 0.3 in 0.05 steps) and flipping the edge relation of each pair of vertices with probability a. We restrict ourselves to networks of 100 proteins because this is more or less the maximum size for which we are still able to mine the motif pairs with highest support for each support measure by a brute force computation within a reasonable time frame. Biological data. To assess the effectiveness of SLIDER on larger networks, we ran our method on the high-confidence protein-protein interaction network of yeast [4] consisting of 1620 nodes and 9060 interactions. It is very difficult to measure the biological significance of the found correlated motifs, because only very few of them are actually known. Therefore, we executed a brute force CMM-algorithm over the yeast network on a computer cluster, finding the best correlated motifs according to f χ 2 and compared these to the results returned by SLIDER. The brute force computation occupied about 100 nodes in the cluster spanning a period of 2 weeks. Its purpose was to create a baseline for motif-driven CMM-algorithms as well as collecting the best 1 Using entropy analysis, research has shown that the highest amount of structural information per sequence length can be found in subsequences of length 7 to 9 (see Fig. 1 in [12]). correlated yeast motifs for biological analysis (which is still ongoing at this point). VII. EXPERIMENTS With the exception of the brute force run on yeast, all experiments were run on a 3GHz Mac Pro with 4GB of RAM and 8 cores. In the sequel, whenever a timing is mentioned and unless explicitly mentioned otherwise, the experiment was run using only 1 core. Nevertheless, we stress that our SLIDER-prototype, implemented in Java, can use as many processors as are available. In this section, we experimentally assess the effectiveness of (i) support measures to assign a support to a motif pair reflecting its power to describe interactions; and, (ii) neighbor functions to find the motif pairs with highest support by exploring the space of all motif pairs. Furthermore, we compare SLIDER with other motif-driven CMM-methods. To this end, we need a notion of precision that compares an ordered set of motif pairs to a set of motif pairs which is considered to be the ground truth. Finally, we assess the effectiveness of SLIDER on the yeast network. A. Precision for motif pairs We define the similarity between (l, d)-motif pairs {X, Y } and {X, Y } in a PPI-network G = (V, E, λ) as s({x, Y }, {X, Y }, G) = E X,Y pos E X,Y E X,Y E X,Y, where {v, w} E X,Y posx,y if there exists substrings s v and s v in λ(v) and substrings s w and s w in λ(w) such that s v (resp., s w ) matches with X (resp., Y ), s v (resp. s w) matches with X (resp., Y ), and, s v and s v as well as s w and s w overlap in at least l/3 positions in λ(v) respectively λ(w). Let S = {M 1,..., M n } be a list of motif pairs, then we reduce S by deleting for every j from 1 to n, every M i for i > j such that s(m i, M j ) 0.9. We denote the reduced version of S by S. Let T be a set of ground truth (l, d)-motif pairs and let S = {M 1,..., M n } be a list of (l, d)-motif pairs to be compared against T. We define the precision of S against T at rank k as the fraction of motif pairs M i in S, 1 i k for which there exists a motif pair M T in T such that s(m i, M T ) 0.9. We note that, when k = T, the precision as defined above also corresponds to the usual notion of recall. B. Evaluation of support measures Since the most describing motif pairs in real PPI-networks are unknown, we measure the ability of a support measure to assign the highest support to motif pairs on artificial networks with implanted motifs, as described in Section VI. We used a collection of networks G a e with edge density e% and dilution level a%. We compare the support measures by looking at the precision of implanted motif pairs on G a e at rank m, where m equals the number of implanted motif
5 pairs. Remark that, in this setting, recall and precision are the same. In order to make sure that the f χ 2 and f p assign a meaningful support, we also implemented two naive support measures f c and f v. The f c -support in a PPI-network G = (V, E) is simply the number of interactions covered: f c ({X, Y }, G) = E X,Y and f v ({X, Y }, G) = E X,Y M(V X, V Y ) + V X V Y. Both measures are naive in that they are independent of the interaction distribution in G. It is straightforward to show that both measures are compliant and biclique-maximal. A visual inspection of the graph in Fig. 3a already indicates that f χ 2 globally outperforms the other support measures in selecting motif pairs describing actual interactions. Indeed, at every data point, the precision of f χ 2 is the best value or very close to the best value of the four support measures considered. Moreover, comparing precision on diluted networks shows that f χ 2 is vastly more robust to noise a crucial aspect since contemporary PPI-networks still contain large amounts of both noise and missing data [16]. The results on the artificial networks with a greater density showed the same trends. Thus, we can conclude from this experimental section that f χ 2 is superior to all other support measures considered on all merits. C. Evaluation of neighborhood functions We also defined several naive neighbor functions on motif pairs, based on simple perturbations of its component motifs. Fig. 3b displays the precision of local search with each of these neighborhood functions on the implanted network of density 10%. The displayed precision is averaged over 5 local search runs. As the speed of local search is highly dependent on the chosen neighbor function, we provided each run the same amount of time (10 minutes). For the sake of completeness, we also experimented with neighborhood functions on motif pairs where both motifs can be replaced with a neighboring one (in contrast to the previous neighborhood functions where one is kept fixed). Unfortunately, the precision was never larger than 10%, independent of the level of dilution. D. Comparison with existing methods D-STAR. Tan et al. introduced the first motif-driven method for CMM: D-STAR [14]. Strictly speaking, D-STAR does not deliver (l, d)-motifs. Instead it returns two strings s X and s Y, and two sets of proteins V X and V Y together with the indices of the substring of the amino acid sequence of each protein in V X (respectively V Y ) that differs at most 2d characters from s X (respectively s Y ). As the similarity in Section 7.1 is defined in terms of positions of substrings, we can directly use the returned subsets V X and V Y to compare with implanted motifs. Every run of D-STAR on the same network produced the same result, consequently the running time of D-STAR cannot be parameterized. We used the D- STAR implementation freely available on the web. MotifHeuristics. Another method, called MotifHeuristics, proposed by [8], derives (l, d)-motifs directly within the wildcard model and introduced the probabilistically motivated f p -support measure. Because we could not obtain an implementation of MotifHeuristics, we implemented our own version based on the algorithmic description in [8]. Comparison. The graph in Fig. 3c depicts the precision of the various methods on the artificial network of density 10%. As a naive baseline, we ran the method Random, evaluating random motif pairs using f χ 2. D-STAR took 5 minutes to finish. We gave Random and SLIDER 10 minutes of computation time. In order to give our unoptimized implementation of MotifHeuristics a fair chance, we allowed it to run 30 times longer than SLIDER (that is 5 hours). The underlying reason why MotifHeuristics takes such a long time is that for every search step a number of supports has to be calculated which approaches the total number of motifs. The graph makes it quite apparent that the success rates of both D-STAR and MotifHeuristics are smaller than or equal to that of SLIDER. Overall, SLIDER is more effective and more robust than its competitors. All algorithms perform significantly better than random search. When we double the execution time of SLIDER to 20 minutes, the precision increases significantly. The latter execution time is still minor in comparison with the brute force computation which takes about 40 hours. E. Biological validation Next, we assess the effectiveness of SLIDER on the yeast network. We did not try MotifHeuristics as it already takes a long time on networks of modest size (cf. Section 7.4). Furthermore, although D-STAR terminated on our artificial networks within 5 minutes, the method does not scale to larger networks. In particular, Leung et al. [8] mention an experiment where they executed D-STAR on the yeast network and it did not finish in 5 days, we ourselves have run D-STAR on this network for 48 hours without result. We ran SLIDER for 20 minutes exploiting all 8 cores of the Mac Pro. The average precision of the best results returned by SLIDER over 5 runs, while taking the best motifs returned by the brute force computation as a baseline, is 16%. We point out that the name precision is misleading in this context as we do not compare with implanted motifs. The number implies that SLIDER succeeds in recovering no less than 160 of the 1000 best correlated motifs out of a search space of (8,3)-motif pairs after only a run of 20 minutes which is quite satisfactory. VIII. CONCLUSION At first sight the present work seems highly related to the mining of frequent patterns in sequences (as for instance in [7]). It is therefore tempting to think about a method which
6 precision x2 c v p precision Slide LCandS SimpleSlide LCandSA LCorSA precision Slider20min Slider10min MotifHeuristics DStar Random dilution (a) Support measures dilution (b) Neighborhood functions Figure 3: Precision on artificial networks with implanted motifs of density 10%. first mines frequent motifs from protein sequences which are then paired together in a second step serving as candidates for high scoring correlated motifs. An examination of the top correlated motifs in yeast, however, reveals that each of the participating motifs occur only in 3 to 10 motifs, whereas highly frequent motifs in yeast occur in up to 60 proteins. Therefore, mining correlated motifs is very different from mining frequent motifs. Van Dijk et al. [15] showed how motifs generated by D- STAR can be used to predict transcription factor interaction on small networks. Using SLIDER rather than D-STAR, the same methodology can be applied to larger networks. Finally, we mention that we could not confirm the claimed superiority in [8] of MotifHeuristics over D-STAR. In fact, our results clearly show that f p is inferior to f χ 2 in recovering implanted motifs. These tests should be repeated on real world data, but as long as only few biological correlated motifs are known this is not possible. ACKNOWLEDGMENT Research funded by a Ph.D grant of the Institute for the Promotion of Innovation through Science and Technology in Flanders (IWT-Vlaanderen). This work was supported by the BioRange programme (SP 2.3.1) of the Netherlands Bioinformatics Centre (NBIC), which is supported through the Netherlands Genomics Initiative (NGI). REFERENCES [1] E. Aarts and J. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley & Sons, [2] P. Aloy and R. Russell. Ten thousand interactions for the molecular biologist. Nat Biotechnol., 22: , [3] P. Boyen, A. van Dijk, D. Van Dyck, R. van Ham, and F. Neven SLIDER: Mining correlated motifs in protein-protein interaction networks Technical report, Database and Theoretical Computer Sciences Research Group, Hasselt University, [4] S. Collins et al. Towards a comprehensive atlas of the physical interactome of saccharomyces cerevisiae. Mol Cell Proteomics., dilution (c) Existing methods [5] R. Diestel Graph Theory, Third edition Springer-Verlag, [6] M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness [7] K. Gouda, M. Hassaan, and M. Zaki. Prism: A primal-encoding approach for frequent sequence mining. In ICDM, pages , [8] H. Leung, M. Siu, S. Yiu, F. Chin, and K. Sung Finding linear motif pairs from protein interaction networks: A probabilistic approach. In Computational Systems Bioinformatics (CSB), pg , [9] H. Li, J. Li, and L. Wong. Discovering motif pairs at interaction sites from protein sequences on a proteome-wide scale. Bioinformatics, 22(8): , [10] J. Li, G. Liu, H. Li, and L. Wong. Maximal biclique subgraphs and closed pattern pairs of the adjacency matrix: A one-to-one correspondence and mining algorithms. IEEE Trans. Knowl. Data Eng., 19(12): , [11] J. Li, K. Sim, G. Liu, and L. Wong. Maximal quasi-bicliques with balanced noise tolerance: Concepts and co-clustering applications. In SDM, pages SIAM, [12] M. Šikić, S. Tomić, and K. Vlahoviček. Prediction of proteinprotein interaction sites in sequences and 3d structures by random forests. PLoS Comput Biol, 5(1):e , [13] M. Stumpf et al. Estimating the size of the human interactome. Proc Natl Acad Sci U S A, 105(19): , [14] S. Tan, W. Hugo, W. Sung, and S. Ng A correlated motif approach for finding short linear motifs from protein interaction networks. BMC Bioinformatics, 7:502+, November [15] A. van Dijk, C. ter Braak, R. Immink, G. Angenent, and R. van Ham Predicting and understanding transcription factor interactions based on sequence level determinants of combinatorial control. Bioinformatics, 24(1):26 33, [16] C. von Mering et al. Comparative assessment of large-scale data sets of protein-protein interactions. Nature, 417: , 2002.
PROTEINS form the basic building blocks of all living
IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL.???, NO.???,??? 2010 1 Mining minimal motif pair sets maximally covering interactions in a protein-protein interaction network Peter
Towards Detecting Protein Complexes from Protein Interaction Data
Towards Detecting Protein Complexes from Protein Interaction Data Pengjun Pei 1 and Aidong Zhang 1 Department of Computer Science and Engineering State University of New York at Buffalo Buffalo NY 14260,
The maximum edge biclique problem is NP-complete
The maximum edge biclique problem is NP-complete René Peeters Department of Econometrics and Operations Research Tilburg University The Netherlands April 5, 005 File No. DA5734 Running head: Maximum edge
Variable Objective Search
Variable Objective Search Sergiy Butenko, Oleksandra Yezerska, and Balabhaskar Balasundaram Abstract This paper introduces the variable objective search framework for combinatorial optimization. The method
Interaction Network Topologies
Proceedings of International Joint Conference on Neural Networks, Montreal, Canada, July 31 - August 4, 2005 Inferrng Protein-Protein Interactions Using Interaction Network Topologies Alberto Paccanarot*,
Geometric Steiner Trees
Geometric Steiner Trees From the book: Optimal Interconnection Trees in the Plane By Marcus Brazil and Martin Zachariasen Part 3: Computational Complexity and the Steiner Tree Problem Marcus Brazil 2015
hsnim: Hyper Scalable Network Inference Machine for Scale-Free Protein-Protein Interaction Networks Inference
CS 229 Project Report (TR# MSB2010) Submitted 12/10/2010 hsnim: Hyper Scalable Network Inference Machine for Scale-Free Protein-Protein Interaction Networks Inference Muhammad Shoaib Sehgal Computer Science
Protein Complex Identification by Supervised Graph Clustering
Protein Complex Identification by Supervised Graph Clustering Yanjun Qi 1, Fernanda Balem 2, Christos Faloutsos 1, Judith Klein- Seetharaman 1,2, Ziv Bar-Joseph 1 1 School of Computer Science, Carnegie
Network alignment and querying
Network biology minicourse (part 4) Algorithmic challenges in genomics Network alignment and querying Roded Sharan School of Computer Science, Tel Aviv University Multiple Species PPI Data Rapid growth
3D HP Protein Folding Problem using Ant Algorithm
3D HP Protein Folding Problem using Ant Algorithm Fidanova S. Institute of Parallel Processing BAS 25A Acad. G. Bonchev Str., 1113 Sofia, Bulgaria Phone: +359 2 979 66 42 E-mail: stefka@parallel.bas.bg
Probability and Statistics
Probability and Statistics Kristel Van Steen, PhD 2 Montefiore Institute - Systems and Modeling GIGA - Bioinformatics ULg kristel.vansteen@ulg.ac.be CHAPTER 4: IT IS ALL ABOUT DATA 4a - 1 CHAPTER 4: IT
6.047 / Computational Biology: Genomes, Networks, Evolution Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 6.047 / 6.878 Computational Biology: Genomes, etworks, Evolution Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
Algorithmische Bioinformatik WS 11/12:, by R. Krause/ K. Reinert, 14. November 2011, 12: Motif finding
Algorithmische Bioinformatik WS 11/12:, by R. Krause/ K. Reinert, 14. November 2011, 12:00 4001 Motif finding This exposition was developed by Knut Reinert and Clemens Gröpl. It is based on the following
Clairvoyant scheduling of random walks
Clairvoyant scheduling of random walks Péter Gács Boston University April 25, 2008 Péter Gács (BU) Clairvoyant demon April 25, 2008 1 / 65 Introduction The clairvoyant demon problem 2 1 Y : WAIT 0 X, Y
Heuristics for The Whitehead Minimization Problem
Heuristics for The Whitehead Minimization Problem R.M. Haralick, A.D. Miasnikov and A.G. Myasnikov November 11, 2004 Abstract In this paper we discuss several heuristic strategies which allow one to solve
34.1 Polynomial time. Abstract problems
< Day Day Up > 34.1 Polynomial time We begin our study of NP-completeness by formalizing our notion of polynomial-time solvable problems. These problems are generally regarded as tractable, but for philosophical,
COMPUTATIONAL COMPLEXITY
ATHEATICS: CONCEPTS, AND FOUNDATIONS Vol. III - Computational Complexity - Osamu Watanabe COPUTATIONAL COPLEXITY Osamu Watanabe Tokyo Institute of Technology, Tokyo, Japan Keywords: {deterministic, randomized,
On disconnected cuts and separators
On disconnected cuts and separators Takehiro Ito 1, Marcin Kamiński 2, Daniël Paulusma 3 and Dimitrios M. Thilikos 4 1 Graduate School of Information Sciences, Tohoku University, Aoba-yama 6-6-05, Sendai,
An improved approximation algorithm for the stable marriage problem with one-sided ties
Noname manuscript No. (will be inserted by the editor) An improved approximation algorithm for the stable marriage problem with one-sided ties Chien-Chung Huang Telikepalli Kavitha Received: date / Accepted:
The Complexity of Maximum. Matroid-Greedoid Intersection and. Weighted Greedoid Maximization
Department of Computer Science Series of Publications C Report C-2004-2 The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization Taneli Mielikäinen Esko Ukkonen University
Graph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
Discovering Binding Motif Pairs from Interacting Protein Groups
Discovering Binding Motif Pairs from Interacting Protein Groups Limsoon Wong Institute for Infocomm Research Singapore Copyright 2005 by Limsoon Wong Plan Motivation from biology & problem statement Recasting
Structure-Based Comparison of Biomolecules
Structure-Based Comparison of Biomolecules Benedikt Christoph Wolters Seminar Bioinformatics Algorithms RWTH AACHEN 07/17/2015 Outline 1 Introduction and Motivation Protein Structure Hierarchy Protein
Motivating the need for optimal sequence alignments...
1 Motivating the need for optimal sequence alignments... 2 3 Note that this actually combines two objectives of optimal sequence alignments: (i) use the score of the alignment o infer homology; (ii) use
Strongly chordal and chordal bipartite graphs are sandwich monotone
Strongly chordal and chordal bipartite graphs are sandwich monotone Pinar Heggernes Federico Mancini Charis Papadopoulos R. Sritharan Abstract A graph class is sandwich monotone if, for every pair of its
Frequent Pattern Mining: Exercises
Frequent Pattern Mining: Exercises Christian Borgelt School of Computer Science tto-von-guericke-university of Magdeburg Universitätsplatz 2, 39106 Magdeburg, Germany christian@borgelt.net http://www.borgelt.net/
Data Mining and Matrices
Data Mining and Matrices 08 Boolean Matrix Factorization Rainer Gemulla, Pauli Miettinen June 13, 2013 Outline 1 Warm-Up 2 What is BMF 3 BMF vs. other three-letter abbreviations 4 Binary matrices, tiles,
Efficient Approximation for Restricted Biclique Cover Problems
algorithms Article Efficient Approximation for Restricted Biclique Cover Problems Alessandro Epasto 1, *, and Eli Upfal 2 ID 1 Google Research, New York, NY 10011, USA 2 Department of Computer Science,
Ensemble Non-negative Matrix Factorization Methods for Clustering Protein-Protein Interactions
Belfield Campus Map Ensemble Non-negative Matrix Factorization Methods for Clustering Protein-Protein Interactions
Comparative Network Analysis
Comparative Network Analysis BMI/CS 776 www.biostat.wisc.edu/bmi776/ Spring 2016 Anthony Gitter gitter@biostat.wisc.edu These slides, excluding third-party material, are licensed under CC BY-NC 4.0 by
Robust Community Detection Methods with Resolution Parameter for Complex Detection in Protein Protein Interaction Networks
Robust Community Detection Methods with Resolution Parameter for Complex Detection in Protein Protein Interaction Networks Twan van Laarhoven and Elena Marchiori Institute for Computing and Information
A New Similarity Measure among Protein Sequences
A New Similarity Measure among Protein Sequences Kuen-Pin Wu, Hsin-Nan Lin, Ting-Yi Sung and Wen-Lian Hsu * Institute of Information Science Academia Sinica, Taipei 115, Taiwan Abstract Protein sequence
An Algebraic View of the Relation between Largest Common Subtrees and Smallest Common Supertrees
An Algebraic View of the Relation between Largest Common Subtrees and Smallest Common Supertrees Francesc Rosselló 1, Gabriel Valiente 2 1 Department of Mathematics and Computer Science, Research Institute
Finding Consensus Strings With Small Length Difference Between Input and Solution Strings
Finding Consensus Strings With Small Length Difference Between Input and Solution Strings Markus L. Schmid Trier University, Fachbereich IV Abteilung Informatikwissenschaften, D-54286 Trier, Germany, MSchmid@uni-trier.de
Effects of Gap Open and Gap Extension Penalties
Brigham Young University BYU ScholarsArchive All Faculty Publications 200-10-01 Effects of Gap Open and Gap Extension Penalties Hyrum Carroll hyrumcarroll@gmail.com Mark J. Clement clement@cs.byu.edu See
1.1 P, NP, and NP-complete
CSC5160: Combinatorial Optimization and Approximation Algorithms Topic: Introduction to NP-complete Problems Date: 11/01/2008 Lecturer: Lap Chi Lau Scribe: Jerry Jilin Le This lecture gives a general introduction
A Multiobjective GO based Approach to Protein Complex Detection
Available online at www.sciencedirect.com Procedia Technology 4 (2012 ) 555 560 C3IT-2012 A Multiobjective GO based Approach to Protein Complex Detection Sumanta Ray a, Moumita De b, Anirban Mukhopadhyay
COMP538: Introduction to Bayesian Networks
COMP538: Introduction to Bayesian Networks Lecture 9: Optimal Structure Learning Nevin L. Zhang lzhang@cse.ust.hk Department of Computer Science and Engineering Hong Kong University of Science and Technology
Protein function prediction via analysis of interactomes
Protein function prediction via analysis of interactomes Elena Nabieva Mona Singh Department of Computer Science & Lewis-Sigler Institute for Integrative Genomics January 22, 2008 1 Introduction Genome
Computational Tasks and Models
1 Computational Tasks and Models Overview: We assume that the reader is familiar with computing devices but may associate the notion of computation with specific incarnations of it. Our first goal is to
The minimum G c cut problem
The minimum G c cut problem Abstract In this paper we define and study the G c -cut problem. Given a complete undirected graph G = (V ; E) with V = n, edge weighted by w(v i, v j ) 0 and an undirected
Computational statistics
Computational statistics Combinatorial optimization Thierry Denœux February 2017 Thierry Denœux Computational statistics February 2017 1 / 37 Combinatorial optimization Assume we seek the maximum of f
Applying Bayesian networks in the game of Minesweeper
Applying Bayesian networks in the game of Minesweeper Marta Vomlelová Faculty of Mathematics and Physics Charles University in Prague http://kti.mff.cuni.cz/~marta/ Jiří Vomlel Institute of Information
Graph Alignment and Biological Networks
Graph Alignment and Biological Networks Johannes Berg http://www.uni-koeln.de/ berg Institute for Theoretical Physics University of Cologne Germany p.1/12 Networks in molecular biology New large-scale
Speeding up the Dreyfus-Wagner Algorithm for minimum Steiner trees
Speeding up the Dreyfus-Wagner Algorithm for minimum Steiner trees Bernhard Fuchs Center for Applied Computer Science Cologne (ZAIK) University of Cologne, Weyertal 80, 50931 Köln, Germany Walter Kern
Project in Computational Game Theory: Communities in Social Networks
Project in Computational Game Theory: Communities in Social Networks Eldad Rubinstein November 11, 2012 1 Presentation of the Original Paper 1.1 Introduction In this section I present the article [1].
Pairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events
Pairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events Massimo Franceschet Angelo Montanari Dipartimento di Matematica e Informatica, Università di Udine Via delle
P versus NP. Math 40210, Fall November 10, Math (Fall 2015) P versus NP November 10, / 9
P versus NP Math 40210, Fall 2015 November 10, 2015 Math 40210 (Fall 2015) P versus NP November 10, 2015 1 / 9 Properties of graphs A property of a graph is anything that can be described without referring
Algorithms in Bioinformatics FOUR Pairwise Sequence Alignment. Pairwise Sequence Alignment. Convention: DNA Sequences 5. Sequence Alignment
Algorithms in Bioinformatics FOUR Sami Khuri Department of Computer Science San José State University Pairwise Sequence Alignment Homology Similarity Global string alignment Local string alignment Dot
Discrete Applied Mathematics
Discrete Applied Mathematics 159 (2011) 1345 1351 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam On disconnected cuts and separators
Networks & pathways. Hedi Peterson MTAT Bioinformatics
Networks & pathways Hedi Peterson (peterson@quretec.com) MTAT.03.239 Bioinformatics 03.11.2010 Networks are graphs Nodes Edges Edges Directed, undirected, weighted Nodes Genes Proteins Metabolites Enzymes
Algorithms in Bioinformatics
Algorithms in Bioinformatics Sami Khuri Department of omputer Science San José State University San José, alifornia, USA khuri@cs.sjsu.edu www.cs.sjsu.edu/faculty/khuri Pairwise Sequence Alignment Homology
Lecture 5: Efficient PAC Learning. 1 Consistent Learning: a Bound on Sample Complexity
Universität zu Lübeck Institut für Theoretische Informatik Lecture notes on Knowledge-Based and Learning Systems by Maciej Liśkiewicz Lecture 5: Efficient PAC Learning 1 Consistent Learning: a Bound on
CS168: The Modern Algorithmic Toolbox Lecture #19: Expander Codes
CS168: The Modern Algorithmic Toolbox Lecture #19: Expander Codes Tim Roughgarden & Gregory Valiant June 1, 2016 In the first lecture of CS168, we talked about modern techniques in data storage (consistent
A Polynomial-Time Algorithm for Pliable Index Coding
1 A Polynomial-Time Algorithm for Pliable Index Coding Linqi Song and Christina Fragouli arxiv:1610.06845v [cs.it] 9 Aug 017 Abstract In pliable index coding, we consider a server with m messages and n
Structure learning in human causal induction
Structure learning in human causal induction Joshua B. Tenenbaum & Thomas L. Griffiths Department of Psychology Stanford University, Stanford, CA 94305 jbt,gruffydd @psych.stanford.edu Abstract We use
Tree Decomposition of Graphs
Tree Decomposition of Graphs Raphael Yuster Department of Mathematics University of Haifa-ORANIM Tivon 36006, Israel. e-mail: raphy@math.tau.ac.il Abstract Let H be a tree on h 2 vertices. It is shown
Algorithms Exam TIN093 /DIT602
Algorithms Exam TIN093 /DIT602 Course: Algorithms Course code: TIN 093, TIN 092 (CTH), DIT 602 (GU) Date, time: 21st October 2017, 14:00 18:00 Building: SBM Responsible teacher: Peter Damaschke, Tel. 5405
Chapter 34: NP-Completeness
Graph Algorithms - Spring 2011 Set 17. Lecturer: Huilan Chang Reference: Cormen, Leiserson, Rivest, and Stein, Introduction to Algorithms, 2nd Edition, The MIT Press. Chapter 34: NP-Completeness 2. Polynomial-time
On the Monotonicity of the String Correction Factor for Words with Mismatches
On the Monotonicity of the String Correction Factor for Words with Mismatches (extended abstract) Alberto Apostolico Georgia Tech & Univ. of Padova Cinzia Pizzi Univ. of Padova & Univ. of Helsinki Abstract.
Discriminative Direction for Kernel Classifiers
Discriminative Direction for Kernel Classifiers Polina Golland Artificial Intelligence Lab Massachusetts Institute of Technology Cambridge, MA 02139 polina@ai.mit.edu Abstract In many scientific and engineering
3 Undirected Graphical Models
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.438 Algorithms For Inference Fall 2014 3 Undirected Graphical Models In this lecture, we discuss undirected
RECOVERING NORMAL NETWORKS FROM SHORTEST INTER-TAXA DISTANCE INFORMATION
RECOVERING NORMAL NETWORKS FROM SHORTEST INTER-TAXA DISTANCE INFORMATION MAGNUS BORDEWICH, KATHARINA T. HUBER, VINCENT MOULTON, AND CHARLES SEMPLE Abstract. Phylogenetic networks are a type of leaf-labelled,
P, NP, NP-Complete, and NPhard
P, NP, NP-Complete, and NPhard Problems Zhenjiang Li 21/09/2011 Outline Algorithm time complicity P and NP problems NP-Complete and NP-Hard problems Algorithm time complicity Outline What is this course
Model Accuracy Measures
Model Accuracy Measures Master in Bioinformatics UPF 2017-2018 Eduardo Eyras Computational Genomics Pompeu Fabra University - ICREA Barcelona, Spain Variables What we can measure (attributes) Hypotheses
On improving matchings in trees, via bounded-length augmentations 1
On improving matchings in trees, via bounded-length augmentations 1 Julien Bensmail a, Valentin Garnero a, Nicolas Nisse a a Université Côte d Azur, CNRS, Inria, I3S, France Abstract Due to a classical
Bioinformatics: Network Analysis
Bioinformatics: Network Analysis Comparative Network Analysis COMP 572 (BIOS 572 / BIOE 564) - Fall 2013 Luay Nakhleh, Rice University 1 Biomolecular Network Components 2 Accumulation of Network Components
Algorithms in Bioinformatics II SS 07 ZBIT, C. Dieterich, (modified script of D. Huson), April 25,
Algorithms in Bioinformatics II SS 07 ZBIT, C. Dieterich, (modified script of D. Huson), April 25, 200707 Motif Finding This exposition is based on the following sources, which are all recommended reading:.
Gene expression microarray technology measures the expression levels of thousands of genes. Research Article
JOURNAL OF COMPUTATIONAL BIOLOGY Volume 7, Number 2, 2 # Mary Ann Liebert, Inc. Pp. 8 DOI:.89/cmb.29.52 Research Article Reducing the Computational Complexity of Information Theoretic Approaches for Reconstructing
Class Note #20. In today s class, the following four concepts were introduced: decision
Class Note #20 Date: 03/29/2006 [Overall Information] In today s class, the following four concepts were introduced: decision version of a problem, formal language, P and NP. We also discussed the relationship
The Computational Complexity of Graph Contractions I: Polynomially Solvable and NP-Complete Cases*
The Computational Complexity of Graph Contractions I: Polynomially Solvable and NP-Complete Cases* Asaf Levin Department of Statistics, The Hebrew University, Jerusalem 91905, Israel Daniel Paulusma Department
Generalized Pigeonhole Properties of Graphs and Oriented Graphs
Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER
Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies
Bulletin of Mathematical Biology manuscript No. (will be inserted by the editor) Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies Peter J. Humphries Simone
Groups of vertices and Core-periphery structure. By: Ralucca Gera, Applied math department, Naval Postgraduate School Monterey, CA, USA
Groups of vertices and Core-periphery structure By: Ralucca Gera, Applied math department, Naval Postgraduate School Monterey, CA, USA Mostly observed real networks have: Why? Heavy tail (powerlaw most
Multiple Sequence Alignment, Gunnar Klau, December 9, 2005, 17:
Multiple Sequence Alignment, Gunnar Klau, December 9, 2005, 17:50 5001 5 Multiple Sequence Alignment The first part of this exposition is based on the following sources, which are recommended reading:
Biological Networks: Comparison, Conservation, and Evolution via Relative Description Length By: Tamir Tuller & Benny Chor
Biological Networks:,, and via Relative Description Length By: Tamir Tuller & Benny Chor Presented by: Noga Grebla Content of the presentation Presenting the goals of the research Reviewing basic terms
BLAST: Target frequencies and information content Dannie Durand
Computational Genomics and Molecular Biology, Fall 2016 1 BLAST: Target frequencies and information content Dannie Durand BLAST has two components: a fast heuristic for searching for similar sequences
NP-Completeness. Andreas Klappenecker. [based on slides by Prof. Welch]
NP-Completeness Andreas Klappenecker [based on slides by Prof. Welch] 1 Prelude: Informal Discussion (Incidentally, we will never get very formal in this course) 2 Polynomial Time Algorithms Most of the
Structure and Centrality of the Largest Fully Connected Cluster in Protein-Protein Interaction Networks
22 International Conference on Environment Science and Engieering IPCEE vol.3 2(22) (22)ICSIT Press, Singapoore Structure and Centrality of the Largest Fully Connected Cluster in Protein-Protein Interaction
Lecture 14 - P v.s. NP 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) February 27, 2018 Lecture 14 - P v.s. NP 1 In this lecture we start Unit 3 on NP-hardness and approximation
Introduction to Complexity Theory
Introduction to Complexity Theory Read K & S Chapter 6. Most computational problems you will face your life are solvable (decidable). We have yet to address whether a problem is easy or hard. Complexity
Protein Structure Prediction II Lecturer: Serafim Batzoglou Scribe: Samy Hamdouche
Protein Structure Prediction II Lecturer: Serafim Batzoglou Scribe: Samy Hamdouche The molecular structure of a protein can be broken down hierarchically. The primary structure of a protein is simply its
Sparse, stable gene regulatory network recovery via convex optimization
Sparse, stable gene regulatory network recovery via convex optimization Arwen Meister June, 11 Gene regulatory networks Gene expression regulation allows cells to control protein levels in order to live
Hidden Markov Models 1
Hidden Markov Models Dinucleotide Frequency Consider all 2-mers in a sequence {AA,AC,AG,AT,CA,CC,CG,CT,GA,GC,GG,GT,TA,TC,TG,TT} Given 4 nucleotides: each with a probability of occurrence of. 4 Thus, one
arxiv: v1 [cs.ds] 2 Oct 2018
Contracting to a Longest Path in H-Free Graphs Walter Kern 1 and Daniël Paulusma 2 1 Department of Applied Mathematics, University of Twente, The Netherlands w.kern@twente.nl 2 Department of Computer Science,
Reducing storage requirements for biological sequence comparison
Bioinformatics Advance Access published July 15, 2004 Bioinfor matics Oxford University Press 2004; all rights reserved. Reducing storage requirements for biological sequence comparison Michael Roberts,
Chemoinformatics and information management. Peter Willett, University of Sheffield, UK
Chemoinformatics and information management Peter Willett, University of Sheffield, UK verview What is chemoinformatics and why is it necessary Managing structural information Typical facilities in chemoinformatics
The domination game played on unions of graphs
The domination game played on unions of graphs Paul Dorbec 1,2 Gašper Košmrlj 3 Gabriel Renault 1,2 1 Univ. Bordeaux, LaBRI, UMR5800, F-33405 Talence 2 CNRS, LaBRI, UMR5800, F-33405 Talence Email: dorbec@labri.fr,
Quantum Computation via Sparse Distributed Representation
1 Quantum Computation via Sparse Distributed Representation Gerard J. Rinkus* ABSTRACT Quantum superposition states that any physical system simultaneously exists in all of its possible states, the number
An Experimental Evaluation of Passage-Based Process Discovery
An Experimental Evaluation of Passage-Based Process Discovery H.M.W. Verbeek and W.M.P. van der Aalst Technische Universiteit Eindhoven Department of Mathematics and Computer Science P.O. Box 513, 5600
AN APPROXIMATION ALGORITHM FOR COLORING CIRCULAR-ARC GRAPHS
AN APPROXIMATION ALGORITHM FOR COLORING CIRCULAR-ARC GRAPHS Wei-Kuan Shih 1 and Wen-Lian Hsu 2 Key Words: graph, clique, coloring, matching, algorithm ABSTRACT Consider families of arcs on a circle. The
A new Evaluation of Forward Checking and its Consequences on Efficiency of Tools for Decomposition of CSPs
2008 20th IEEE International Conference on Tools with Artificial Intelligence A new Evaluation of Forward Checking and its Consequences on Efficiency of Tools for Decomposition of CSPs Philippe Jégou Samba
Lecture 1 : Probabilistic Method
IITM-CS6845: Theory Jan 04, 01 Lecturer: N.S.Narayanaswamy Lecture 1 : Probabilistic Method Scribe: R.Krithika The probabilistic method is a technique to deal with combinatorial problems by introducing
A Note on Perfect Partial Elimination
A Note on Perfect Partial Elimination Matthijs Bomhoff, Walter Kern, and Georg Still University of Twente, Faculty of Electrical Engineering, Mathematics and Computer Science, P.O. Box 217, 7500 AE Enschede,
Tree sets. Reinhard Diestel
1 Tree sets Reinhard Diestel Abstract We study an abstract notion of tree structure which generalizes treedecompositions of graphs and matroids. Unlike tree-decompositions, which are too closely linked
MACFP: Maximal Approximate Consecutive Frequent Pattern Mining under Edit Distance
MACFP: Maximal Approximate Consecutive Frequent Pattern Mining under Edit Distance Jingbo Shang, Jian Peng, Jiawei Han University of Illinois, Urbana-Champaign May 6, 2016 Presented by Jingbo Shang 2 Outline
Pattern Recognition 2
Pattern Recognition 2 KNN,, Dr. Terence Sim School of Computing National University of Singapore Outline 1 2 3 4 5 Outline 1 2 3 4 5 The Bayes Classifier is theoretically optimum. That is, prob. of error
Approximating MAX-E3LIN is NP-Hard
Approximating MAX-E3LIN is NP-Hard Evan Chen May 4, 2016 This lecture focuses on the MAX-E3LIN problem. We prove that approximating it is NP-hard by a reduction from LABEL-COVER. 1 Introducing MAX-E3LIN
The concentration of the chromatic number of random graphs
The concentration of the chromatic number of random graphs Noga Alon Michael Krivelevich Abstract We prove that for every constant δ > 0 the chromatic number of the random graph G(n, p) with p = n 1/2