{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T13:59:53Z","timestamp":1784123993440,"version":"3.55.0"},"reference-count":132,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T00:00:00Z","timestamp":1672444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T00:00:00Z","timestamp":1672444800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Netw Model Anal Health Inform Bioinforma"],"DOI":"10.1007\/s13721-022-00406-x","type":"journal-article","created":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T06:02:26Z","timestamp":1672466546000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Temporal networks in biology and medicine: a survey on models, algorithms, and tools"],"prefix":"10.1007","volume":"12","author":[{"given":"Mohammad Mehdi","family":"Hosseinzadeh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mario","family":"Cannataro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5542-2997","authenticated-orcid":false,"given":"Pietro Hiram","family":"Guzzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Riccardo","family":"Dondi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,12,31]]},"reference":[{"issue":"3","key":"406_CR1","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1093\/bib\/bbl022","volume":"7","author":"T Aittokallio","year":"2006","unstructured":"Aittokallio T, Schwikowski B (2006) Graph-based methods for analysing networks in cell biology. Brief Bioinform 7(3):243\u2013255","journal-title":"Brief Bioinform"},{"key":"406_CR2","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.jcss.2019.08.002","volume":"107","author":"EC Akrida","year":"2020","unstructured":"Akrida EC, Mertzios GB, Spirakis PG, Zamaraev V (2020) Temporal vertex cover with a sliding time window. J Comput Syst Sci 107:108\u2013123","journal-title":"J Comput Syst Sci"},{"key":"406_CR3","volume-title":"Bursts: the hidden patterns behind everything we do from your e-mail to bloody crusades","author":"B Albert-L\u00e1szl\u00f3","year":"2010","unstructured":"Albert-L\u00e1szl\u00f3 B (2010) Bursts: the hidden patterns behind everything we do from your e-mail to bloody crusades. Penguin"},{"key":"406_CR4","first-page":"161","volume-title":"Temporal networks","author":"V Alexei","year":"2013","unstructured":"Alexei V (2013) Spreading dynamics following bursty activity patterns. Temporal networks. Springer, pp 161\u2013174"},{"issue":"6977","key":"406_CR5","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1038\/nature02289","volume":"427","author":"E Almaas","year":"2004","unstructured":"Almaas E, Kovacs B, Vicsek T, Oltvai ZN, Barab\u00e1si A-L (2004) Global organization of metabolic fluxes in the bacterium escherichia coli. Nature 427(6977):839\u2013843","journal-title":"Nature"},{"issue":"6366","key":"406_CR6","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1126\/science.aai7488","volume":"358","author":"L Aming","year":"2017","unstructured":"Aming L, Cornelius Sean P, Liu Y-Y, Long W, Barab\u00e1si A-L (2017) The fundamental advantages of temporal networks. Science 358(6366):1042\u20131046","journal-title":"Science"},{"key":"406_CR7","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/978-3-030-86967-0","volume-title":"Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5\u20137, 2021, Proceedings","author":"M Andrea","year":"2021","unstructured":"Andrea M, Ana S (2021) K\u00f6nigsberg sightseeing: Eulerian walks in temporal graphs. In: Flocchini Paola, Moura Lucia (eds) Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5\u20137, 2021, Proceedings, vol 12757. Lecture notes in computer science. Springer, pp 485\u2013500"},{"issue":"18","key":"406_CR8","doi-asserted-by":"publisher","first-page":"3527","DOI":"10.1093\/bioinformatics\/btz119","volume":"35","author":"D Apar\u00edcio","year":"2019","unstructured":"Apar\u00edcio D, Ribeiro P, Milenkovi\u0107 T, Silva F (2019) Temporal network alignment via got-wave. Bioinformatics 35(18):3527\u20133529","journal-title":"Bioinformatics"},{"key":"406_CR9","first-page":"319","volume-title":"62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7\u201310, 2022","author":"C Arnaud","year":"2021","unstructured":"Arnaud C, Michael R, Malte R, Viktor Z (2021) Sharp thresholds in random simple temporal graphs. 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7\u201310, 2022. IEEE, pp 319\u2013326"},{"issue":"2","key":"406_CR10","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jagm.1999.1062","volume":"34","author":"Y Asahiro","year":"2000","unstructured":"Asahiro Y, Iwama K, Tamaki H, Tokuyama T (2000) Greedily finding a dense subgraph. J Algorithms 34(2):203\u2013221","journal-title":"J Algorithms"},{"issue":"5","key":"406_CR11","first-page":"454","volume":"5","author":"B Bahmani","year":"2012","unstructured":"Bahmani B, Kumar R, Vassilvitskii S (2012) Densest subgraph in streaming and mapreduce. PVLDB 5(5):454\u2013465","journal-title":"PVLDB"},{"issue":"51","key":"406_CR12","doi-asserted-by":"publisher","first-page":"21484","DOI":"10.1073\/pnas.0906910106","volume":"106","author":"D Balcan","year":"2009","unstructured":"Balcan D, Colizza V, Gon\u00e7alves B, Hao H, Ramasco JJ, Vespignani A (2009) Multiscale mobility networks and the spatial spreading of infectious diseases. Proc Natl Acad Sci 106(51):21484\u201321489","journal-title":"Proc Natl Acad Sci"},{"issue":"7039","key":"406_CR13","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1038\/nature03459","volume":"435","author":"A-L Barabasi","year":"2005","unstructured":"Barabasi A-L (2005) The origin of bursts and heavy tails in human dynamics. Nature 435(7039):207\u2013211","journal-title":"Nature"},{"key":"406_CR14","first-page":"456","volume-title":"Annual International Conference on Research in Computational Molecular Biology","author":"S Barna","year":"2010","unstructured":"Barna S, Allison H, Samir K, Louiqa R, Xiao-Ning Z (2010) Dense subgraphs with restrictions and applications to gene annotation graphs. Annual International Conference on Research in Computational Molecular Biology. Springer, pp 456\u2013472"},{"key":"406_CR15","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.tcs.2019.03.026","volume":"806","author":"J Baste","year":"2020","unstructured":"Baste J, Bui-Xuan B-M, Roux A (2020) Temporal matching. Theor Comput Sci 806:184\u2013196","journal-title":"Theor Comput Sci"},{"issue":"1","key":"406_CR16","first-page":"1.13:1","volume":"24","author":"M Bentert","year":"2019","unstructured":"Bentert M, Himmel A-S, Molter H, Morik M, Niedermeier R, Saitenmacher R (2019) Listing all maximal k-plexes in temporal graphs. ACM J Exp Algorithmics 24(1):1.13:1-1.13:27","journal-title":"ACM J Exp Algorithmics"},{"issue":"3","key":"406_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<125::AID-NET1>3.0.CO;2-P","volume":"28","author":"KA Berman","year":"1996","unstructured":"Berman KA (1996) Vulnerability of scheduled networks and a generalization of Menger\u2019s theorem. Networks 28(3):125\u2013134","journal-title":"Networks"},{"issue":"5","key":"406_CR18","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.1109\/TCBB.2011.19","volume":"8","author":"N Betzler","year":"2011","unstructured":"Betzler N, van Bevern R, Fellows MR, Komusiewicz C, Niedermeier R (2011) Parameterized algorithmics for finding connected motifs in biological networks. IEEE ACM Trans Comput Biol Bioinform 8(5):1296\u20131308","journal-title":"IEEE ACM Trans Comput Biol Bioinform"},{"issue":"3","key":"406_CR19","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1089\/cmb.2009.0170","volume":"17","author":"S Bruckner","year":"2010","unstructured":"Bruckner S, H\u00fcffner F, Karp RM, Shamir R, Sharan R (2010) Topology-free querying of protein interaction networks. J Comput Biol 17(3):237\u2013252","journal-title":"J Comput Biol"},{"issue":"3","key":"406_CR20","doi-asserted-by":"publisher","first-page":"036102","DOI":"10.1103\/PhysRevE.83.036102","volume":"83","author":"Min Byungjoon","year":"2011","unstructured":"Byungjoon Min, Goh K-I, Alexei Vazquez (2011) Spreading dynamics following bursty human activity patterns. Physical Review E 83(3):036102","journal-title":"Physical Review E"},{"issue":"1","key":"406_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1824795.1824796","volume":"43","author":"M Cannataro","year":"2010","unstructured":"Cannataro M, Guzzi PH, Veltri P (2010) Protein-to-protein interactions: technologies, databases, and algorithms. ACM Computing Surv (CSUR) 43(1):1\u201336","journal-title":"ACM Computing Surv (CSUR)"},{"issue":"3","key":"406_CR21","first-page":"216","volume":"3","author":"M Cannataro","year":"2013","unstructured":"Cannataro M, Guzzi PH, Sarica A (2013) Data mining and life sciences applications on the grid. Wiley Interdiscip Rev 3(3):216\u2013238","journal-title":"Wiley Interdiscip Rev"},{"issue":"9","key":"406_CR23","doi-asserted-by":"publisher","first-page":"2754","DOI":"10.1007\/s00453-021-00831-w","volume":"83","author":"A Casteigts","year":"2021","unstructured":"Casteigts A, Himmel A-S, Molter H, Zschoche P (2021) Finding temporal paths under waiting time constraints. Algorithmica 83(9):2754\u20132802","journal-title":"Algorithmica"},{"key":"406_CR24","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.procs.2020.08.023","volume":"176","author":"M Castelli","year":"2020","unstructured":"Castelli M, Dondi R, Hosseinzadeh MM (2020) Genetic algorithms for finding episodes in temporal networks. Procedia Comput Sci 176:215\u2013224","journal-title":"Procedia Comput Sci"},{"issue":"1","key":"406_CR25","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1093\/bib\/bby117","volume":"21","author":"S Chang","year":"2020","unstructured":"Chang S, Tong J, Zhu Y, Cui P, Wang F (2020) Network embedding in biomedical data science. Brief Bioinform 21(1):182\u2013197","journal-title":"Brief Bioinform"},{"key":"406_CR26","doi-asserted-by":"crossref","unstructured":"Charikar M (2000) Greedy approximation algorithms for finding dense components in a graph. In: Approximation algorithms for combinatorial optimization, Third International Workshop, APPROX 2000, Proceedings, pages 84\u201395","DOI":"10.1007\/3-540-44436-X_10"},{"issue":"2","key":"406_CR27","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1109\/TCBB.2019.2923620","volume":"18","author":"K Chow","year":"2021","unstructured":"Chow K, Sarkar A, Elhesha R, Cinaglia P, Ay A, Kahveci T (2021) ANCA: alignment-based network construction algorithm. IEEE\/ACM Trans Comput Biol Bioinform 18(2):512\u2013524","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"406_CR28","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s13721-022-00383-1","volume":"11","author":"P Cinaglia","year":"2022","unstructured":"Cinaglia P, Cannataro M (2022) Network alignment and motif discovery in dynamic networks. Netw Model Anal Health Inform Bioinform 11:10","journal-title":"Netw Model Anal Health Inform Bioinform"},{"key":"406_CR29","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. MIT Press","edition":"3"},{"issue":"5","key":"406_CR30","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1002\/sam.10133","volume":"4","author":"M Coscia","year":"2011","unstructured":"Coscia M, Giannotti F, Pedreschi D (2011) A classification for community discovery methods in complex networks. Stat Data Mining 4(5):512\u2013546","journal-title":"Stat Data Mining"},{"issue":"5","key":"406_CR31","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1109\/TKDE.2018.2849727","volume":"31","author":"P Cui","year":"2018","unstructured":"Cui P, Wang X, Pei J, Zhu W (2018) A survey on network embedding. IEEE Trans Knowl Data Eng 31(5):833\u2013852","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"406_CR34","unstructured":"Dondi R (2022) Insights into the complexity of disentangling temporal graphs. In Ugo\u00a0Dal Lago and Daniele Gorla, editors, Proceedings of the 23rd Italian Conference on Theoretical Computer Science, ICTCS 2022, Rome, Italy, September 7-9, 2022, volume 3284 of CEUR Workshop Proceedings, pages 1\u201313. CEUR-WS.org"},{"issue":"1","key":"406_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-021-00381-8","volume":"6","author":"R Dondi","year":"2021","unstructured":"Dondi R, Hosseinzadeh MM, Guzzi PH (2021a) A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks. Appl Netw Sci 6(1):1\u201317","journal-title":"Appl Netw Sci"},{"issue":"1","key":"406_CR33","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/s10878-020-00664-3","volume":"41","author":"R Dondi","year":"2021","unstructured":"Dondi R, Hosseinzadeh MM, Mauri G, Zoppis I (2021b) Top-k overlapping densest subgraphs: approximation algorithms and computational complexity. J Comb Optim 41(1):80\u2013104","journal-title":"J Comb Optim"},{"issue":"40","key":"406_CR35","doi-asserted-by":"publisher","first-page":"14333","DOI":"10.1073\/pnas.0405728101","volume":"101","author":"J-P Eckmann","year":"2004","unstructured":"Eckmann J-P, Moses E, Sergi D (2004) Entropy of dialogues creates coherent structures in e-mail traffic. Proc Natl Acad Sci 101(40):14333\u201314337","journal-title":"Proc Natl Acad Sci"},{"issue":"6","key":"406_CR36","first-page":"1","volume":"20","author":"R Elhesha","year":"2019","unstructured":"Elhesha R, Sarkar A, Boucher C, Kahveci T (2019) Identification of co-evolving temporal networks. BMC Genom 20(6):1\u201316","journal-title":"BMC Genom"},{"key":"406_CR37","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.epidem.2018.04.003","volume":"24","author":"J Enright","year":"2018","unstructured":"Enright J, Kao RR (2018) Epidemics on dynamic networks. Epidemics 24:88\u201397","journal-title":"Epidemics"},{"issue":"3\u20135","key":"406_CR38","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3\u20135):75\u2013174","journal-title":"Phys Rep"},{"key":"406_CR39","first-page":"1","volume":"40","author":"Ortuso Francesco","year":"2021","unstructured":"Francesco Ortuso, Daniele Mercatelli, Hiram Guzzi Pietro, Manuel Giorgi Federico (2021) Structural genetics of circulating variants affecting the sars-cov-2 spike\/human ace2 complex. J Biomol Struct Dyn 40:1\u201311","journal-title":"J Biomol Struct Dyn"},{"key":"406_CR40","doi-asserted-by":"publisher","first-page":"2664","DOI":"10.1016\/j.csbj.2022.05.040","volume":"20","author":"P Francesco","year":"2022","unstructured":"Francesco P, Hiram GP, Tommaso M (2022) Beyond covid-19 pandemic: topology-aware optimization of vaccination strategy for minimizing virus spreading. Comput Struct Biotechnol J 20:2664","journal-title":"Comput Struct Biotechnol J"},{"key":"406_CR41","doi-asserted-by":"publisher","first-page":"117348","DOI":"10.1016\/j.neuroimage.2020.117348","volume":"223","author":"P Fransson","year":"2020","unstructured":"Fransson P, Thompson WH (2020) Temporal flow of hubs and connectivity in the human brain. Neuroimage 223:117348","journal-title":"Neuroimage"},{"issue":"14","key":"406_CR42","doi-asserted-by":"publisher","first-page":"e150","DOI":"10.1093\/bioinformatics\/btl243","volume":"22","author":"E Fratkin","year":"2006","unstructured":"Fratkin E, Naughton BT, Brutlag DL, Batzoglou S (2006) Motifcut: regulatory motifs finding with maximum density subgraphs. Bioinformatics 22(14):e150\u2013e157","journal-title":"Bioinformatics"},{"key":"406_CR43","doi-asserted-by":"crossref","unstructured":"Froese V, Kunz P, Zschoche P (2022) Disentangling the computational complexity of network untangling. CoRR, arXiv:abs\/2204.02668","DOI":"10.24963\/ijcai.2022\/283"},{"key":"406_CR44","unstructured":"F\u00fcchsle E, Molter H, Niedermeier R, Renken M (2022) Temporal connectivity: Coping with foreseen and unforeseen delays. In: James Aspnes and Othon Michail, (eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, volume 221 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pages 17:1\u201317:17"},{"issue":"5","key":"406_CR45","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1007\/s10618-016-0464-z","volume":"30","author":"E Galbrun","year":"2016","unstructured":"Galbrun E, Gionis A, Tatti N (2016) Top-k overlapping densest subgraphs. Data Min Knowl Disc 30(5):1134\u20131165","journal-title":"Data Min Knowl Disc"},{"key":"406_CR46","doi-asserted-by":"crossref","unstructured":"Gao R, Yan J, Li P, Chen L (2022) Detecting the critical states during disease development based on temporal network flow entropy. Brief Bioinform","DOI":"10.1093\/bib\/bbac164"},{"issue":"4","key":"406_CR47","doi-asserted-by":"publisher","first-page":"48002","DOI":"10.1209\/0295-5075\/81\/48002","volume":"81","author":"K-I Goh","year":"2008","unstructured":"Goh K-I, Barab\u00e1si A-L (2008) Burstiness and memory in complex systems. Europhys Lett 81(4):48002","journal-title":"Europhys Lett"},{"key":"406_CR48","volume-title":"Finding a maximum density subgraph","author":"V Goldberg Andrew","year":"1984","unstructured":"Goldberg Andrew V (1984) Finding a maximum density subgraph. Technical report, Berkeley"},{"key":"406_CR50","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.knosys.2018.03.022","volume":"151","author":"P Goyal","year":"2018","unstructured":"Goyal P, Ferrara E (2018) Graph embedding techniques, applications, and performance: A survey. Knowl-Based Syst 151:78\u201394","journal-title":"Knowl-Based Syst"},{"key":"406_CR49","doi-asserted-by":"publisher","first-page":"104816","DOI":"10.1016\/j.knosys.2019.06.024","volume":"187","author":"P Goyal","year":"2020","unstructured":"Goyal P, Chhetri SR, Canedo A (2020) dyngraph2vec: capturing network dynamics using dynamic graph representation learning. Knowl-Based Syst 187:104816","journal-title":"Knowl-Based Syst"},{"issue":"12","key":"406_CR51","doi-asserted-by":"publisher","first-page":"2961","DOI":"10.1109\/TC.2013.176","volume":"63","author":"PH Guzzi","year":"2013","unstructured":"Guzzi PH, Agapito G, Cannataro M (2013) coresnp: parallel processing of microarray data. IEEE Trans Comput 63(12):2961\u20132974","journal-title":"IEEE Trans Comput"},{"issue":"4","key":"406_CR52","doi-asserted-by":"publisher","first-page":"bbac230","DOI":"10.1093\/bib\/bbac230","volume":"23","author":"PH Guzzi","year":"2022","unstructured":"Guzzi PH, Petrizzelli F, Mazza T (2022b) Disease spreading modeling and analysis: a survey. Brief Bioinform 23(4):bbac230","journal-title":"Brief Bioinform"},{"key":"406_CR53","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.dam.2021.09.029","volume":"307","author":"R Haag","year":"2022","unstructured":"Haag R, Molter H, Niedermeier R, Renken M (2022) Feedback edge sets in temporal graphs. Discret Appl Math 307:65\u201378","journal-title":"Discret Appl Math"},{"key":"406_CR54","volume-title":"Technical report","author":"A Hagberg","year":"2008","unstructured":"Hagberg A, Swart P, Chult DS (2008) Exploring network structure dynamics and function using networkx. Technical report. Los Alamos National Lab, Los Alamos"},{"key":"406_CR55","unstructured":"Hamilton W, Ying R, Leskovec J (2017) Representation learning on graphs: Methods and applications. arXiv preprint arXiv:1709.05584"},{"key":"406_CR56","doi-asserted-by":"crossref","unstructured":"Hamm T, Klobas N, Mertzios GB, Spirakis PG (2022) The complexity of temporal vertex cover in small-degree graphs. CoRR, arXiv:abs\/2204.04832","DOI":"10.1609\/aaai.v36i9.21259"},{"issue":"6995","key":"406_CR57","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1038\/nature02555","volume":"430","author":"JJD Han","year":"2004","unstructured":"Han JJD, Nicolas B, Tong H, Goldberg DS, Berriz GF, Zhang LV, Denis D, Walhout Albertha JM, Cusick Michael E, Roth Frederick P et al (2004) Evidence for dynamically organized modularity in the yeast protein-protein interaction network. Nature 430(6995):88\u201393","journal-title":"Nature"},{"issue":"1","key":"406_CR59","doi-asserted-by":"publisher","first-page":"35:1","DOI":"10.1007\/s13278-017-0455-0","volume":"7","author":"A-S Himmel","year":"2017","unstructured":"Himmel A-S, Molter H, Niedermeier R, Sorge M (2017) Adapting the bron-kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc Netw Anal Min 7(1):35:1-35:16","journal-title":"Soc Netw Anal Min"},{"key":"406_CR60","doi-asserted-by":"publisher","first-page":"4235","DOI":"10.1093\/bioinformatics\/btac450","volume":"38","author":"GP Hiram","year":"2022","unstructured":"Hiram GP, Luisa DP, Alessandro G, Pierangelo V (2022) Pcn-miner: an open-source extensible tool for the analysis of protein contact networks. Bioinformatics 38:4235\u20134237","journal-title":"Bioinformatics"},{"issue":"2","key":"406_CR61","first-page":"653","volume":"19","author":"GP Hiram","year":"2022","unstructured":"Hiram GP, Marinka Z (2022a) Editorial deep learning and graph embeddings for network biology. IEEE\/ACM Trans Comput Biol Bioinform 19(2):653\u2013654","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"3","key":"406_CR62","first-page":"472","volume":"19","author":"GP Hiram","year":"2018","unstructured":"Hiram GP, Tijana M (2018) Survey of local and global biological network alignment: the need to reconcile the two sides of the same coin. Brief Bioinform 19(3):472\u2013481","journal-title":"Brief Bioinform"},{"issue":"3","key":"406_CR63","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme P, Saramki J (2012) Temporal networks. Phys Rep 519(3):97\u2013125","journal-title":"Phys Rep"},{"issue":"9","key":"406_CR64","doi-asserted-by":"publisher","first-page":"721","DOI":"10.14778\/2732939.2732945","volume":"7","author":"W Huanhuan","year":"2014","unstructured":"Huanhuan W, Cheng J, Huang S, Ke Y, Yi L, Yanyan X (2014) Path problems in temporal graphs. Proc VLDB Endow 7(9):721\u2013732","journal-title":"Proc VLDB Endow"},{"key":"406_CR65","first-page":"649","volume-title":"2015 IEEE International Conference on Big Data (IEEE BigData 2015), Santa Clara, CA, USA, October 29 - November 1, 2015","author":"W Huanhuan","year":"2015","unstructured":"Huanhuan W, Cheng J, Yi L, Yiping K, Yuzhen H, Da Yan W, Hejun W (2015) Core decomposition in large temporal graphs. 2015 IEEE International Conference on Big Data (IEEE BigData 2015), Santa Clara, CA, USA, October 29 - November 1, 2015. IEEE Computer Society, pp 649\u2013658"},{"issue":"12","key":"406_CR66","doi-asserted-by":"publisher","first-page":"i171","DOI":"10.1093\/bioinformatics\/btv227","volume":"31","author":"Y Hulovatyy","year":"2015","unstructured":"Hulovatyy Y, Chen H, Milenkovi\u0107 T (2015) Exploring the structure and function of temporal networks with dynamic graphlets. Bioinformatics 31(12):i171\u2013i180","journal-title":"Bioinformatics"},{"issue":"1","key":"406_CR67","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-021-00363-w","volume":"6","author":"R Humphries","year":"2021","unstructured":"Humphries R, Mulchrone K, Tratalos J, More SJ, H\u00f6vel P (2021) A systematic framework of modelling epidemics on temporal networks. Appl Netw Sci 6(1):1\u201319","journal-title":"Appl Netw Sci"},{"key":"406_CR68","unstructured":"Ibiapina A, Lopes R, Marino A, Silva A (2022) Menger\u2019s theorem for temporal paths (not walks). CoRR, arXiv:abs\/2206.15251"},{"issue":"2","key":"406_CR69","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1093\/bib\/bbaa420","volume":"22","author":"KD Jayanta","year":"2021","unstructured":"Jayanta KD, Giuseppe T, Pierangelo V, Guzzi Pietro H, Swarup R (2021) Data science in unveiling COVID-19 pathogenesis and diagnosis: evolutionary origin to drug repurposing. Brief Bioinform 22(2):855\u2013872","journal-title":"Brief Bioinform"},{"issue":"1","key":"406_CR70","first-page":"5:1","volume":"14","author":"W Jimmy","year":"2019","unstructured":"Jimmy W, Khodaverdian A, Weitz B, Yosef N (2019) Connectivity problems on heterogeneous graphs. Algorithms Mol Biol 14(1):5:1-5:17","journal-title":"Algorithms Mol Biol"},{"issue":"1","key":"406_CR71","doi-asserted-by":"publisher","first-page":"013055","DOI":"10.1088\/1367-2630\/14\/1\/013055","volume":"14","author":"H-H Jo","year":"2012","unstructured":"Jo H-H, Karsai M, Kert\u00e9sz J, Kaski K et al (2012) Circadian pattern and burstiness in human communication activity. New J Phys 14(1):013055","journal-title":"New J Phys"},{"issue":"70","key":"406_CR72","first-page":"1","volume":"21","author":"SM Kazemi","year":"2020","unstructured":"Kazemi SM, Goel R, Jain K, Kobyzev I, Sethi A, Forsyth P, Poupart P (2020) Representation learning for dynamic graphs: a survey. J Mach Learn Res 21(70):1\u201373","journal-title":"J Mach Learn Res"},{"issue":"4","key":"406_CR73","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1006\/jcss.2002.1829","volume":"64","author":"D Kempe","year":"2002","unstructured":"Kempe D, Kleinberg JM, Kumar A (2002) Connectivity and inference problems for temporal networks. J Comput Syst Sci 64(4):820\u2013842","journal-title":"J Comput Syst Sci"},{"key":"406_CR74","doi-asserted-by":"crossref","unstructured":"Khodaverdian A, Yosef N (2022) Directed shortest walk on temporal graphs. bioRxiv","DOI":"10.1101\/2022.07.08.499368"},{"key":"406_CR75","first-page":"4314","volume":"34","author":"B-H Kim","year":"2021","unstructured":"Kim B-H, Ye JC, Kim J-J (2021) Learning dynamic graph representation of brain connectome with spatio-temporal attention. Adv Neural Inf Process Syst 34:4314\u20134327","journal-title":"Adv Neural Inf Process Syst"},{"issue":"12","key":"406_CR76","doi-asserted-by":"publisher","first-page":"3922","DOI":"10.1002\/hbm.25529","volume":"42","author":"Y Kong","year":"2021","unstructured":"Kong Y, Gao S, Yue Y, Hou Z, Shu H, Xie C, Zhang Z, Yuan Y (2021) Spatio-temporal graph convolutional network for diagnosis and treatment response prediction of major depressive disorder from functional connectivity. Hum Brain Mapp 42(12):3922\u20133933","journal-title":"Hum Brain Mapp"},{"issue":"11","key":"406_CR77","doi-asserted-by":"publisher","first-page":"P11005","DOI":"10.1088\/1742-5468\/2011\/11\/P11005","volume":"2011","author":"L Kovanen","year":"2011","unstructured":"Kovanen L, Karsai M, Kaski K, Kert\u00e9sz J, Saram\u00e4ki J (2011) Temporal motifs in time-dependent networks. J Stat Mech 2011(11):P11005","journal-title":"J Stat Mech"},{"issue":"1","key":"406_CR78","doi-asserted-by":"publisher","first-page":"016105","DOI":"10.1103\/PhysRevE.84.016105","volume":"84","author":"PR Kumar","year":"2011","unstructured":"Kumar PR, Jari S (2011) Path lengths, correlations, and centrality in temporal networks. Phys Rev E 84(1):016105","journal-title":"Phys Rev E"},{"issue":"4","key":"406_CR79","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1109\/TCBB.2006.55","volume":"3","author":"V Lacroix","year":"2006","unstructured":"Lacroix V, Fernandes CG, Sagot M-F (2006) Motif search in graphs: Application to metabolic networks. IEEE ACM Trans Comput Biol Bioinform 3(4):360\u2013368","journal-title":"IEEE ACM Trans Comput Biol Bioinform"},{"issue":"1","key":"406_CR80","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1752-0509-4-130","volume":"4","author":"S Lebre","year":"2010","unstructured":"Lebre S, Becq J, Devaux F, Stumpf MPH, Lelandais G (2010) Statistical inference of the time-varying structure of gene-regulation networks. BMC Syst Biol 4(1):1\u201316","journal-title":"BMC Syst Biol"},{"issue":"3","key":"406_CR81","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1109\/TCBB.2017.2749571","volume":"17","author":"M Li","year":"2020","unstructured":"Li M, Meng X, Zheng R, Fang-Xiang W, Li Y, Pan Y, Wang J (2020) Identification of protein complexes by using a spatial and temporal active protein interaction network. IEEE ACM Trans Comput Biol Bioinform 17(3):817\u2013827","journal-title":"IEEE ACM Trans Comput Biol Bioinform"},{"key":"406_CR82","doi-asserted-by":"crossref","unstructured":"Liang S, Shaowei T, Zaiqiao M, Qiang Z (2021) Cross-temporal snapshot alignment for dynamic networks. IEEE Trans Knowledge Data Eng","DOI":"10.1109\/TKDE.2021.3115669"},{"issue":"8","key":"406_CR83","doi-asserted-by":"publisher","first-page":"3841","DOI":"10.1109\/TKDE.2020.3033829","volume":"34","author":"J Liu","year":"2022","unstructured":"Liu J, Chang X, Yin C, Weiqiang W, Song Y (2022) K-core based temporal graph convolutional network for dynamic graphs. IEEE Trans Knowl Data Eng 34(8):3841\u20133853","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"406_CR84","first-page":"012038","volume-title":"Journal of physics conference","author":"C Lvjia","year":"2022","unstructured":"Lvjia C, Shangsong L (2022) Cross-temporal snapshot alignment for dynamic multi-relational networks. Journal of physics conference. IOP Publishing, Bristol, p 012038"},{"key":"406_CR85","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.jcss.2021.08.004","volume":"123","author":"A Marino","year":"2022","unstructured":"Marino A, Silva A (2022) Coloring temporal graphs. J Comput Syst Sci 123:171\u2013185","journal-title":"J Comput Syst Sci"},{"key":"406_CR86","doi-asserted-by":"publisher","DOI":"10.1142\/q0033","volume-title":"A guide to temporal networks","author":"N Masuda","year":"2016","unstructured":"Masuda N, Lambiotte R (2016) A guide to temporal networks. World Scientific"},{"issue":"179","key":"406_CR87","doi-asserted-by":"publisher","first-page":"20210019","DOI":"10.1098\/rsif.2021.0019","volume":"18","author":"N Masuda","year":"2021","unstructured":"Masuda N, Miller JC, Holme P (2021) Concurrency measures in the era of temporal network epidemiology: A review. J R Soc Interface 18(179):20210019","journal-title":"J R Soc Interface"},{"issue":"1","key":"406_CR88","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-021-00374-7","volume":"6","author":"CES Mattsson","year":"2021","unstructured":"Mattsson CES, Takes FW (2021) Trajectories through temporal networks. Appl Netw Sci 6(1):1\u201331","journal-title":"Appl Netw Sci"},{"key":"406_CR89","series-title":"Lecture notes in computer science","first-page":"107","volume-title":"Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5\u20137, 2021, Proceedings","author":"BB Merlin","year":"2021","unstructured":"Merlin BB, Kitty M (2021) Edge exploration of temporal graphs. In: Flocchini Paola, Moura Lucia (eds) Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5\u20137, 2021, Proceedings, vol 12757. Lecture notes in computer science. Springer, Berlin, pp 107\u2013121"},{"issue":"4","key":"406_CR90","doi-asserted-by":"publisher","first-page":"1416","DOI":"10.1007\/s00453-018-0478-6","volume":"81","author":"GB Mertzios","year":"2019","unstructured":"Mertzios GB, Michail O, Spirakis PG (2019) Temporal network optimization subject to connectivity constraints. Algorithmica 81(4):1416\u20131449","journal-title":"Algorithmica"},{"key":"406_CR91","unstructured":"Mertzios G, Molter H, Niedermeier R, Zamaraev V, Zschoche P (2020) Computing maximum matchings in temporal graphs. In: Christophe Paul and Markus Bl\u00e4ser, (eds), 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France, volume 154 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 27:1\u201327:14"},{"issue":"4","key":"406_CR92","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","volume":"12","author":"O Michail","year":"2016","unstructured":"Michail O (2016) An introduction to temporal graphs: an algorithmic perspective. Internet Math 12(4):239\u2013280","journal-title":"Internet Math"},{"key":"406_CR93","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2022.01.017","author":"A Mohan","year":"2022","unstructured":"Mohan A, Pramod KV (2022) Representation learning for temporal networks using temporal random walk and deep autoencoder. Discrete Appl Math. https:\/\/doi.org\/10.1016\/j.dam.2022.01.017","journal-title":"Discrete Appl Math"},{"issue":"4","key":"406_CR94","doi-asserted-by":"publisher","first-page":"041502","DOI":"10.1088\/1478-3975\/abde8d","volume":"18","author":"A Murugan","year":"2021","unstructured":"Murugan A, Husain K, Rust MJ, Hepler C, Bass J, Pietsch JMJ, Swain PS, Jena SG, Toettcher JE, Chakraborty AK et al (2021) Roadmap on biology in time varying environments. Phys Biol 18(4):041502","journal-title":"Phys Biol"},{"issue":"3","key":"406_CR95","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1039\/C0MB00145G","volume":"7","author":"G Nassa","year":"2011","unstructured":"Nassa G, Tarallo R, Guzzi PH, Ferraro L, Cirillo F, Ravo M, Nola E, Baumann M, Nyman TA, Cannataro M et al (2011) Comparative analysis of nuclear estrogen receptor alpha and beta interactomes in breast cancer cells. Mol BioSyst 7(3):667\u2013676","journal-title":"Mol BioSyst"},{"key":"406_CR96","doi-asserted-by":"crossref","unstructured":"Oettershagen L, Mutzel P (2022) Tglib: an open-source library for temporal graph analysis. CoRR,arXiv:abs\/2209.12587","DOI":"10.1109\/ICDMW58026.2022.00160"},{"issue":"1","key":"406_CR97","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-15-335","volume":"15","author":"L Ou-Yang","year":"2014","unstructured":"Ou-Yang L, Dai D-Q, Li X-L, Min W, Zhang X-F, Yang P (2014) Detecting temporal protein complexes from dynamic protein-protein interaction networks. BMC Bioinform 15(1):1\u201314","journal-title":"BMC Bioinform"},{"key":"406_CR98","doi-asserted-by":"crossref","unstructured":"Paranjape A, Benson A, Leskovec J (2017) Motifs in temporal networks. In: Proceedings of the tenth ACM international conference on web search and data mining, pp 601\u2013610","DOI":"10.1145\/3018661.3018731"},{"key":"406_CR99","first-page":"945","volume":"4","author":"L Penghang","year":"2021","unstructured":"Penghang L, Valerio G, Erdem SA (2021) Temporal network motifs Models, limitations, evaluation. IEEE Trans Knowl Data Eng 4:945\u2013957","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"406_CR100","first-page":"1","volume-title":"Temporal network theory","author":"H Petter","year":"2019","unstructured":"Petter H, Jari S (2019) A map of approaches to temporal networks. Temporal network theory. Springer, pp 1\u201324"},{"issue":"1","key":"406_CR101","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1093\/bib\/bbp057","volume":"11","author":"TM Przytycka","year":"2010","unstructured":"Przytycka TM, Singh M, Slonim DK (2010) Toward the dynamic interactome: it\u2019s about time. Briefings Bioinform 11(1):15\u201329","journal-title":"Briefings Bioinform"},{"key":"406_CR102","unstructured":"Redmond U, Cunningham P (2016) Subgraph isomorphism in temporal networks. arXiv preprint arXiv:1605.02174"},{"issue":"2","key":"406_CR103","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/TCBB.2021.3105001","volume":"19","author":"Y Ren","year":"2021","unstructured":"Ren Y, Sarkar A, Veltri P, Ay A, Dobra A, Kahveci T (2021) Pattern discovery in multilayer networks. IEEE\/ACM Trans Comput Biol Bioinf 19(2):741\u2013752","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"issue":"3","key":"406_CR105","first-page":"1","volume":"2","author":"D Riccardo","year":"2021","unstructured":"Riccardo D, Mehdi HM (2021a) Dense sub-networks discovery in temporal networks. SN Comput Sci 2(3):1\u201311","journal-title":"SN Comput Sci"},{"key":"406_CR106","first-page":"553","volume-title":"International Conference on Complex Networks and Their Applications","author":"D Riccardo","year":"2021","unstructured":"Riccardo D, Mehdi HM (2021b) Finding colorful paths in temporal graphs. International Conference on Complex Networks and Their Applications. Springer, pp 553\u2013565"},{"key":"406_CR104","first-page":"940","volume-title":"Encyclopedia of bioinformatics and computational biology","author":"D Riccardo","year":"2019","unstructured":"Riccardo D, Giancarlo M, Italo Z (2019) Graph algorithms. In: Ranganathan Shoba, Gribskov Michael, Nakai Kenta, Sch\u00f6nbach Christian (eds) Encyclopedia of bioinformatics and computational biology, vol 1. Elsevier, pp 940\u2013949"},{"key":"406_CR107","first-page":"469","volume-title":"International Conference on Computational Science","author":"D Riccardo","year":"2022","unstructured":"Riccardo D, Mehdi HM, Italo Z (2022) Dense temporal subgraphs in protein-protein interaction networks. International Conference on Computational Science. Springer, pp 469\u2013480"},{"key":"406_CR108","first-page":"806014","volume":"4","author":"G Roberto","year":"2021","unstructured":"Roberto G, Giovanni M, Alfredo F, Alfredo P (2021) Modit: motif discovery in temporal networks. Front Big Data 4:806014","journal-title":"Front Big Data"},{"key":"406_CR111","doi-asserted-by":"crossref","unstructured":"Rozenshtein P, Gionis A (2019) Mining temporal networks. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, ACM, pp 3225\u20133226","DOI":"10.1145\/3292500.3332295"},{"issue":"4","key":"406_CR109","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1007\/s10115-019-01403-9","volume":"62","author":"P Rozenshtein","year":"2020","unstructured":"Rozenshtein P, Bonchi F, Gionis A, Sozio M, Tatti N (2020) Finding events in temporal networks: segmentation meets densest subgraph discovery. Knowl Inf Syst 62(4):1611\u20131639","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"406_CR110","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s10618-020-00717-5","volume":"35","author":"P Rozenshtein","year":"2021","unstructured":"Rozenshtein P, Tatti N, Gionis A (2021) The network-untangling problem: from interactions to activity timelines. Data Min Knowl Discov 35(1):213\u2013247","journal-title":"Data Min Knowl Discov"},{"key":"406_CR112","volume-title":"Biology: the dynamic science","author":"J Russell Peter","year":"2020","unstructured":"Russell Peter J, Hertz Paul E, Beverly McMillan, Joel Benington (2020) Biology: the dynamic science. Cengage Learning, Omen"},{"issue":"1","key":"406_CR113","first-page":"1","volume":"10","author":"R Sarkis-Onofre","year":"2021","unstructured":"Sarkis-Onofre R, Catal\u00e1-L\u00f3pez F, Aromataris E, Lockwood C (2021) How to properly use the prisma statement. SystRev 10(1):1\u20133","journal-title":"SystRev"},{"issue":"9","key":"406_CR114","doi-asserted-by":"publisher","first-page":"2544","DOI":"10.1093\/bioinformatics\/btac133","volume":"38","author":"G Shawn","year":"2022","unstructured":"Shawn G, Jiang M, Guzzi PH, Milenkovi\u0107 T (2022) Modeling multi-scale data via a network of networks. Bioinformatics 38(9):2544\u20132553","journal-title":"Bioinformatics"},{"key":"406_CR132","unstructured":"\u015eim\u015fek \u00d6, Barto A (2008) Skill characterization based on betweenness. Adv Neural Inform Processing Syst, 21"},{"issue":"1","key":"406_CR115","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s41109-019-0203-7","volume":"4","author":"B Skrlj","year":"2019","unstructured":"Skrlj B, Kralj J, Lavrac N (2019) Py3plex toolkit for visualization and analysis of multilayer networks. Appl Netw Sci 4(1):94","journal-title":"Appl Netw Sci"},{"issue":"4","key":"406_CR116","doi-asserted-by":"publisher","first-page":"413","DOI":"10.14778\/2735496.2735504","volume":"8","author":"C Song","year":"2014","unstructured":"Song C, Ge T, Chen C, Wang J (2014) Event pattern matching over graph streams. Proc VLDB Endowment 8(4):413\u2013424","journal-title":"Proc VLDB Endowment"},{"key":"406_CR117","first-page":"547","volume-title":"Managing and mining graph data","author":"P Srinivasan","year":"2010","unstructured":"Srinivasan P, Shirish T, Duygu U (2010) A survey of graph mining techniques for biological datasets. Managing and mining graph data. Springer, pp 547\u2013580"},{"issue":"7","key":"406_CR118","doi-asserted-by":"publisher","first-page":"e68629","DOI":"10.1371\/journal.pone.0068629","volume":"8","author":"T Takaguchi","year":"2013","unstructured":"Takaguchi T, Masuda N, Holme P (2013) Bursty communication patterns facilitate spreading in a threshold-based epidemic dynamics. PLoS ONE 8(7):e68629","journal-title":"PLoS ONE"},{"key":"406_CR119","doi-asserted-by":"crossref","unstructured":"Tang J, Musolesi M, Mascolo C, Latora V (2009) Temporal distance metrics for social network analysis. In: Proceedings of the 2nd ACM workshop on Online social networks, pp 31\u201336","DOI":"10.1145\/1592665.1592674"},{"issue":"5","key":"406_CR120","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1089\/big.2020.0078","volume":"8","author":"S Thejaswi","year":"2020","unstructured":"Thejaswi S, Gionis A, Lauri J (2020) Finding path motifs in large temporal graphs using algebraic fingerprints. Big Data 8(5):335\u2013362","journal-title":"Big Data"},{"issue":"1","key":"406_CR122","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep39156","volume":"6","author":"WH Thompson","year":"2016","unstructured":"Thompson WH, Fransson P (2016) Bursty properties revealed in large-scale brain networks with a point-based method for dynamic functional connectivity. Sci Rep 6(1):1\u201313","journal-title":"Sci Rep"},{"issue":"2","key":"406_CR121","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1162\/NETN_a_00011","volume":"1","author":"WH Thompson","year":"2017","unstructured":"Thompson WH, Brantefors P, Fransson P (2017) From static to temporal network theory: applications to functional brain connectivity. Network Neurosci 1(2):69\u201399","journal-title":"Network Neurosci"},{"key":"406_CR123","first-page":"1451","volume-title":"2013 IEEE\/ACM International Conference on advances in social networks analysis and mining (ASONAM 2013)","author":"R Ursula","year":"2013","unstructured":"Ursula R, P\u00e1draig C (2013) Temporal subgraph isomorphism. 2013 IEEE\/ACM International Conference on advances in social networks analysis and mining (ASONAM 2013). IEEE, pp 1451\u20131452"},{"issue":"47","key":"406_CR58","doi-asserted-by":"publisher","first-page":"15915","DOI":"10.1523\/JNEUROSCI.2874-10.2010","volume":"30","author":"MP van den Heuvel","year":"2010","unstructured":"van den Heuvel MP, Mandl RCW, Stam CJ, Kahn RS, Pol HEH (2010) Aberrant frontal and temporal complex network structure in schizophrenia: a graph theoretical analysis. J Neurosci 30(47):15915\u201315926","journal-title":"J Neurosci"},{"issue":"3","key":"406_CR126","doi-asserted-by":"publisher","first-page":"036127","DOI":"10.1103\/PhysRevE.73.036127","volume":"73","author":"A V\u00e1zquez","year":"2006","unstructured":"V\u00e1zquez A, Oliveira JG, Dezs\u00f6 Z, Goh K-I, Kondor I, Barab\u00e1si A-L (2006) Modeling bursts and heavy tails in human dynamics. Phys Rev E 73(3):036127","journal-title":"Phys Rev E"},{"issue":"15","key":"406_CR124","doi-asserted-by":"publisher","first-page":"158702","DOI":"10.1103\/PhysRevLett.98.158702","volume":"98","author":"A Vazquez","year":"2007","unstructured":"Vazquez A, Racz B, Lukacs A, Barabasi A-L (2007) Impact of non-poissonian activity patterns on spreading processes. Phys Rev Lett 98(15):158702","journal-title":"Phys Rev Lett"},{"issue":"3","key":"406_CR125","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/j.ipm.2006.10.008","volume":"43","author":"P Veltri","year":"2007","unstructured":"Veltri P, Cannataro M, Tradigo G (2007) Sharing mass spectrometry data in a grid-based distributed proteomics laboratory. Inform Processing Manag 43(3):577\u2013591","journal-title":"Inform Processing Manag"},{"key":"406_CR127","doi-asserted-by":"publisher","first-page":"381","DOI":"10.3389\/fgene.2019.00381","volume":"10","author":"N Walter","year":"2019","unstructured":"Walter N, Marinka Z, Bo W, Jure L, Anna G, Roded S (2019) To embed or not: network embedding as a paradigm in computational biology. Front Genetics 10:381","journal-title":"Front Genetics"},{"key":"406_CR128","doi-asserted-by":"crossref","unstructured":"Wang Z, Natekar P, Tea C, Tamir S, Hakozaki H, Schoeneberg J (2022) Mitotnt: mitochondrial temporal network tracking for 4d live-cell fluorescence microscopy data. bioRxiv","DOI":"10.1101\/2022.08.16.504049"},{"issue":"5","key":"406_CR129","doi-asserted-by":"publisher","first-page":"3504","DOI":"10.1109\/TNSE.2022.3185717","volume":"9","author":"M Xiangmao","year":"2022","unstructured":"Xiangmao M, Wenkai L, Xiang J, Dino BH, Wang Wenkang W, Fang-Xiang LM (2022) Temporal-spatial analysis of the essentiality of hub proteins in protein-protein interaction networks. IEEE Trans Netw Sci Eng 9(5):3504\u20133514","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"406_CR130","doi-asserted-by":"crossref","unstructured":"Zhang Y, Lin L, Yuan P, Jin H (2022) Significant engagement community search on temporal networks: Concepts and algorithms. arXiv preprint arXiv:2206.06350","DOI":"10.1007\/978-3-031-00123-9_20"},{"key":"406_CR131","unstructured":"Zschoche P (2022) Restless temporal path parameterized above lower bounds. CoRR, arXiv:abs\/2203.15862"}],"container-title":["Network Modeling Analysis in Health Informatics and Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13721-022-00406-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13721-022-00406-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13721-022-00406-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T15:02:48Z","timestamp":1744210968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13721-022-00406-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,31]]},"references-count":132,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["406"],"URL":"https:\/\/doi.org\/10.1007\/s13721-022-00406-x","relation":{},"ISSN":["2192-6670"],"issn-type":[{"value":"2192-6670","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,31]]},"assertion":[{"value":"3 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"10"}}