Wayne B Hayes

Prof. Dr. Wayne B Hayes

Department of Computer Science, University of California, Irvine, CA 92697-3435, USA
orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
24 March 2010 in Journal of The Royal Society Interface
Verified
Journal Article
Closed access
OKOleksii Kuchaiev
Oleksii Kuchaiev
TMTijana Milenković
Tijana Milenković
VMVesna Memišević
Vesna Memišević
WHWayne B Hayes
Wayne B Hayes
NPNataša Pržulj
Nataša Pržulj
Sequence comparison and alignment has had an enormous impact on our understanding of evolution, biology and disease. Comparison and alignment of biological networks will probably have a similar impact. Existing network alignments use information external to the networks, such as sequence, because no good algorithm for purely topological alignment has yet been devised. In this paper, we present a novel algorithm based solely on network topology, that can be used to align any two networks. We apply it to biological networks to produce by far the most complete topological alignments of biological networks to date. We demonstrate that both species phylogeny and detailed biological function of individual proteins can be extracted from our alignments. Topology-based alignments have the potential to provide a completely new, independent source of phylogenetic information. Our alignment of the protein–protein interaction networks of two very different species—yeast and human—indicate that even distant species share a surprising amount of network topology, suggesting broad similarities in internal cellular wiring across all life on Earth.

14 February 2017 in Bioinformatics
Verified
Journal Article
Closed access
PDF file
NMNil Mamano
Nil Mamano
WHWayne B Hayes
Wayne B Hayes
Summary: Every alignment algorithm consists of two orthogonal components: an objective function M measuring the quality of an alignment, and a search algorithm that explores the space of alignments looking for ones scoring well according to M. We introduce a new search algorithm called SANA (Simulated Annealing Network Aligner) and apply it to protein-protein interaction networks using S3 as the topological measure. Compared against 12 recent algorithms, SANA produces 5–10 times as many correct node pairings as the others when the correct answer is known. We expose an anti-correlation in many existing aligners between their ability to produce good topological vs. functional similarity scores, whereas SANA usually outscores other methods in both measures. If given the perfect objective function encoding the identity mapping, SANA quickly converges to the perfect solution while many other algorithms falter. We observe that when aligning networks with a known mapping and optimizing only S3, SANA creates alignments that are not perfect and yet whose S3 scores match that of the perfect alignment. We call this phenomenon saturation of the topological score. Saturation implies that a measure’s correlation with alignment correctness falters before the perfect alignment is reached. This, combined with SANA’s ability to produce the perfect alignment if given the perfect objective function, suggests that better objective functions may lead to dramatically better alignments. We conclude that future work should focus on finding better objective functions, and offer SANA as the search algorithm of choice. Availability and Implementation: Software available at http://sana.ics.uci.edu. Contact: whayes@uci.edu Supplementary information: Supplementary data are available at Bioinformatics online.

8 July 2014 in The Astrophysical Journal
Verified
Journal Article
Closed access
DDDarren R. Davis
Darren R. Davis
WHWayne B Hayes
Wayne B Hayes

9 February 2013 in Bioinformatics
Verified
Journal Article
Open access
PDF file
WHWayne B Hayes
Wayne B Hayes
KSKai Sun
Kai Sun
NPNataša Pržulj
Nataša Pržulj
Motivation: Large amounts of biological network data exist for many species. Analogous to sequence comparison, network comparison aims to provide biological insight. Graphlet-based methods are proving to be useful in this respect. Recently some doubt has arisen concerning the applicability of graphlet-based measures to low edge density networks—in particular that the methods are ‘unstable’—and further that no existing network model matches the structure found in real biological networks. Results: We demonstrate that it is the model networks themselves that are ‘unstable’ at low edge density and that graphlet-based measures correctly reflect this instability. Furthermore, while model network topology is unstable at low edge density, biological network topology is stable. In particular, one must distinguish between average density and local density. While model networks of low average edge densities also have low local edge density, that is not the case with protein–protein interaction (PPI) networks: real PPI networks have low average edge density, but high local edge densities, and hence, they (and thus graphlet-based measures) are stable on these networks. Finally, we use a recently devised non-parametric statistical test to demonstrate that PPI networks of many species are well-fit by several models not previously tested. In addition, we model several viral PPI networks for the first time and demonstrate an exceptionally good fit between the data and theoretical models. Contact: natasha@imperial.ac.uk

