{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T07:26:35Z","timestamp":1765437995136},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"abstract":"<jats:title>Abstract<\/jats:title><jats:sec>\n                <jats:title>Background<\/jats:title>\n                <jats:p>Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks of genes, proteins, small molecules, or other objects of study can be represented as graphs of nodes (vertices) and interactions (edges) that can carry different weights. SpectralNET is a flexible application for analyzing and visualizing these biological and chemical networks.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Results<\/jats:title>\n                <jats:p>Available both as a standalone .NET executable and as an ASP.NET web application, SpectralNET was designed specifically with the analysis of graph-theoretic metrics in mind, a computational task not easily accessible using currently available applications. Users can choose either to upload a network for analysis using a variety of input formats, or to have SpectralNET generate an idealized random network for comparison to a real-world dataset. Whichever graph-generation method is used, SpectralNET displays detailed information about each connected component of the graph, including graphs of degree distribution, clustering coefficient by degree, and average distance by degree. In addition, extensive information about the selected vertex is shown, including degree, clustering coefficient, various distance metrics, and the corresponding components of the adjacency, Laplacian, and normalized Laplacian eigenvectors. SpectralNET also displays several graph visualizations, including a linear dimensionality reduction for uploaded datasets (Principal Components Analysis) and a non-linear dimensionality reduction that provides an elegant view of global graph structure (Laplacian eigenvectors).<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Conclusion<\/jats:title>\n                <jats:p>SpectralNET provides an easily accessible means of analyzing graph-theoretic metrics for data modeling and dimensionality reduction. SpectralNET is publicly available as both a .NET application and an ASP.NET web application from <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"http:\/\/chembank.broad.harvard.edu\/resources\/\">http:\/\/chembank.broad.harvard.edu\/resources\/<\/jats:ext-link>. Source code is available upon request.<\/jats:p>\n              <\/jats:sec>","DOI":"10.1186\/1471-2105-6-260","type":"journal-article","created":{"date-parts":[[2005,10,19]],"date-time":"2005-10-19T18:14:14Z","timestamp":1129745654000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["SpectralNET \u2013 an application for spectral graph analysis and visualization"],"prefix":"10.1186","volume":"6","author":[{"given":"Joshua J","family":"Forman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul A","family":"Clemons","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stuart L","family":"Schreiber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen J","family":"Haggarty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,19]]},"reference":[{"key":"585_CR1","doi-asserted-by":"publisher","first-page":"138701","DOI":"10.1103\/PhysRevLett.91.138701","volume":"91","author":"E Eisenberg","year":"2003","unstructured":"Eisenberg E, Levanon E: Preferential attachment in the protein network evolution. Phys Rev Lett 2003, 91: 138701. 10.1103\/PhysRevLett.91.138701","journal-title":"Phys Rev Lett"},{"key":"585_CR2","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1186\/1471-2105-5-88","volume":"5","author":"D Fera","year":"2004","unstructured":"Fera D, Kim N, Shiddelfrim N, Zorn J, Laserson U, Gan HH, Schlick T: RAG: RNA-As-Graphs web resource. BMC Bioinformatics 2004, 5: 88. 10.1186\/1471-2105-5-88","journal-title":"BMC Bioinformatics"},{"key":"585_CR3","doi-asserted-by":"publisher","first-page":"10543","DOI":"10.1021\/ja035413p","volume":"125","author":"S Haggarty","year":"2003","unstructured":"Haggarty S, Clemons P, Schreiber S: Chemical genomic profiling of biological networks using graph theory and combinations of small molecule perturbations. J Am Chem Soc 2003, 125: 10543\u201310545. 10.1021\/ja035413p","journal-title":"J Am Chem Soc"},{"key":"585_CR4","volume-title":"Introductory Graph Theory","author":"G Chartrand","year":"1985","unstructured":"Chartrand G: Introductory Graph Theory. New York: Dover; 1985."},{"key":"585_CR5","volume-title":"Spectral Graph Theory","author":"F Chung","year":"1997","unstructured":"Chung F: Spectral Graph Theory. Providence: American Mathematical Society; 1997."},{"key":"585_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1145\/210089.210090","volume":"21","author":"M Goano","year":"1995","unstructured":"Goano M: Algorithm 745: Computation of the complete and incomplete Fermi-Dirac integral. ACM Trans Math Software 1995, 21: 221\u2013232. 10.1145\/210089.210090","journal-title":"ACM Trans Math Software"},{"key":"585_CR7","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f5s","year":"1959","unstructured":"Erd\u00f5s P, R\u00e9nyi A: On random graphs I. Publ Math Debrecen 1959, 6: 290\u2013297.","journal-title":"Publ Math Debrecen"},{"key":"585_CR8","doi-asserted-by":"crossref","first-page":"509512","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si AL, Albert R: Emergence of scaling in random networks. Science 1999, 286: 509512.","journal-title":"Science"},{"key":"585_CR9","doi-asserted-by":"publisher","first-page":"5234","DOI":"10.1103\/PhysRevLett.85.5234","volume":"85","author":"R Albert","year":"2000","unstructured":"Albert R, Barab\u00e1si AL: Topology of evolving networks: Local events and universality. Phys Rev Lett 2000, 85: 5234\u20135237. 10.1103\/PhysRevLett.85.5234","journal-title":"Phys Rev Lett"},{"key":"585_CR10","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D Watts","year":"1998","unstructured":"Watts D, Strogatz S: Collective dynamics of 'small-world' networks. Nature 1998, 393: 440\u2013442. 10.1038\/30918","journal-title":"Nature"},{"key":"585_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1063\/1.1571285","volume":"661","author":"AL Barab\u00e1si","year":"2003","unstructured":"Barab\u00e1si AL, Dezso Z, Ravasz E, Yook SH, Oltvai Z: Scale-free and hierarchical structures in complex networks. Modeling of Complex Systems 2003, 661: 1\u201316.","journal-title":"Modeling of Complex Systems"},{"key":"585_CR12","first-page":"47","volume":"21","author":"V Batagelj","year":"1998","unstructured":"Batagelj V, Mrvar A: PAJEK \u2013 program for large network analysis. Connections 1998, 21: 47\u201357.","journal-title":"Connections"},{"key":"585_CR13","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1162\/089976603321780317","volume":"15","author":"M Belkin","year":"2003","unstructured":"Belkin M, Niyogi P: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation 2003, 15: 1373\u20131396. 10.1162\/089976603321780317","journal-title":"Neural Computation"},{"key":"585_CR14","first-page":"417441","volume":"24","author":"H Hotelling","year":"1931","unstructured":"Hotelling H: Analysis of a complex of statistical variables into principal components. J Educ Psychol 1931, 24: 417441.","journal-title":"J Educ Psychol"},{"key":"585_CR15","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1086\/425587","volume":"75","author":"Z Lin","year":"2004","unstructured":"Lin Z, Altman R: Finding haplotype tagging SNPs by use of principal components analysis. Am J hum Genet 2004, 75: 850\u2013861. 10.1086\/425587","journal-title":"Am J hum Genet"},{"key":"585_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1186\/1471-2105-5-207","volume":"5","author":"JC Nacher","year":"2004","unstructured":"Nacher JC, Ueda N, Yamada T, Kanehisa M, Akutsu T: Clustering under the line graph transformation: application to reaction network. BMC Bioinformatics 2004, 5: 207. 10.1186\/1471-2105-5-207","journal-title":"BMC Bioinformatics"},{"key":"585_CR17","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-94-015-8937-6_6","volume-title":"Graph Symmetry: Algebraic Methods and Applications","author":"B Mohar","year":"1997","unstructured":"Mohar B: Some applications of Laplace eigenvalues of graphs. In Graph Symmetry: Algebraic Methods and Applications. Edited by: Hahn G, Sabidussi G. Dordrecht: Kluwer Academic Publishers; 1997:225\u2013275."},{"key":"585_CR18","doi-asserted-by":"publisher","first-page":"559564","DOI":"10.1016\/S0378-4371(01)00369-7","volume":"299","author":"AL Barab\u00e1si","year":"2001","unstructured":"Barab\u00e1si AL, Ravasz E, Vicsek T: Deterministic scale-free networks. Physica A 2001, 299: 559564. 10.1016\/S0378-4371(01)00369-7","journal-title":"Physica A"},{"key":"585_CR19","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/jgt.3190120213","volume":"12","author":"F Chung","year":"1988","unstructured":"Chung F: The average distance and the independence number. J Graph Theory 1988, 12: 229\u2013235.","journal-title":"J Graph Theory"},{"key":"585_CR20","doi-asserted-by":"publisher","first-page":"026704","DOI":"10.1103\/PhysRevE.64.026704","volume":"64","author":"I Farkas","year":"2001","unstructured":"Farkas I, Derenyi I, Barab\u00e1si AL, Vicsek T: Spectra of \"real-world\" graphs: Beyond the semicircle law. Phys Rev E 2001, 64: 026704. 10.1103\/PhysRevE.64.026704","journal-title":"Phys Rev E"},{"key":"585_CR21","first-page":"1129","volume":"21","author":"T Fruchterman","year":"1991","unstructured":"Fruchterman T, Reingold E: Graph drawing by force-directed placement. Software: Practice and Experience 1991, 21: 1129\u20131164.","journal-title":"Software: Practice and Experience"},{"key":"585_CR22","doi-asserted-by":"publisher","first-page":"1712","DOI":"10.1002\/jcc.1126","volume":"22","author":"D Agrafiotis","year":"2001","unstructured":"Agrafiotis D, Lobanov V: Multidimensional scaling of combinatorial libraries without explicit enumeration. J Comput Chem 2001, 22: 1712\u20131722. 10.1002\/jcc.1126","journal-title":"J Comput Chem"},{"key":"585_CR23","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1023\/B:MACH.0000033120.25363.1e","volume":"56","author":"M Belkin","year":"2004","unstructured":"Belkin M, Niyogi P: Semi-supervised learning on Riemannian manifolds. Machine Learning 2004, 56: 209\u2013239. 10.1023\/B:MACH.0000033120.25363.1e","journal-title":"Machine Learning"},{"key":"585_CR24","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0378-4371(02)00741-0","volume":"309","author":"F Comellas","year":"2002","unstructured":"Comellas F, Sampels M: Deterministic small-world networks. Physica A 2002, 309: 231\u2013235. 10.1016\/S0378-4371(02)00741-0","journal-title":"Physica A"},{"key":"585_CR25","doi-asserted-by":"publisher","first-page":"3417","DOI":"10.1002\/1521-3773(20010917)40:18<3417::AID-ANIE3417>3.0.CO;2-E","volume":"40","author":"R Stavenger","year":"2001","unstructured":"Stavenger R, Schreiber S: Asymmetric Catalysis in Diversity-Oriented Organic Synthesis: Enantioselective Synthesis of 4320 Encoded and Spatially Segregated Dihydropyrancarboxamides. Angew Chem Intl Ed 2001, 40: 3417\u20133421. Publisher Full Text 10.1002\/1521-3773(20010917)40:18<3417::AID-ANIE3417>3.0.CO;2-E","journal-title":"Angew Chem Intl Ed"},{"key":"585_CR26","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1093\/bioinformatics\/bti115","volume":"21","author":"P Pagel","year":"2005","unstructured":"Pagel P, Kovac S, Oesterheld M, Brauner B, Dunger-Kaltenback I, Frishman G, Montrone C, Mark P, St\u00fcmpflen V, Mewes H, Ruepp A, Frishman D: The MIPS mammalian protein-protein interaction database. Bioinformatics 2005, 21: 832\u2013834. 10.1093\/bioinformatics\/bti115","journal-title":"Bioinformatics"},{"key":"585_CR27","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1093\/emboj\/17.1.232","volume":"17","author":"E Kalkhoven","year":"1998","unstructured":"Kalkhoven E, Valentine J, Heery D, Parker M: Isoforms of steroid receptor co-activator 1 differ in their ability to potentiate transcription by the oestrogen receptor. The EMBO Journal 1998, 17: 232\u2013243. 10.1093\/emboj\/17.1.232","journal-title":"The EMBO Journal"},{"key":"585_CR28","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/S0378-4371(02)01731-4","volume":"318","author":"I Farkas","year":"2003","unstructured":"Farkas I, Jeong H, Vicsek T, Barab\u00e1si AL, Oltvai Z: The topology of the transcription regulatory network in the yeast, S. cerevisiae . Physica A 2003, 318: 601\u2013612. 10.1016\/S0378-4371(02)01731-4","journal-title":"Physica A"},{"key":"585_CR29","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1038\/35075138","volume":"411","author":"H Jeong","year":"2001","unstructured":"Jeong H, Mason S, Barab\u00e1si AL, Oltvai Z: Lethality and centrality in protein networks. Nature 2001, 411: 41\u201342. 10.1038\/35075138","journal-title":"Nature"},{"key":"585_CR30","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1021\/ci034047q","volume":"43","author":"L Douali","year":"2003","unstructured":"Douali L, Villemin D, Cherqauoi C: Neural networks: Accurate nonlinear QSAR model for HEPT derivatives. Chem Inf Comput Sci 2003, 43: 1200\u20131207. 10.1021\/ci034047q","journal-title":"Chem Inf Comput Sci"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-6-260.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T17:51:24Z","timestamp":1706809884000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-6-260"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,19]]},"references-count":30,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2005,12]]}},"alternative-id":["585"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-6-260","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,19]]},"assertion":[{"value":"1 June 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2005","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2005","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"260"}}