Asset Details
Do you wish to reserve the book?
CLIMP: Clustering Motifs via Maximal Cliques with Parallel Computing Design
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
CLIMP: Clustering Motifs via Maximal Cliques with Parallel Computing Design
Do you wish to request the book?
CLIMP: Clustering Motifs via Maximal Cliques with Parallel Computing Design
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
CLIMP: Clustering Motifs via Maximal Cliques with Parallel Computing Design
2016
Overview
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 similarity data can be represented as a large graph, where these motifs are connected to one another. However, an efficient clustering algorithm is desired for clustering the motifs that belong to the same groups and separating the motifs that belong to different groups, or even deleting an amount of spurious ones. In this work, a new motif clustering algorithm, CLIMP, is proposed by using maximal cliques and sped up by parallelizing its program. When a synthetic motif dataset from the database JASPAR, a set of putative motifs from a phylogenetic foot-printing dataset, and a set of putative motifs from a ChIP dataset are used to compare the performances of CLIMP and two other high-performance algorithms, the results demonstrate that CLIMP mostly outperforms the two algorithms on the three datasets for motif clustering, so that it can be a useful complement of the clustering procedures in some genome-wide motif prediction pipelines. CLIMP is available at http://sqzhang.cn/climp.html.
Publisher
Public Library of Science,Public Library of Science (PLoS)
Subject
/ Computational Biology - methods
/ Computer and Information Sciences
/ DNA
/ Genomes
/ Genomics
/ Insects
/ Proteins
/ Research and Analysis Methods
/ Sequence Alignment - methods
/ Sequence Alignment - statistics & numerical data
/ Sequence Analysis, DNA - methods
/ Sequence Analysis, DNA - statistics & numerical data
/ Software
