1 line
15 KiB
Text
1 line
15 KiB
Text
|
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T04:33:02Z","timestamp":1688013182496},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031349522","type":"print"},{"value":"9783031349539","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-34953-9_17","type":"book-chapter","created":{"date-parts":[[2023,6,28]],"date-time":"2023-06-28T15:04:08Z","timestamp":1687964648000},"page":"217-230","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Annotation-Free Identification of\u00a0Potential Synteny Anchors"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0009-0003-3439-5813","authenticated-orcid":false,"given":"Karl","family":"K\u00e4ther","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-5807-2865","authenticated-orcid":false,"given":"Steffen","family":"Lemke","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5016-5191","authenticated-orcid":false,"given":"Peter F.","family":"Stadler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,29]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44888-8_1","volume-title":"Combinatorial Pattern Matching","author":"MI Abouelhoda","year":"2003","unstructured":"Abouelhoda, M.I., Ohlebusch, E.: Multiple genome alignment: chaining algorithms revisited. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 1\u201316. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44888-8_1"},{"issue":"5","key":"17_CR2","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1038\/nmeth.3830","volume":"13","author":"AM Altenhoff","year":"2016","unstructured":"Altenhoff, A.M., et al.: Standardized benchmarking in the quest for orthologs. Nat. Methods 13(5), 425\u2013430 (2016). https:\/\/doi.org\/10.1038\/nmeth.3830","journal-title":"Nat. Methods"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1038\/s41586-020-2871-y","volume":"587","author":"J Armstrong","year":"2020","unstructured":"Armstrong, J., et al.: Progressive Cactus is a multiple-genome aligner for the thousand-genome era. Nature 587, 246\u2013251 (2020). https:\/\/doi.org\/10.1038\/s41586-020-2871-y","journal-title":"Nature"},{"issue":"22","key":"17_CR4","doi-asserted-by":"publisher","first-page":"R869","DOI":"10.1016\/j.cub.2003.10.046","volume":"13","author":"RS Cohen","year":"2003","unstructured":"Cohen, R.S.: Halo: a guiding light for transport. Curr. Biol. 13(22), R869\u2013R870 (2003). https:\/\/doi.org\/10.1016\/j.cub.2003.10.046","journal-title":"Curr. Biol."},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1186\/s13059-019-1832-y","volume":"20","author":"DM Emms","year":"2009","unstructured":"Emms, D.M., Kelly, S.: OrthoFinder: phylogenetic orthology inference for comparative genomics. Genome Biol. 20(1), 238 (2009). https:\/\/doi.org\/10.1186\/s13059-019-1832-y","journal-title":"Genome Biol."},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Gramates, L.S., et al.: FlyBase: a guided tour of highlighted features. Genetics 220(4), iyac035 (2022). https:\/\/doi.org\/10.
|