{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T21:42:07Z","timestamp":1773870127165,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:sec>\n                    <jats:title>Background<\/jats:title>\n                    <jats:p>StrongestPath is a Cytoscape 3 application that enables the analysis of interactions between two proteins or groups of proteins in a collection of protein\u2013protein interaction (PPI) network or signaling network databases. When there are different levels of confidence over the interactions, the application is able to process them and identify the cascade of interactions with the highest total confidence score. Given a set of proteins, StrongestPath can extract a set of possible interactions between the input proteins, and expand the network by adding new proteins that have the most interactions with highest total confidence to the current network of proteins. The application can also identify any activating or inhibitory regulatory paths between two distinct sets of transcription factors and target genes. This application can be used on the built-in human and mouse PPI or signaling databases, or any user-provided database for some organism.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Results<\/jats:title>\n                    <jats:p>Our results on 12 signaling pathways from the NetPath database demonstrate that the application can be used for indicating proteins which may play significant roles in a pathway by finding the strongest path(s) in the PPI or signaling network.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Conclusion<\/jats:title>\n                    <jats:p>Easy access to multiple public large databases, generating output in a short time, addressing some key challenges in one platform, and providing a user-friendly graphical interface make StrongestPath an extremely useful application.<\/jats:p>\n                  <\/jats:sec>","DOI":"10.1186\/s12859-021-04230-4","type":"journal-article","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T08:02:42Z","timestamp":1624953762000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["StrongestPath: a Cytoscape application for protein\u2013protein interaction analysis"],"prefix":"10.1186","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9521-2046","authenticated-orcid":false,"given":"Zaynab","family":"Mousavian","sequence":"first","affiliation":[]},{"given":"Mehran","family":"Khodabandeh","sequence":"additional","affiliation":[]},{"given":"Ali","family":"Sharifi-Zarchi","sequence":"additional","affiliation":[]},{"given":"Alireza","family":"Nadafian","sequence":"additional","affiliation":[]},{"given":"Alireza","family":"Mahmoudi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,29]]},"reference":[{"issue":"11","key":"4230_CR1","doi-asserted-by":"publisher","first-page":"2498","DOI":"10.1101\/gr.1239303","volume":"13","author":"P Shannon","year":"2003","unstructured":"Shannon P, et al. Cytoscape: a software environment for integrated models of biomolecular interaction networks. Genome Res. 2003;13(11):2498\u2013504.","journal-title":"Genome Res"},{"issue":"3","key":"4230_CR2","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1093\/bioinformatics\/btq675","volume":"27","author":"ME Smoot","year":"2011","unstructured":"Smoot ME, et al. Cytoscape 2.8: new features for data integration and network visualization. Bioinformatics. 2011;27(3):431\u20132.","journal-title":"Bioinformatics"},{"key":"4230_CR3","doi-asserted-by":"crossref","unstructured":"Scardoni G et al., Finding the shortest path with PesCa: a tool for network reconstruction. F1000Research, 2015. 4.","DOI":"10.12688\/f1000research.6769.1"},{"issue":"1","key":"4230_CR4","first-page":"1","volume":"2","author":"A Ritz","year":"2016","unstructured":"Ritz A, et al. Pathways on demand: automated reconstruction of human signaling networks. NPJ Syst Biol Appl. 2016;2(1):1\u20139.","journal-title":"NPJ Syst Biol Appl"},{"key":"4230_CR5","doi-asserted-by":"crossref","unstructured":"Gil DP, Law JN, Murali T, The PathLinker app: connect the dots in protein interaction networks. F1000Research, 2017;6.","DOI":"10.12688\/f1000research.9909.1"},{"issue":"D1","key":"4230_CR6","doi-asserted-by":"publisher","first-page":"D380","DOI":"10.1093\/nar\/gkx1013","volume":"46","author":"H Han","year":"2018","unstructured":"Han H, et al. TRRUST v2: an expanded reference database of human and mouse transcriptional regulatory interactions. Nucleic Acids Res. 2018;46(D1):D380\u20136.","journal-title":"Nucleic Acids Res"},{"issue":"suppl_1","key":"4230_CR7","first-page":"D760","volume":"35","author":"T Barrett","year":"2006","unstructured":"Barrett T, et al. NCBI GEO: mining tens of millions of expression profiles\u2014database and tools update. Nucleic Acids Res. 2006;35(suppl_1):D760\u20135.","journal-title":"Nucleic Acids Res"},{"issue":"D1","key":"4230_CR8","doi-asserted-by":"publisher","first-page":"D204","DOI":"10.1093\/nar\/gku989","volume":"43","author":"Consortium U","year":"2015","unstructured":"Consortium U. UniProt: a hub for protein information. Nucleic Acids Res. 2015;43(D1):D204\u201312.","journal-title":"Nucleic Acids Res"},{"issue":"suppl 1","key":"4230_CR9","doi-asserted-by":"publisher","first-page":"D561","DOI":"10.1093\/nar\/gkq973","volume":"39","author":"D Szklarczyk","year":"2011","unstructured":"Szklarczyk D, et al. The STRING database in 2011: functional interaction networks of proteins, globally integrated and scored. Nucleic Acids Res. 2011;39(suppl 1):D561\u20138.","journal-title":"Nucleic Acids Res"},{"key":"4230_CR10","doi-asserted-by":"crossref","unstructured":"L\u00f3pez Y, Nakai K, Patil A, HitPredict version 4: comprehensive reliability scoring of physical protein\u2013protein interactions from more than 100 species. Database, 2015;2015.","DOI":"10.1093\/database\/bav117"},{"key":"4230_CR11","doi-asserted-by":"crossref","unstructured":"Alanis-Lobato G, Andrade-Navarro MA, Schaefer MH. HIPPIE v2.0: enhancing meaningfulness and reliability of protein\u2013protein interaction networks. Nucleic Acids Res 2016, p gkw985.","DOI":"10.1093\/nar\/gkw985"},{"issue":"1","key":"4230_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1093\/nar\/28.1.27","volume":"28","author":"M Kanehisa","year":"2000","unstructured":"Kanehisa M, Goto S. KEGG: kyoto encyclopedia of genes and genomes. Nucleic Acids Res. 2000;28(1):27\u201330.","journal-title":"Nucleic Acids Res"},{"issue":"1","key":"4230_CR13","first-page":"D691","volume":"39","author":"D Croft","year":"2010","unstructured":"Croft D, et al. Reactome: a database of reactions, pathways and biological processes. Nucleic Acids Res. 2010;39(1):D691\u20137.","journal-title":"Nucleic Acids Res"},{"issue":"13","key":"4230_CR14","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1093\/bioinformatics\/btm160","volume":"23","author":"F H\u00fcffner","year":"2007","unstructured":"H\u00fcffner F, Wernicke S, Zichner T. FASPAD: fast signaling pathway detection. Bioinformatics. 2007;23(13):1708\u20139.","journal-title":"Bioinformatics"},{"issue":"1","key":"4230_CR15","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1186\/1471-2105-3-34","volume":"3","author":"M Steffen","year":"2002","unstructured":"Steffen M, et al. Automated modelling of signal transduction networks. BMC Bioinform. 2002;3(1):34.","journal-title":"BMC Bioinform"},{"issue":"1","key":"4230_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/gb-2010-11-1-r3","volume":"11","author":"K Kandasamy","year":"2010","unstructured":"Kandasamy K, et al. NetPath: a public resource of curated signal transduction pathways. Genome Biol. 2010;11(1):1\u20139.","journal-title":"Genome Biol"},{"key":"4230_CR17","doi-asserted-by":"crossref","unstructured":"Raju R et al., NetSlim: high-confidence curated signaling maps. Database, 2011;2011.","DOI":"10.1093\/database\/bar032"},{"issue":"12","key":"4230_CR18","doi-asserted-by":"publisher","first-page":"1739","DOI":"10.1093\/bioinformatics\/btr260","volume":"27","author":"A Liberzon","year":"2011","unstructured":"Liberzon A, et al. Molecular signatures database (MSigDB) 3.0. Bioinformatics. 2011;27(12):1739\u201340.","journal-title":"Bioinformatics"},{"issue":"28","key":"4230_CR19","doi-asserted-by":"publisher","first-page":"3943","DOI":"10.1038\/onc.2016.502","volume":"36","author":"M Fischer","year":"2017","unstructured":"Fischer M. Census and evaluation of p53 target genes. Oncogene. 2017;36(28):3943\u201356.","journal-title":"Oncogene"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-021-04230-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s12859-021-04230-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-021-04230-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T08:05:02Z","timestamp":1624953902000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-021-04230-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["4230"],"URL":"https:\/\/doi.org\/10.1186\/s12859-021-04230-4","relation":{"has-preprint":[{"id-type":"doi","id":"10.1101\/2020.11.12.380600","asserted-by":"object"}]},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,29]]},"assertion":[{"value":"30 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"352"}}