Variable Neighborhood Search for Partitioning Sparse Biological Networks into the Maximum Edge-Weighted $k$k-Plexes.
Milana GrbicAleksandar KarteljSavka JankovicDragan MaticVladimir FilipovicPublished in: IEEE ACM Trans. Comput. Biol. Bioinform. (2020)
Keyphrases
- biological networks
- variable neighborhood search
- weighted graph
- metaheuristic
- minimum spanning tree
- tabu search
- biological data
- complex networks
- gene expression
- biological systems
- link prediction
- traveling salesman problem
- hybrid method
- graph mining
- heuristic methods
- routing problem
- single machine scheduling problem
- network analysis
- edge weights
- undirected graph
- vehicle routing problem
- simulated annealing
- community detection
- spanning tree
- high dimensional
- protein protein interactions
- search procedure
- pattern mining
- social network analysis
- benchmark instances
- objective function
- community structure
- combinatorial optimization
- microarray
- graph model
- machine learning
- feature space
- wireless networks
- shortest path
- supervised learning