Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ahmet Cetintas

dblp:98/6578 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2Databases, data management, data science and information retrieval · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › systems bioinformatics
pathway analysis
0.112006
Patikaweb: a Web interface for analyzing biological pathways through advanced querying and visualization · Bioinform. 2006
Bioinformatics and computational biology › biological database
pathway database
0.012006
Patikaweb: a Web interface for analyzing biological pathways through advanced querying and visualization · Bioinform. 2006

Methods — techniques the papers use, named apart from their topics

graph-theoretic query · 0.1
YearPublicationVenuePosition
2009 Algorithms for effective querying of compound graph-based pathway databases
abstract
BACKGROUND: Graph-based pathway ontologies and databases are widely used to represent data about cellular processes. This representation makes it possible to programmatically integrate cellular networks and to investigate them using the well-understood concepts of graph theory in order to predict their structural and dynamic properties. An extension of this graph representation, namely hierarchically structured or compound graphs, in which a member of a biological network may recursively contain a sub-network of a somehow logically similar group of biological objects, provides many additional benefits for analysis of biological pathways, including reduction of complexity by decomposition into distinct components or modules. In this regard, it is essential to effectively query such integrated large compound networks to extract the sub-networks of interest with the help of efficient algorithms and software tools. RESULTS: Towards this goal, we developed a querying framework, along with a number of graph-theoretic algorithms from simple neighborhood queries to shortest paths to feedback loops, that is applicable to all sorts of graph-based pathway databases, from PPIs (protein-protein interactions) to metabolic and signaling pathways. The framework is unique in that it can account for compound or nested structures and ubiquitous entities present in the pathway data. In addition, the queries may be related to each other through "AND" and "OR" operators, and can be recursively organized into a tree, in which the result of one query might be a source and/or target for another, to form more complex queries. The algorithms were implemented within the querying component of a new version of the software tool PATIKAweb (Pathway Analysis Tool for Integration and Knowledge Acquisition) and have proven useful for answering a number of biologically significant questions for large graph-based pathway databases. CONCLUSION: The PATIKA Project Web site is http://www.patika.org. PATIKAweb version 2.1 is available at http://web.patika.org.
Ugur Dogrusoz, Ahmet Cetintas, Emek Demir, Ozgun Babur
BMC Bioinform.2
2009 A layout algorithm for undirected compound graphs
Ugur Dogrusoz, Erhan Giral, Ahmet Cetintas, Ali Çivril, Emek Demir
Inf. Sci.3
2006 Patikaweb: a Web interface for analyzing biological pathways through advanced querying and visualization
abstract
Abstract Summary: Patikaweb provides a Web interface for retrieving and analyzing biological pathways in the Patika database, which contains data integrated from various prominent public pathway databases. It features a user-friendly interface, dynamic visualization and automated layout, advanced graph-theoretic queries for extracting biologically important phenomena, local persistence capability and exporting facilities to various pathway exchange formats. Availability: The Web site is freely accessible to non-commercial users from Contact: [email protected] Supplementary information: Detailed information is available on the tool Web site (), including key features, screenshots and User’s Guide.
Ugur Dogrusoz, E. Z. Erson, Erhan Giral, Emek Demir, Ozgun Babur, Ahmet Cetintas, R. Colak
Bioinform.6
2004 A Compound Graph Layout Algorithm for Biological Pathways
Ugur Dogrusoz, Erhan Giral, Ahmet Cetintas, Ali Çivril, Emek Demir
GD3