19 January 2011 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
OKOleksii Kuchaiev
Oleksii Kuchaiev
ASAleksandar Stevanović
Aleksandar Stevanović
WHWayne B Hayes
Wayne B Hayes
NPNataša Pržulj
Nataša Pržulj
Background: Recent advancements in experimental biotechnology have produced large amounts of protein-protein interaction (PPI) data. The topology of PPI networks is believed to have a strong link to their function. Hence, the abundance of PPI data for many organisms stimulates the development of computational techniques for the modeling, comparison, alignment, and clustering of networks. In addition, finding representative models for PPI networks will improve our understanding of the cell just as a model of gravity has helped us understand planetary motion. To decide if a model is representative, we need quantitative comparisons of model networks to real ones. However, exact network comparison is computationally intractable and therefore several heuristics have been used instead. Some of these heuristics are easily computable "network properties," such as the degree distribution, or the clustering coefficient. An important special case of network comparison is the network alignment problem. Analogous to sequence alignment, this problem asks to find the "best" mapping between regions in two networks. It is expected that network alignment might have as strong an impact on our understanding of biology as sequence alignment has had. Topology-based clustering of nodes in PPI networks is another example of an important network analysis problem that can uncover relationships between interaction patterns and phenotype.Results: We introduce the GraphCrunch 2 software tool, which addresses these problems. It is a significant extension of GraphCrunch which implements the most popular random network models and compares them with the data networks with respect to many network properties. Also, GraphCrunch 2 implements the GRAph ALigner algorithm ("GRAAL") for purely topological network alignment. GRAAL can align any pair of networks and exposes large, dense, contiguous regions of topological and functional similarities far larger than any other existing tool. Finally, GraphCruch 2 implements an algorithm for clustering nodes within a network based solely on their topological similarities. Using GraphCrunch 2, we demonstrate that eukaryotic and viral PPI networks may belong to different graph model families and show that topology-based clustering can reveal important functional similarities between proteins within yeast and human PPI networks.Conclusions: GraphCrunch 2 is a software tool that implements the latest research on biological network analysis. It parallelizes computationally intensive tasks to fully utilize the potential of modern multi-core CPUs. It is open-source and freely available for research use. It runs under the Windows and Linux platforms.

22 August 2017 in Monthly Notices of the Royal Astronomical Society
Verified
Journal Article
Open access
PDF file
RHRoss E. Hart
Ross E. Hart
SBSteven P. Bamford
Steven P. Bamford
WHWayne B Hayes
Wayne B Hayes
CCCarolin N. Cardamone
Carolin N. Cardamone
WKWilliam C. Keel
William C. Keel
RSRebecca J. Smethurst
Rebecca J. Smethurst
In this paper, we study the morphological properties of spiral galaxies, including measurements of spiral arm number and pitch angle. Using Galaxy Zoo 2, a stellar mass-complete sample of 6222 SDSS spiral galaxies is selected. We use the machine vision algorithm sparcfire to identify spiral arm features and measure their associated geometries. A support vector machine classifier is employed to identify reliable spiral features, with which we are able to estimate pitch angles for half of our sample. We use these machine measurements to calibrate visual estimates of arm tightness, and hence estimate pitch angles for our entire sample. The properties of spiral arms are compared with respect to various galaxy properties. The star formation properties of galaxies vary significantly with arm number, but not pitch angle. We find that galaxies hosting strong bars have spiral arms substantially (4°–6°) looser than unbarred galaxies. Accounting for this, spiral arms associated with many-armed structures are looser (by 2°) than those in two-armed galaxies. In contrast to this average trend, galaxies with greater bulge-to-total stellar mass ratios display both fewer and looser spiral arms. This effect is primarily driven by the galaxy disc, such that galaxies with more massive discs contain more spiral arms with tighter pitch angles. This implies that galaxy central mass concentration is not the dominant cause of pitch angle and arm number variations between galaxies, which in turn suggests that not all spiral arms are governed by classical density waves or modal theories.