Novel Models and Efficient Algorithms for Network-based Optimization in Biomedical Applications
We introduce and study a novel graph optimization problem to search for multiple cliques with the maximum overall weight, to which we denote as the Maximum Weighted Multiple Clique Problem (MWMCP). This problem arises in research involving network-based data mining, specifically, in bioinformatics w...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Scholar Commons
2014
|
| Subjects: | |
| Online Access: | https://scholarcommons.usf.edu/etd/5300 https://scholarcommons.usf.edu/cgi/viewcontent.cgi?article=6496&context=etd |