NemoMap: Improved Motif-centric Network Motif Discovery Algorithm
نویسندگان
چکیده
منابع مشابه
FoldMiner: structural motif discovery using an improved superposition algorithm.
We report an unsupervised structural motif discovery algorithm, FoldMiner, which is able to detect global and local motifs in a database of proteins without the need for multiple structure or sequence alignments and without relying on prior classification of proteins into families. Motifs, which are discovered from pairwise superpositions of a query structure to a database of targets, are descr...
متن کاملAn Efficient Algorithm for String Motif Discovery
Finding common patterns, motifs, in a set of DNA sequences is an important problem in bioinformatics. One common representation of motifs is a string with symbols A, C, G, T and N where N stands for the wildcard symbol. In this paper, we introduce a more general motif discovery problem without any weaknesses of the Planted (l,d)-Motif Problem and also a set of control sequences as an additional...
متن کاملBiological sequence motif discovery using motif-x.
The Web-based motif-x program provides a simple interface to extract statistically significant motifs from large data sets, such as MS/MS post-translational modification data and groups of proteins that share a common biological function. Users upload data files and download results using common Web browsers on essentially any Web-compatible computer. Once submitted, data analyses are performed...
متن کاملDiscovering larger network motifs: Network clustering for Network Motif discovery
We want to discover larger network motifs, with more than 15 number of nodes. In order to propose an algorithm for finding larger network motifs in any biological network, we review some of models and algorithms to find network motifs. There are two types of methods, one is exact counting and the other is approximate sampling. Generalization of random graphs is another important issue to evalua...
متن کاملEfficient exact motif discovery
MOTIVATION The motif discovery problem consists of finding over-represented patterns in a collection of biosequences. It is one of the classical sequence analysis problems, but still has not been satisfactorily solved in an exact and efficient manner. This is partly due to the large number of possibilities of defining the motif search space and the notion of over-representation. Even for well-d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Science, Technology and Engineering Systems Journal
سال: 2018
ISSN: 2415-6698
DOI: 10.25046/aj030523