CLIMP: Clustering Motifs via Maximal Cliques with Parallel Computing Design.
A set of conserved binding sites recognized by a transcription factor is called a motif, which can be found by many applications of comparative genomics for identifying over-represented segments. Moreover, when numerous putative motifs are predicted from a collection of genome-wide data, their simil...
Main Authors: | Shaoqiang Zhang, Yong Chen |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2016-01-01
|
Series: | PLoS ONE |
Online Access: | http://europepmc.org/articles/PMC4972426?pdf=render |
Similar Items
-
MotifClick: prediction of <it>cis</it>-regulatory binding sites via merging cliques
by: Su Zhengchang, et al.
Published: (2011-06-01) -
Sequential and parallel maximal cliques algorithms for interval graphs with applications
by: Wang, Ji Shi, et al.
Published: (1994) -
Viral quasispecies assembly via maximal clique enumeration.
by: Armin Töpfer, et al.
Published: (2014-03-01) -
Computing a Clique Tree with the Algorithm Maximal Label Search
by: Anne Berry, et al.
Published: (2017-01-01) -
On the maximal cliques in <it>c</it>-max-tolerance graphs and their application in clustering molecular sequences
by: Steigele Stephan, et al.
Published: (2006-05-01)