A scalable, parallel algorithm for maximal clique enumeration

The problem of maximal clique enumeration (MCE) is to enumerate all of the maximal cliques in a graph. Once enumerated, maximal cliques are widely used to solve problems in areas such as 3-D protein structure alignment, genome mapping, gene expression analysis, and detection of social hierarchies. E...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of parallel and distributed computing Vol. 69; no. 4; pp. 417 - 428
Main Authors:	Schmidt, Matthew C., Samatova, Nagiza F., Thomas, Kevin, Park, Byung-Hoon
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier Inc 01.04.2009 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Biological and medical sciences Biological networks Computer science; control theory; systems Computer systems and distributed systems. User interface Cray XT Dynamic load balancing Exact sciences and technology Fundamental and applied biological sciences. Psychology Gene expression High-performance computing Maximal clique enumeration Molecular and cellular biology Molecular biophysics Molecular genetics Parallel graph algorithms Software Structure in molecular biology Theoretical computing Tridimensional structure Biological networks Maximal clique enumeration High-performance computing Cray XT Dynamic load balancing Parallel graph algorithms First depth search Scalability Very large databases Distributed computing Distributed memory Backtracking Genetics Maximal graph Bioinformatics Execution time High performance Parallel algorithm Enumeration Graph clique Sequence alignment Gene expression Synchronization Distributed algorithm Genetic engineering Search tree Molecular biology Genome Protein structure Parallelization Dynamic load
ISSN:	0743-7315, 1096-0848
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!