{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T23:00:08Z","timestamp":1648767608886},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,5,19]],"date-time":"2015-05-19T00:00:00Z","timestamp":1431993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s11786-015-0233-1","type":"journal-article","created":{"date-parts":[[2015,5,18]],"date-time":"2015-05-18T04:38:54Z","timestamp":1431923934000},"page":"437-441","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Spiders can be Recognized by Counting Their Legs"],"prefix":"10.1007","volume":"9","author":[{"given":"Sarah J.","family":"Berkemer","sequence":"first","affiliation":[]},{"given":"Ricardo R. C.","family":"Chaves","sequence":"additional","affiliation":[]},{"given":"Adrian","family":"Fritz","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Hellmuth","sequence":"additional","affiliation":[]},{"given":"Maribel","family":"Hernandez-Rosales","sequence":"additional","affiliation":[]},{"given":"Peter F.","family":"Stadler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,19]]},"reference":[{"key":"233_CR1","first-page":"264","volume":"11","author":"P. Erd\u0151s","year":"1960","unstructured":"Erd\u0151s P., Gallai T.: Gr\u00e1fok el\u0151\u00edrt foksz\u00e1m\u00fa pontokkal. Mat. Lapok 11, 264\u2013274 (1960)","journal-title":"Mat. Lapok"},{"key":"233_CR2","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1137\/0110037","volume":"10","author":"S.L. Hakimi","year":"1962","unstructured":"Hakimi S.L.: On realizability of a set of integers as degrees of the vertices of a linear graph. J. Soc. Ind. Appl. Math. 10, 496\u2013506 (1962)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"233_CR3","doi-asserted-by":"crossref","first-page":"477","DOI":"10.21136\/CPM.1955.108220","volume":"80","author":"V. Havel","year":"1955","unstructured":"Havel V.: A remark on the existence of finite graphs. \u010casopis Pro p\u011bstov\u00e1n\u00ed Matematiky (in Czech) 80, 477\u2013480 (1955)","journal-title":"\u010casopis Pro p\u011bstov\u00e1n\u00ed Matematiky (in Czech)"},{"issue":"1\u20132","key":"233_CR4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s00285-012-0525-x","volume":"66","author":"M. Hellmuth","year":"2013","unstructured":"Hellmuth M., Hernandez-Rosales M., Huber K.T., Moulton V., Stadler P.F., Wieseke N.: Orthology relations, symbolic ultrametrics, and cographs. J. Math. Biol. 66(1\u20132), 399\u2013420 (2013)","journal-title":"J. Math. Biol."},{"issue":"7","key":"233_CR5","doi-asserted-by":"crossref","first-page":"2058","DOI":"10.1073\/pnas.1412770112","volume":"112","author":"M. Hellmuth","year":"2015","unstructured":"Hellmuth M., Wieseke N., Lechner M., Lenhof H.-P., Middendorf M., Stadler P.F.: Phylogenomics with paralogs. PNAS 112(7), 2058\u20132063 (2015)","journal-title":"PNAS"},{"issue":"Suppl 19","key":"233_CR6","doi-asserted-by":"crossref","first-page":"S6","DOI":"10.1186\/1471-2105-13-S19-S6","volume":"13","author":"M. Hernandez-Rosales","year":"2012","unstructured":"Hernandez-Rosales M., Hellmuth M., Wieseke N., Huber K.T., Moulton P.F., Stadler V.: From event-labeled gene trees to species trees. BMC Bioinform. 13(Suppl 19), S6 (2012)","journal-title":"BMC Bioinform."},{"key":"233_CR7","unstructured":"Ho\u00e0ng, C.T.: Perfect graphs. PhD thesis, School of Computer Science, McGill University, Montreal (1985)"},{"key":"233_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/sapm198981179","volume":"81","author":"B. Jamison","year":"1989","unstructured":"Jamison B., Olariu S.: P4-reducible-graphs\u2014a class of uniquely tree of uniquely tree-representable graphs. Stud. Appl. Math. 81, 79\u201387 (1989)","journal-title":"Stud. Appl. Math."},{"key":"233_CR9","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1137\/0221027","volume":"21","author":"B. Jamison","year":"1992","unstructured":"Jamison B., Olariu S.: Recognizing P4-sparse graphs in linear time. SIAM J. Comput. 21, 381\u2013406 (1992)","journal-title":"SIAM J. Comput."},{"key":"233_CR10","doi-asserted-by":"crossref","unstructured":"Liu, Y., Wang, J., Guo, J., Chen, J.: Cograph editing: complexity and parametrized algorithms. In: Fu, B., Du, D.Z. (eds.) COCOON 2011. Lect. Notes Comp. Sci., vol. 6842, pp. 110\u2013121. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-22685-4_10"},{"key":"233_CR11","doi-asserted-by":"crossref","unstructured":"Liu, Y., Wang, J., Guo, J., Chen, J.: Complexity and parameterized algorithms for cograph editing. Theor. Comput. Sci. 461(0), 45\u201354 (2012)","DOI":"10.1016\/j.tcs.2011.11.040"},{"key":"233_CR12","doi-asserted-by":"crossref","first-page":"1250008","DOI":"10.1142\/S1793830912500085","volume":"4","author":"J. Nastos","year":"2012","unstructured":"Nastos J., Gao Y.: Bounded search tree algorithms for parameterized cograph deletion: efficient branching rules by exploiting structures of special graph classes. Discret. Math. Algorithms Appl. 4, 1250008 (2012)","journal-title":"Discret. Math. Algorithms Appl."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-015-0233-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-015-0233-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-015-0233-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T08:46:33Z","timestamp":1599036393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-015-0233-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,19]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["233"],"URL":"https:\/\/doi.org\/10.1007\/s11786-015-0233-1","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,19]]}}}