Umit V. Catalyurek

Umit V. Catalyurek

Auto-generated profile, based on publicly available information

Umit V. Catalyurek

Georgia Institute of Technology

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 1999 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
UCU.V. Catalyurek
U.V. Catalyurek
CAC. Aykanat
C. Aykanat
In this work, we show that the standard graph-partitioning-based decomposition of sparse matrices does not reflect the actual communication volume requirement for parallel matrix-vector multiplication. We propose two computational hypergraph models which avoid this crucial deficiency of the graph model. The proposed models reduce the decomposition problem to the well-known hypergraph partitioning problem. The recently proposed successful multilevel framework is exploited to develop a multilevel hypergraph partitioning tool PaToH for the experimental verification of our proposed hypergraph models. Experimental results on a wide range of realistic sparse test matrices confirm the validity of the proposed hypergraph models. In the decomposition of the test matrices, the hypergraph models using PaToH and hMeTiS result in up to 63 percent less communication volume (30 to 38 percent less on the average) than the graph model using MeTiS, while PaToH is only 1.3-2.3 times slower than MeTiS on the average.

6 July 2012 in Briefings in Bioinformatics
Verified
Journal Article
Open access
PDF file
KEKemal Eren
Kemal Eren
MDMehmet Deveci
Mehmet Deveci
OKOnur Küçüktunç
Onur Küçüktunç
ÜÇÜmit V. Çatalyürek
Ümit V. Çatalyürek
The need to analyze high-dimension biological data is driving the development of new data mining methods. Biclustering algorithms have been successfully applied to gene expression data to discover local patterns, in which a subset of genes exhibit similar expression levels over a subset of conditions. However, it is not clear which algorithms are best suited for this task. Many algorithms have been published in the past decade, most of which have been compared only to a small number of algorithms. Surveys and comparisons exist in the literature, but because of the large number and variety of biclustering algorithms, they are quickly outdated. In this article we partially address this problem of evaluating the strengths and weaknesses of existing biclustering methods. We used the BiBench package to compare 12 algorithms, many of which were recently published or have not been extensively studied. The algorithms were tested on a suite of synthetic data sets to measure their performance on data with varying conditions, such as different bicluster models, varying noise, varying numbers of biclusters and overlapping biclusters. The algorithms were also tested on eight large gene expression data sets obtained from the Gene Expression Omnibus. Gene Ontology enrichment analysis was performed on the resulting biclusters, and the best enrichment terms are reported. Our analyses show that the biclustering method and its parameters should be selected based on the desired model, whether that model allows overlapping biclusters, and its robustness to noise. In addition, we observe that the biclustering algorithms capable of finding more than one model are more successful at capturing biologically relevant clusters.

7 June 2013 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
AHAyat Hatem
Ayat Hatem
DBDoruk Bozdağ
Doruk Bozdağ
ATAmanda Toland
Amanda Toland
ÜÇÜmit V Çatalyürek
Ümit V Çatalyürek
Background: The development of next-generation sequencing instruments has led to the generation of millions of short sequences in a single run. The process of aligning these reads to a reference genome is time consuming and demands the development of fast and accurate alignment tools. However, the current proposed tools make different compromises between the accuracy and the speed of mapping. Moreover, many important aspects are overlooked while comparing the performance of a newly developed tool to the state of the art. Therefore, there is a need for an objective evaluation method that covers all the aspects. In this work, we introduce a benchmarking suite to extensively analyze sequencing tools with respect to various aspects and provide an objective comparison. Results: We applied our benchmarking tests on 9 well known mapping tools, namely, Bowtie, Bowtie2, BWA, SOAP2, MAQ, RMAP, GSNAP, Novoalign, and mrsFAST (mrFAST) using synthetic data and real RNA-Seq data. MAQ and RMAP are based on building hash tables for the reads, whereas the remaining tools are based on indexing the reference genome. The benchmarking tests reveal the strengths and weaknesses of each tool. The results show that no single tool outperforms all others in all metrics. However, Bowtie maintained the best throughput for most of the tests while BWA performed better for longer read lengths. The benchmarking tests are not restricted to the mentioned tools and can be further applied to others. Conclusion: The mapping process is still a hard problem that is affected by many factors. In this work, we provided a benchmarking suite that reveals and evaluates the different factors affecting the mapping process. Still, there is no tool that outperforms all of the others in all the tests. Therefore, the end user should clearly specify his needs in order to choose the tool that provides the best results.

1 June 2009 in Pattern Recognition
Verified
Journal Article
Closed access
OSO. Sertel
O. Sertel
JKJ. Kong
J. Kong
HSH. Shimada
H. Shimada
UCU.V. Catalyurek
U.V. Catalyurek
JSJ.H. Saltz
J.H. Saltz
Metin N. GurcanMetin N. Gurcan
Metin N. Gurcan

1 April 2013 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
PDF file
ASAhmet Erdem Saríyüce
Ahmet Erdem Saríyüce
BGBuğra Gedik
Buğra Gedik
GJGabriela Jacques-Silva
Gabriela Jacques-Silva
KWKun-Lung Wu
Kun-Lung Wu
ÜÇÜmit V. Çatalyürek
Ümit V. Çatalyürek
A k -core of a graph is a maximal connected subgraph in which every vertex is connected to at least k vertices in the subgraph. k -core decomposition is often used in large-scale network analysis, such as community detection, protein function prediction, visualization, and solving NP-Hard problems on real networks efficiently, like maximal clique finding. In many real-world applications, networks change over time. As a result, it is essential to develop efficient incremental algorithms for streaming graph data. In this paper, we propose the first incremental k -core decomposition algorithms for streaming graph data. These algorithms locate a small subgraph that is guaranteed to contain the list of vertices whose maximum k -core values have to be updated, and efficiently process this subgraph to update the k -core decomposition. Our results show a significant reduction in run-time compared to non-incremental alternatives. We show the efficiency of our algorithms on different types of real and synthetic graphs, at different scales. For a graph of 16 million vertices, we observe speedups reaching a million times, relative to the non-incremental algorithms.

18 December 2013 in Physical Review Letters
Verified
Journal Article
Closed access
TDT. Dytrych
T. Dytrych
KLK. D. Launey
K. D. Launey
JDJerry Draayer
Jerry Draayer
PMP. Maris
P. Maris
JVJ. P. Vary
J. P. Vary
MCM. A. Caprio
M. A. Caprio
Results for ab initio no-core shell model calculations in a symmetry-adapted SU(3)-based coupling scheme demonstrate that collective modes in light nuclei emerge from first principles. The low-lying states of $^{6}\mathrm{Li}$, $^{8}\mathrm{Be}$, and $^{6}\mathrm{He}$ are shown to exhibit orderly patterns that favor spatial configurations with strong quadrupole deformation and complementary low intrinsic spin values, a picture that is consistent with the nuclear symplectic model. The results also suggest a pragmatic path forward to accommodate deformation-driven collective features in ab initio analyses when they dominate the nuclear landscape.