{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T18:38:17Z","timestamp":1725993497576},"reference-count":33,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780128114322"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1016\/b978-0-12-809633-8.20423-8","type":"book-chapter","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T07:39:26Z","timestamp":1516261166000},"page":"933-939","source":"Crossref","is-referenced-by-count":0,"title":["Graph Isomorphism"],"prefix":"10.1016","author":[{"given":"Riccardo","family":"Dondi","sequence":"first","affiliation":[]},{"given":"Giancarlo","family":"Mauri","sequence":"additional","affiliation":[]},{"given":"Italo","family":"Zoppis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","article-title":"Statistical mechanics of complex networks","volume":"74","author":"Albert","year":"2002","journal-title":"Review of Modern Physics"},{"issue":"4","key":"10.1016\/B978-0-12-809633-8.20423-8_bib2","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","article-title":"Color-coding","volume":"42","author":"Alon","year":"1995","journal-title":"Journal of the ACM"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib3","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1038\/nrg2102","article-title":"Network motifs: Theory and experimental approaches","volume":"8","author":"Alon","year":"2007","journal-title":"Nature Reviews Genetics"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib4","doi-asserted-by":"crossref","unstructured":"Babai, L., 2016. Graph isomorphism in quasipolynomial time (extended abstract). In: Wichs, D., Mansour, Y. (Eds.), Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18\u201321, 2016, ACM. pp. 684\u2013697. Available at: http:\/\/doi.acm.org\/10.1145\/2897518.2897542.","DOI":"10.1145\/2897518.2897542"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib5","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1089\/cmb.2013.0112","article-title":"Model ing alternative splicing variants from rna-seq data with isoform graphs","volume":"21","author":"Beretta","year":"2014","journal-title":"Journal of Computational Biology"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib6","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1007\/s00453-015-9981-1","article-title":"Constrained multilinear detection and generalized graph motifs","volume":"74","author":"Bj\u00f6rklund","year":"2016","journal-title":"Algorithmica"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib7","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1007\/s00607-012-0263-3","article-title":"Finding large k-clubs in undirected graphs","volume":"95","author":"Chang","year":"2013","journal-title":"Computing"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib8","doi-asserted-by":"crossref","unstructured":"Cook, S.A., 1971. The complexity of theorem-proving procedures, In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, May 3\u20135, 1971, pp. 151\u2013158. Ohio, United States: Shaker Heights doi:10.1145\/800157.805047.","DOI":"10.1145\/800157.805047"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib9","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.jda.2010.09.002","article-title":"Complexity issues in vertex-colored graph pattern matching","volume":"9","author":"Dondi","year":"2011","journal-title":"Journal of Discrete Algorithms"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib10","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.tcs.2012.08.023","article-title":"Finding approximate and constrained motifs in graphs","volume":"483","author":"Dondi","year":"2013","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib11","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1137\/S0097539792228228","article-title":"Fixed-parameter tractability and completeness I: Basic results","volume":"24","author":"Downey","year":"1995","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","article-title":"Fixed-parameter tractability and completeness II: On completeness for W[1]","volume":"141","author":"Downey","year":"1995","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib13","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1016\/j.jcss.2010.07.003","article-title":"Upper and lower bounds for finding connected motifs in vertex-colored graphs","volume":"77","author":"Fellows","year":"2011","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib14","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A., 1986. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design (extended abstract), In: 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27\u201329 October 1986, IEEE Computer Society. pp. 174\u2013187. Available at: https:\/\/doi.org\/10.1109\/SFCS.1986.47.","DOI":"10.1109\/SFCS.1986.47"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib15","unstructured":"Hellmuth, M., Wieseke, N., Lechner, M., et al., 2014. Phylogenomics with paralogs. PNAS."},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib16","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1038\/35036627","article-title":"The large-scale organization of metabolic networks","volume":"407","author":"Jeong","year":"2000","journal-title":"Nature"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib17","doi-asserted-by":"crossref","unstructured":"Karp, R.M., 1972. Reducibility among combinatorial problems, In: Proceedings of a symposium on the Complexity of Computer Computations, held on March 20\u201322, 1972, at the IBM Thomas J. Watson Research Center, York-Town Heights, New York, pp. 85\u2013103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib18","doi-asserted-by":"crossref","first-page":"21","DOI":"10.3390\/a9010021","article-title":"Multivariate algorithmics for finding cohesive subnetworks","volume":"9","author":"Komusiewicz","year":"2016","journal-title":"Algorithms"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib19","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1109\/TCBB.2006.55","article-title":"Motif search in graphs: Application to metabolic networks","volume":"3","author":"Lacroix","year":"2006","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib20","doi-asserted-by":"crossref","unstructured":"Lacroix, V., Sammeth, M., Guigo, R., Bergeron, A., 2008. Exact transcriptome reconstruction from short sequence reads. In: Crandall, K.A., Lagergren, J. (Eds.), Algorithms in Bioinformatics, Proceedings of the 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15\u201319, 2008, Springer. pp. 50\u201363. DOI:10.1007\/978-3-540-87361-7_5.","DOI":"10.1007\/978-3-540-87361-7_5"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib21","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1186\/s13015-016-0067-7","article-title":"The link between orthology relations and gene trees: A correction perspective","volume":"11","author":"Lafond","year":"2016","journal-title":"Algorithms for Molecular Biology"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib22","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","article-title":"Survey: Deeper inside pagerank","volume":"1","author":"Langville","year":"2003","journal-title":"Internet Mathematics"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib23","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.dam.2016.04.026","article-title":"Deterministic parameterized algorithms for the graph motif problem","volume":"213","author":"Pinter","year":"2016","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib24","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1007\/s11590-011-0311-5","article-title":"Parameterized computational complexity of finding small-diameter subgraphs","volume":"6","author":"Sch\u00e4fer","year":"2012","journal-title":"Optimization Letters"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib25","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1089\/cmb.2006.13.133","article-title":"Efficient algorithms for detecting signaling pathways in protein interaction networks","volume":"13","author":"Scott","year":"2006","journal-title":"Journal of Computational Biology"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib26","doi-asserted-by":"crossref","first-page":"12123","DOI":"10.1073\/pnas.2032324100","article-title":"Protein complexes and functional modules in molecular networks","volume":"100","author":"Spirin","year":"2003","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib27","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u05f3small-world\u05f3 networks","author":"Watts","year":"1998","journal-title":"Nature"},{"key":"10.1016\/B978-0-12-809633-8.20423-8_bib28","doi-asserted-by":"crossref","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","article-title":"Linear degree extractors and the inapproximability of max clique and chromatic number","volume":"3","author":"Zuckerman","year":"2007","journal-title":"Theory of Computing"},{"year":"2002","series-title":"Digraphs \u2013 Theory, Algorithms and Applications","author":"Bang-Jensen","key":"10.1016\/B978-0-12-809633-8.20423-8_fur1"},{"year":"2016","series-title":"Network Science","author":"Baraba\u00b4si","key":"10.1016\/B978-0-12-809633-8.20423-8_fur2"},{"year":"2005","series-title":"Graph Theory (Graduate Texts in Mathematics)","author":"Diestel","key":"10.1016\/B978-0-12-809633-8.20423-8_fur3"},{"year":"2013","series-title":"Fundamentals of Parameterized Complexity","author":"Downey","key":"10.1016\/B978-0-12-809633-8.20423-8_fur4"},{"year":"2006","series-title":"Invitation to Fixed-Parameter Algorithms","author":"Niedermeier","key":"10.1016\/B978-0-12-809633-8.20423-8_fur5"}],"container-title":["Encyclopedia of Bioinformatics and Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780128096338204238?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780128096338204238?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T13:53:00Z","timestamp":1570629180000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780128096338204238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9780128114322"],"references-count":33,"URL":"https:\/\/doi.org\/10.1016\/b978-0-12-809633-8.20423-8","relation":{},"subject":[],"published":{"date-parts":[[2019]]}}}