1 line
13 KiB
Plaintext
1 line
13 KiB
Plaintext
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,25]],"date-time":"2023-03-25T02:10:54Z","timestamp":1679710254232},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["STA 850\/49-1"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1016\/j.dam.2023.01.015","type":"journal-article","created":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T23:02:13Z","timestamp":1675292533000},"page":"104-125","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quasi-best match graphs"],"prefix":"10.1016","volume":"331","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-7334-669X","authenticated-orcid":false,"given":"Annachiara","family":"Korchmaros","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0025-3097","authenticated-orcid":false,"given":"David","family":"Schaller","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-1620-5508","authenticated-orcid":false,"given":"Marc","family":"Hellmuth","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5016-5191","authenticated-orcid":false,"given":"Peter F.","family":"Stadler","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2023.01.015_b1","doi-asserted-by":"crossref","first-page":"168","DOI":"10.4169\/002557010X494814","article-title":"The graph menagerie: Abstract algebra and the mad veterinarian","volume":"83","author":"Abrams","year":"2010","journal-title":"Math. Mag."},{"key":"10.1016\/j.dam.2023.01.015_b2","first-page":"331","article-title":"On certain partitions of finite directed graphs and of finite automata","volume":"6","author":"\u00c1d\u00e1m","year":"1984","journal-title":"Acta Cybernet."},{"key":"10.1016\/j.dam.2023.01.015_b3","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1137\/0210030","article-title":"Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions","volume":"10","author":"Aho","year":"1981","journal-title":"SIAM J. Comput."},{"issue":"e1002514","key":"10.1016\/j.dam.2023.01.015_b4","article-title":"Resolving the ortholog conjecture: orthologs tend to be weakly, but significantly, more similar in function than paralogs","volume":"8","author":"Altenhoff","year":"2012","journal-title":"PLoS Comput. Biol."},{"key":"10.1016\/j.dam.2023.01.015_b5","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1006\/aama.1995.1020","article-title":"Extension operations on sets of leaf-labeled trees","volume":"16","author":"Bryant","year":"1995","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/j.dam.2023.01.015_b6","doi-asserted-by":"crossref","first-page":"R10","DOI":"10.37236\/1627","article-title":"Generating a random sink-free orientation in quadratic time","volume":"9","author":"Cohn","year":"2002","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.dam.2023.01.015_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2021.112497","article-title":"Oriented bipartite graphs and the goldbach graph","volume":"344","author":"Das","year":"2021","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2023.01.015_b8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.2307\/2412448","article-title":"Distinguishing homologous from analogous proteins","volume":"19","author":"Fitch","year":"1970","journal-title":"Syst. Zool."},{"key":"10.1016\/j.dam.2023.01.015_b9","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/S0168-9525(00)02005-9","article-title":"Homology: a personal view on some of the problems","volume":"16","author":"Fitch","year":"2000","journal-title":"Trends Genet."},{"key":"10.1016\/j.dam.2023.01.015_b10","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1038\/nrg1603","article-title":"Phylogenomics and the reconstruction of the tree of life","volume":"6","author":"Fr\u00e9d\u00e9ric","year":"2005","journal-title":"Nature. Rev. Genet."},{"key":"10.1016\/j.dam.2023.01.015_b11","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1038\/nrg3456","article-title":"Functional and evolutionary implications of gene orthology","volume":"14","author":"Gabald\u00f3n","year":"2013","journal-title":"Nature. Rev. Genet."},{"key":"10.1016\/j.dam.2023.01.015_b12","doi-asserted-by":"crossref","first-page":"2015","DOI":"10.1007\/s00285-019-01332-9","article-title":"Best match graphs","volume":"78","author":"Gei\u00df","year":"2019","journal-title":"J. Math. Biol."},{"key":"10.1016\/j.dam.2023.01.015_b13","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1007\/s00285-020-01469-y","article-title":"Best match graphs and reconciliation of gene trees with species trees","volume":"80","author":"Gei\u00df","year":"2020","journal-title":"J. Math. Biol."},{"key":"10.1016\/j.dam.2023.01.015_b14","doi-asserted-by":"crossref","first-page":"S3","DOI":"10.1186\/1471-2105-15-S13-S3","article-title":"Refining discordant gene trees","volume":"15","author":"G\u00f3recki","year":"2014","journal-title":"BMC Bioinformatics"},{"key":"10.1016\/j.dam.2023.01.015_b15","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1515\/crll.1964.213.174","article-title":"Extended topology: Structure of isotonic functions","volume":"213","author":"Hammer","year":"1964","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/j.dam.2023.01.015_b16","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1142\/S0219720006001709","article-title":"Inferring phylogenetic relationships avoiding forbidden rooted triplets","volume":"4","author":"He","year":"2006","journal-title":"J. Bioinform. Comput. Biol."},{"key":"10.1016\/j.dam.2023.01.015_b17","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1186\/s12864-020-07132-6","article-title":"Progress in quickly finding orthologs as reciprocal best hits: comparing blast, last, diamond and MMseqs2","volume":"21","author":"Hern\u00e1ndez-Salmer\u00f3n","year":"2020","journal-title":"BMC Genomics"},{"key":"10.1016\/j.dam.2023.01.015_b18","doi-asserted-by":"crossref","first-page":"2264","DOI":"10.1073\/pnas.87.6.2264","article-title":"Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes","volume":"87","author":"Karlin","year":"1990","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"10.1016\/j.dam.2023.01.015_b19","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1146\/annurev.genet.39.073003.114725","article-title":"Orthologs, paralogs, and evolutionary genomics","volume":"39","author":"Koonin","year":"2005","journal-title":"Annu. Rev. Genet."},{"key":"10.1016\/j.dam.2023.01.015_b20","unstructured":"A. Korchmaros, Circles and Paths in 2-Colored Best Match Graphs, Tech. Rep., 2020, arXiv math.CO\/2006.04100v1."},{"key":"10.1016\/j.dam.2023.01.015_b21","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/j.dam.2021.08.007","article-title":"The structure of 2-colored best match graphs","volume":"304","author":"Korchmaros","year":"2021","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2023.01.015_b22","doi-asserted-by":"crossref","DOI":"10.1186\/gb-2002-3-3-preprint0002","article-title":"Using orthologous and paralogous proteins to identify specificity determining residues","volume":"3","author":"Mirny","year":"2002","journal-title":"Genome Biol."},{"key":"10.1016\/j.dam.2023.01.015_b23","doi-asserted-by":"crossref","first-page":"165","DOI":"10.3389\/fgene.2017.00165","article-title":"New tools in orthology analysis: A brief review of promising perspectives","volume":"8","author":"Nichio","year":"2017","journal-title":"Front. Genet."},{"key":"10.1016\/j.dam.2023.01.015_b24","doi-asserted-by":"crossref","DOI":"10.1155\/2014\/642089","article-title":"Reconciliation of gene and species trees","volume":"2014","author":"Rusin","year":"2014","journal-title":"Biomed Res. Int."},{"key":"10.1016\/j.dam.2023.01.015_b25","doi-asserted-by":"crossref","first-page":"132","DOI":"10.3390\/genes9030132","article-title":"Testing for polytomies in phylogenetic species trees using quartet frequencies","volume":"9","author":"Sayyari","year":"2018","journal-title":"Genes"},{"key":"10.1016\/j.dam.2023.01.015_b26","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s00285-021-01601-6","article-title":"Corrigendum to \u201cBest Match Graphs\u201d","volume":"82","author":"Schaller","year":"2021","journal-title":"J. Math. Biol."},{"key":"10.1016\/j.dam.2023.01.015_b27","series-title":"Algorithms for Computational Biology","first-page":"82","article-title":"Best match graphs with binary trees","volume":"vol. 12715","author":"Schaller","year":"2021"},{"key":"10.1016\/j.dam.2023.01.015_b28","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/s00285-021-01564-8","article-title":"Complete characterization of incorrect orthology assignments in best match graphs","volume":"82","author":"Schaller","year":"2021","journal-title":"J. Math. Biol."},{"key":"10.1016\/j.dam.2023.01.015_b29","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.tcs.2021.02.037","article-title":"Complexity of modification problems for best match graphs","volume":"865","author":"Schaller","year":"2021","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2023.01.015_b30","series-title":"Phylogenetics","author":"Semple","year":"2003"},{"key":"10.1016\/j.dam.2023.01.015_b31","series-title":"Comparative Genomics, Vol. 1704","first-page":"1","article-title":"Gene phylogenies and orthologous groups","author":"Setubal","year":"2018"},{"key":"10.1016\/j.dam.2023.01.015_b32","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1111\/syen.12406","article-title":"Phylogenomics \u2013 principles, opportunities and pitfalls of big-data phylogenetics","volume":"45","author":"Young","year":"2020","journal-title":"Sys. Entomol."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X23000173?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X23000173?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,3,25]],"date-time":"2023-03-25T01:57:32Z","timestamp":1679709452000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X23000173"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":32,"alternative-id":["S0166218X23000173"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.dam.2023.01.015","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":["Applied Mathematics","Discrete Mathematics and Combinatorics"],"published":{"date-parts":[[2023,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Quasi-best match graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2023.01.015","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}} |