Bıyıkoğlu, Türker

Profile URL
https://hdl.handle.net/11147/16154
Name Variants
Bıyıkoğlu, T̈urker
Biyikoğlu, Türker
Biyikoglu, T. ürker
Biyikoglu, Turker
Biyikoglu, T.
Biyikoglu, T
Bıyıkoğlu, T.
Bıyıkoğlu, T
Biyikog̃lu, Türker
Biyikoǧlu, T̈urker
Biyikoǧlu, Türker
Job Title
Email Address
Main Affiliation
04.02. Department of Mathematics
Status
Former Staff
Website
ORCID ID
Scopus Author ID
55986041800
Turkish CoHE Profile ID
Google Scholar ID
jpUHb10AAAAJ
WoS Researcher ID

Sustainable Development Goals

SDG data is not available
Documents

28

Citations

819

h-index

13

Go to Scopus profile
This researcher does not have a WoS ID.
Scholarly Output

3

Articles

2

Views / Downloads

2224/1214

Supervised MSc Theses

0

Supervised PhD Theses

0

WoS Citation Count

36

Scopus Citation Count

45

Patents

0

Projects

2

WoS Citations per Publication

12.00

Scopus Citations per Publication

15.00

Open Access Source

2

Supervised Theses

0

JournalCount
Bioinformatics1
IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications1
Current Page: 1 / 1

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

2013 - 20143

Settings

search.filters.applied.f.isAuthorOfPublication: search.filters.isAuthorOfPublication.d12e7431-aa39-4676-b302-b43958f1bcef

Scholarly Output Search Results

Now showing 1 - 3 of 3
  • Article
    Citation - WoS: 15
    Citation - Scopus: 19
    Campways: Constrained Alignment Framework for the Comparative Analysis of a Pair of Metabolic Pathways
    (Oxford University Press, 2013) Abaka, Gamze; Bıyıkoğlu, Türker; Erten, Cesim
    Motivation: Given a pair of metabolic pathways, an alignment of the pathways corresponds to a mapping between similar substructures of the pair. Successful alignments may provide useful applications in phylogenetic tree reconstruction, drug design and overall may enhance our understanding of cellular metabolism.Results: We consider the problem of providing one-to-many alignments of reactions in a pair of metabolic pathways. We first provide a constrained alignment framework applicable to the problem. We show that the constrained alignment problem even in a primitive setting is computationally intractable, which justifies efforts for designing efficient heuristics. We present our Constrained Alignment of Metabolic Pathways (CAMPways) algorithm designed for this purpose. Through extensive experiments involving a large pathway database, we demonstrate that when compared with a state-of-the-art alternative, the CAMPways algorithm provides better alignment results on metabolic networks as far as measures based on same-pathway inclusion and biochemical significance are concerned. The execution speed of our algorithm constitutes yet another important improvement over alternative algorithms. © The Author 2013.
  • Conference Object
    Citation - WoS: 1
    Citation - Scopus: 1
    Enabling Cooperation, Resource Allocation and Receiver Selection Across Cells: Complementary Fractional Frequency Reuse
    (Institute of Electrical and Electronics Engineers Inc., 2013) Bakşi, Saygın; Kaya, Onur; Bıyıkoğlu, Türker
    For a multi-cell multiple access channel, we develop a comprehensive cooperative communication framework: we propose a novel complementary fractional frequency reuse (FFR) strategy tailored specifically for pairwise user cooperation, also taking into account cell sectoring. This strategy allows the cell edge users not only to pool their resources and cooperate across cells, but also to choose the best receiver. We divide the users into cooperating inner and outer user pairs, and assign each pair orthogonal resources using OFDMA. We employ pairwise bidirectional cooperation based on block Markov superposition encoding among user pairs. We derive the achievable rates, while taking into account the geometry dependent interference at the users and the receiver. We find the jointly optimal power allocation, partner selection and receiver selection strategies that maximize the sum rate of the system. We then propose a heuristic matching algorithm, which operates based only on user and receiver locations. We compare the performance of our proposed strategies with several non-cooperative models, and demonstrate that the sum rate can nearly be doubled, while using the same resources. © 2013 IEEE.
  • Article
    Citation - WoS: 20
    Citation - Scopus: 25
    Vertex-Decomposable Graphs, Codismantlability, Cohen-Macaulayness, and Castelnuoco-Mumford Regularity
    (Electronic Journal of Combinatorics, 2014) Biyikoglu, Turker; Civan, Yusuf
    We call a vertex x of a graph G = (V, E) a codominated vertex if N-G[y] subset of N-G[x] for some vertex y is an element of V \{x}, and a graph G is called codismantlable if either it is an edgeless graph or it contains a codominated vertex x such that G - x is codismantlable. We show that (C-4, C-5)-free vertex-decomposable graphs are codismantlable, and prove that if G is a (C-4, C-5, C-7)-free well-covered graph, then vertex-decomposability, codismantlability and Cohen-Macaulayness for G are all equivalent. These results complement and unify many of the earlier results on bipartite, chordal and very well-covered graphs. We also study the Castelnuovo-Mumford regularity reg(G) of such graphs, and show that reg(G) = im(G) whenever G is a (C-4, C-5)-free vertex-decomposable graph, where im(G) is the induced matching number of G. Furthermore, we prove that H must be a codismantlable graph if im(H) = reg(H) = m(H), where m(H) is the matching number of H. We further describe an operation on digraphs that creates a vertex-decomposable and codismantlable graph from any acyclic digraph. By way of application, we provide an infinite family H-n (n >= 4) of sequentially Cohen-Macaulay graphs whose vertex cover numbers are half of their orders, while containing no vertex of degree-one such that they are vertex-decomposable, and reg(H-n) = im(H-n) if n >= 6. This answers a recent question of Mahmoudi, et al [12].