#### Filter Results:

#### Publication Year

2009

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Ariful Azad, Mahantesh Halappanavar, Sivasankaran Rajamanickam, Erik G. Boman, Arif M. Khan, Alex Pothen
- 2012 IEEE 26th International Parallel and…
- 2012

We design, implement, and evaluate algorithms for computing a matching of maximum cardinality in a bipartite graph on multicore and massively multithreaded computers. As computers with larger numbers of slower cores dominate the commodity processor market, the design of multithreaded algorithms to solve large matching problems becomes a necessity. Recent… (More)

- Ariful Azad, Alex Pothen
- 2012 IEEE 26th International Parallel and…
- 2012

We study parallel algorithms for computing matchings in graphs and apply them to solve population registration problem from bio-imaging data. We have developed several classes of multithreaded algorithms for maximum cardinality matching and achieved good speedups on three shared memory machines on a representative set of large real-world and synthetic… (More)

- Ariful Azad, Saumyadipta Pyne, Alex Pothen
- BMC Bioinformatics
- 2012

When flow cytometric data on mixtures of cell populations are collected from samples under different experimental conditions, computational methods are needed (a) to classify the samples into similar groups, and (b) to characterize the changes within the corresponding populations due to the different conditions. Manual inspection has been used in the past… (More)

- Ariful Azad, Johannes Langguth, Youhan Fang, Alan Qi, Alex Pothen
- WABI
- 2010

Multi-channel, high throughput experimental methodologies for flow cytometry are transforming clinical immunology and hematol-ogy, and require the development of algorithms to analyze the high-dimensional, large-scale data. We describe the development of two combinatorial algorithms to identify rare cell populations in data from mice with acute… (More)

- Ariful Azad, Aydin Buluç, John R. Gilbert
- 2015 IEEE International Parallel and Distributed…
- 2015

Triangle counting and enumeration are important kernels that are used to characterize graphs. They are also used to compute important statistics such as clustering coefficients. We provide a simple exact algorithm that is based on operations on sparse adjacency matrices. By parallelizing the individual sparse matrix operations, we achieve a parallel… (More)

We describe an algorithm to dynamically classify flow cytometry data samples into several classes based on their immunophenotypes. Flow cytometry data consists of fluorescence measurements of several proteins that characterize different cell types in blood or cultured cell lines. Each sample is initially clustered to identify the cell populations present in… (More)

Phylogenomics, even more so than traditional phylogenetics, needs to represent the uncertainty in evolutionary trees due to systematic error. Here we illustrate the analysis of genome-scale alignments of yeast, using robust measures of the additivity of the fit of distances to tree when using flexi Weighted Least Squares. A variety of DNA and protein… (More)

- Johannes Langguth, Ariful Azad, Mahantesh Halappanavar, Fredrik Manne
- Parallel Computing
- 2014

- Ariful Azad, Grey Ballard, +5 authors Samuel Williams
- SIAM J. Scientific Computing
- 2016

Sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high-performance graph algorithms as well as for some linear solvers, such as algebraic multigrid. The scaling of existing parallel implementations of SpGEMM is heavily bound by communication. Even though 3D (or 2.5D) algorithms have been proposed and theoretically analyzed in the… (More)

In this article the results of Waddell and Azad (2009) are extended. In particular, the geometric percentage mean standard deviation measure of the fit of distances to a phylogenetic tree are adjusted for the number of parameters fitted on the tree. The formulae are also presented in their general form for any weight that is a function of the distance. The… (More)