SUMONA: A supervised method for optimizing network alignment

Date

2016-08-01

Author

TUNCAY, Erhun Giray
Can, Tolga

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

166
views

0
downloads

This study focuses on improving the multi-objective memetic algorithm for protein-protein interaction (PPI) network alignment, Optimizing Network Aligner - OptNetAlign, via integration with other existing network alignment methods such as SPINAL, NETAL and HubAlign. The output of this algorithm is an elite set of aligned networks all of which are optimal with respect to multiple user-defined criteria. However, OptNetAlign is an unsupervised genetic algorithm that initiates its search with completely random solutions and it requires substantial running times to generate an elite set of solutions that have high scores with respect to the given criteria. In order to improve running time, the search space of the algorithm can be narrowed down by focusing on remarkably qualified alignments and trying to optimize the most desired criteria on a more limited set of solutions. The method presented in this study improves OptNetAlign in a supervised fashion by utilizing the alignment results of different network alignment algorithms with varyingparameters that depend upon user preferences. Therefore, the user can prioritize certain objectives upon others and achieve better running time performance while optimizing the secondary objectives.

Subject Keywords

Network alignment, Genetic algorithms, Supervised optimization

URI

https://hdl.handle.net/11511/47327

Journal

COMPUTATIONAL BIOLOGY AND CHEMISTRY

DOI

https://doi.org/10.1016/j.compbiolchem.2016.03.003

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

Estimation of partially observed multiple graph signals by learning spectrally concentrated graph kernels Turhan, Gülce; Vural, Elif; Department of Electrical and Electronics Engineering (2021-3-31) Graph models provide flexible tools for the representation and analysis of signals defined over domains such as social or sensor networks. However, in real applications data observations are often not available over the whole graph, due to practical problems such as broken sensors, connection loss, or storage problems. In this thesis, we study the problem of estimating partially observed graph signals on multiple graphs. We consider possibly multiple graph domains over which a set of signals is available wi...
Layout optimization of trusses using simulated annealing Hasançebi, Oğuzhan (2000-09-08) This paper addresses to the development of a simulated annealing (SA) based solution algorithm which is automated to achieve the simultaneous optimum design of truss type structures with respect to size, shape and topology design variables. The proposed algorithm is designed in such a way that together with applicability to practical design problems, it is also aimed at producing efficient and improved design solutions for the problems of interest. From the practicality point of view, the task is chosen as ...
Relay Selection for Efficient HARQ-IR Protocols in Relay-Assisted Multisource Multicast Networks Quoc-Tuan Vien, Quoc-Tuan Vien; Nguyen, Huan X.; Shah, Purav; Ever, Enver; Duc To, Duc To (2014-05-21) This paper investigates relay selection for reliable data transmission in relay-assisted multisource multicast networks (RMMNs) where multiple source nodes distribute information to a set of destination nodes with the assistance of multiple relay nodes. Hybrid automatic repeat request with incremental redundancy (HARQ-IR) is used and supported by either a physical-layer network coding (PNC) or an analog network coding (ANC) technique employed at the relays. By deriving efficiency metrics of the HARQ-IR prot...
Optimizations of antennas using heuristic algorithms supported by the multilevel fast multipole algorithm Önol, Can; Ergül, Özgür Salih; Department of Electrical and Electronics Engineering (2015) In this study, an optimization environment based on heuristic algorithms supported by the multilevel fast multipole algorithm (MLFMA) is presented for different antenna problems involving either excitation or geometry optimizations. The heuristic algorithms are implemented in-house by aiming more effective interactions between electromagnetic solvers and optimization algorithms, instead of black box interactions. Excitation optimizations of various array geometries for desired radiation characteristics are ...
Routing Algorithms As An Application Of Graph Theory Yıldırım, Gökberk; Özbudak, Ferruh; Department of Cryptography (2023-1-27) This paper examines routing algorithms that are generally used in various network types, such as Internet Protocol in graph-based models, to find the shortest routing path or minimum cost. The fundamental approach for calculating the shortest path between one point to another is searching a given graph, starting at the source node, and traversing adjacent nodes until the destination node is reached. The aim is to identify the shortest routing path to the destination node. This paper searches well-known rout...

Citation Formats

E. G. TUNCAY and T. Can, “SUMONA: A supervised method for optimizing network alignment,” COMPUTATIONAL BIOLOGY AND CHEMISTRY, pp. 41–51, 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47327.