Saribatir, Behçet Melih

Profile Picture
Profile URL
https://gcris.yasar.edu.tr/handle/123456789/12694
Name Variants
Job Title
Dr.Öğr.Üyesi
Email Address
Main Affiliation
01.01.09.01. Bilgisayar Mühendisliği Bölümü
Status
Former Staff
Website
ORCID ID
Scopus Author ID
6508176126
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

SDG data is not available
Scopus data could not be loaded because of an error. Please refresh the page or try again later.
This researcher does not have a WoS ID.
Scholarly Output

2

Articles

0

Views / Downloads

0/0

Supervised MSc Theses

0

Supervised PhD Theses

0

WoS Citation Count

0

Scopus Citation Count

1

Patents

0

Projects

0

WoS Citations per Publication

0.00

Scopus Citations per Publication

0.50

Open Access Source

0

Supervised Theses

0

JournalCount
3rd International Informatics and Software Engineering Conference IISEC 20222
Current Page: 1 / 1

Scopus Quartile Distribution

Quartile distribution chart data is not available

Competency Cloud

GCRIS Competency Cloud

Filters

20222
Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 1
    A Parallel Network Alignment Algorithm for Biological Networks
    (Institute of Electrical and Electronics Engineers Inc., 2022) Behcet Melih Saribatir; Kayhan Erciyeş; Erciyes, Kayhan; Saribatir, Behcet Melih; A. Varol , M. Karabatak , C. Varol
    We propose a new parallel algorithm based on a distributed matching algorithm for the network alignment problem which can be used to find similarities in biological networks. This information may be used to form phylogenetic trees and consequently understand the evolution process better. We provide preliminary implementation results in sample networks which provide significant speedups with respect to sequential algorithms. © 2023 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    Conference Object
    Parallel Connectivity Algorithms
    (Institute of Electrical and Electronics Engineers Inc., 2022) Kayhan Erciyeş; Behcet Melih Saribatir; Erciyes, Kayhan; Saribatir, Behcet Melih; A. Varol , M. Karabatak , C. Varol
    We propose and implement two parallel algorithms to test the connectivity and find the connected components of a network in parallel. In both cases the connectivity matrix of the graph is partitioned to p processors. The first parallel algorithm (Alg. 2) processors test connectivity in their partitions and then cooperate to decide. The second parallel algorithm (Alg. 4) forms a labelled connectivity matrix and then partitions this matrix to processors to find the components of a disconnected graph. We show both algorithms achieve significant speedups even with only few processors. © 2023 Elsevier B.V. All rights reserved.