MapReduce-Based Pattern Finding Algorithm Applied in Motif Detection for Prescription Compatibility Network

Author(s):  
Yang Liu ◽  
Xiaohong Jiang ◽  
Huajun Chen ◽  
Jun Ma ◽  
Xiangyu Zhang
2008 ◽  
Vol 4 (6) ◽  
pp. e1000090 ◽  
Author(s):  
Pradipta Ray ◽  
Suyash Shringarpure ◽  
Mladen Kolar ◽  
Eric P. Xing

Genes ◽  
2020 ◽  
Vol 11 (3) ◽  
pp. 286 ◽  
Author(s):  
Eliza C. Martin ◽  
Octavina C. A. Sukarta ◽  
Laurentiu Spiridon ◽  
Laurentiu G. Grigore ◽  
Vlad Constantinescu ◽  
...  

Leucine-rich-repeats (LRRs) belong to an archaic procaryal protein architecture that is widely involved in protein–protein interactions. In eukaryotes, LRR domains developed into key recognition modules in many innate immune receptor classes. Due to the high sequence variability imposed by recognition specificity, precise repeat delineation is often difficult especially in plant NOD-like Receptors (NLRs) notorious for showing far larger irregularities. To address this problem, we introduce here LRRpredictor, a method based on an ensemble of estimators designed to better identify LRR motifs in general but particularly adapted for handling more irregular LRR environments, thus allowing to compensate for the scarcity of structural data on NLR proteins. The extrapolation capacity tested on a set of annotated LRR domains from six immune receptor classes shows the ability of LRRpredictor to recover all previously defined specific motif consensuses and to extend the LRR motif coverage over annotated LRR domains. This analysis confirms the increased variability of LRR motifs in plant and vertebrate NLRs when compared to extracellular receptors, consistent with previous studies. Hence, LRRpredictor is able to provide novel insights into the diversification of LRR domains and a robust support for structure-informed analyses of LRRs in immune receptor functioning.


2004 ◽  
Vol 20 (11) ◽  
pp. 1815-1817 ◽  
Author(s):  
P. M. Haverty ◽  
Z. Weng

2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Christoph Schmidt ◽  
Thomas Weiss ◽  
Christian Komusiewicz ◽  
Herbert Witte ◽  
Lutz Leistritz

Network motifs, overrepresented small local connection patterns, are assumed to act as functional meaningful building blocks of a network and, therefore, received considerable attention for being useful for understanding design principles and functioning of networks. We present an extension of the original approach to network motif detection in single, directed networks without vertex labeling to the case of a sample of directed networks with pairwise different vertex labels. A characteristic feature of this approach to network motif detection is that subnetwork counts are derived from the whole sample and the statistical tests are adjusted accordingly to assign significance to the counts. The associated computations are efficient since no simulations of random networks are involved. The motifs obtained by this approach also comprise the vertex labeling and its associated information and are characteristic of the sample. Finally, we apply this approach to describe the intricate topology of a sample of vertex-labeled networks which originate from a previous EEG study, where the processing of painful intracutaneous electrical stimuli and directed interactions within the neuromatrix of pain in patients with major depression and healthy controls was investigated. We demonstrate that the presented approach yields characteristic patterns of directed interactions while preserving their important topological information and omitting less relevant interactions.


Sign in / Sign up

Export Citation Format

Share Document