{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:43:19Z","timestamp":1743021799061,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031062193"},{"type":"electronic","value":"9783031062209"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06220-9_5","type":"book-chapter","created":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T12:10:26Z","timestamp":1652530226000},"page":"68-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Phylogenetic Placement Problem: A Hyperbolic Embedding Approach"],"prefix":"10.1007","author":[{"given":"Yueyu","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Puoya","family":"Tabaghi","sequence":"additional","affiliation":[]},{"given":"Siavash","family":"Mirarab","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,15]]},"reference":[{"issue":"2\u20133","key":"5_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/PL00008277","volume":"25","author":"K Atteson","year":"1999","unstructured":"Atteson, K.: The performance of neighbor-joining methods of phylogenetic reconstruction. Algorithmica 25(2\u20133), 251\u2013278 (1999). https:\/\/doi.org\/10.1007\/PL00008277","journal-title":"Algorithmica"},{"key":"5_CR2","unstructured":"Bachmann, G., B\u00e9cigneul, G., Ganea, O.: Constant curvature graph convolutional networks. In: International Conference on Machine Learning, pp. 486\u2013496. PMLR (2020)"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Balaban, M., Jiang, Y., Roush, D., Zhu, Q., Mirarab, S.: Fast and accurate distance-based phylogenetic placement using divide and conquer. Mol. Ecol. Resour. (2021). https:\/\/doi.org\/10.1111\/1755-0998.13527. https:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/1755-0998.13527","DOI":"10.1111\/1755-0998.13527"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Balaban, M., Sarmashghi, S., Mirarab, S.: APPLES: scalable distance-based phylogenetic placement with or without alignments. Syst. Biol. 69(3), 566\u2013578 (2020). https:\/\/doi.org\/10.1093\/sysbio\/syz063. https:\/\/academic.oup.com\/sysbio\/advance-article\/doi\/10.1093\/sysbio\/syz063\/5572672. https:\/\/academic.oup.com\/sysbio\/article\/69\/3\/566\/5572672","DOI":"10.1093\/sysbio\/syz063"},{"issue":"4","key":"5_CR5","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1006\/aama.2001.0759","volume":"27","author":"LJ Billera","year":"2001","unstructured":"Billera, L.J., Holmes, S.P., Vogtmann, K.: Geometry of the space of phylogenetic trees. Adv. Appl. Math. 27(4), 733\u2013767 (2001). https:\/\/doi.org\/10.1006\/aama.2001.0759","journal-title":"Adv. Appl. Math."},{"key":"5_CR6","unstructured":"Chami, I., Ying, Z., R\u00e9, C., Leskovec, J.: Hyperbolic graph convolutional neural networks. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"5_CR7","unstructured":"Chen, W., et al.: Fully hyperbolic neural networks. arXiv preprint arXiv:2105.14686 (2021)"},{"key":"5_CR8","unstructured":"Corso, G., Ying, Z., P\u00e1ndy, M., Veli\u010dkovi\u0107, P., Leskovec, J., Li\u00f2, P.: Neural distance embeddings for biological sequences. In: Advances in Neural Information Processing Systems, vol. 34 (2021)"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Fitch, W.M., Margoliash, E.: Construction of phylogenetic trees. Science 155(3760), 279\u2013284 (1967). https:\/\/doi.org\/10.1126\/science.155.3760.279. https:\/\/www.science.org\/doi\/10.1126\/science.155.3760.279","DOI":"10.1126\/science.155.3760.279"},{"key":"5_CR10","unstructured":"Ganea, O., B\u00e9cigneul, G., Hofmann, T.: Hyperbolic entailment cones for learning hierarchical embeddings. In: International Conference on Machine Learning, pp. 1646\u20131655. PMLR (2018)"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Gascuel, O., Steel, M.: A \u2018stochastic safety radius\u2019 for distance-based tree reconstruction. Algorithmica 74(4), 1386\u20131403 (2016). https:\/\/doi.org\/10.1007\/s00453-015-0005-y. http:\/\/link.springer.com\/10.1007\/s00453-015-0005-y","DOI":"10.1007\/s00453-015-0005-y"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Jiang, Y., Balaban, M., Zhu, Q., Mirarab, S.: DEPP: deep learning enables extending species trees using single genes. bioRxiv (abstract in RECOMB 2021) (2021). https:\/\/doi.org\/10.1101\/2021.01.22.427808. http:\/\/biorxiv.org\/content\/early\/2021\/01\/24\/2021.01.22.427808.abstract","DOI":"10.1101\/2021.01.22.427808"},{"issue":"9","key":"5_CR13","doi-asserted-by":"publisher","first-page":"3100","DOI":"10.1093\/nar\/gkm160","volume":"35","author":"K Lagesen","year":"2007","unstructured":"Lagesen, K., Hallin, P., R\u00f8dland, E.A., St\u00e6rfeldt, H.H., Rognes, T., Ussery, D.W.: RNAmmer: consistent and rapid annotation of ribosomal RNA genes. Nucleic Acids Res. 35(9), 3100\u20133108 (2007)","journal-title":"Nucleic Acids Res."},{"issue":"1\u20132","key":"5_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s00285-016-1018-0","volume":"74","author":"M Layer","year":"2017","unstructured":"Layer, M., Rhodes, J.A.: Phylogenetic trees and Euclidean embeddings. J. Math. Biol. 74(1\u20132), 99\u2013111 (2017). https:\/\/doi.org\/10.1007\/s00285-016-1018-0","journal-title":"J. Math. Biol."},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Lefort, V., Desper, R., Gascuel, O.: FastME 2.0: a comprehensive, accurate, and fast distance-based phylogeny inference program. Mol. Biol. Evol. 32(10), 2798\u20132800 (2015). https:\/\/doi.org\/10.1093\/molbev\/msv150. http:\/\/mbe.oxfordjournals.org\/lookup\/doi\/10.1093\/molbev\/msv150","DOI":"10.1093\/molbev\/msv150"},{"issue":"2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01200757","volume":"15","author":"N Linial","year":"1995","unstructured":"Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. Combinatorica 15(2), 215\u2013245 (1995). https:\/\/doi.org\/10.1007\/BF01200757","journal-title":"Combinatorica"},{"key":"5_CR17","unstructured":"Liu, Q., Nickel, M., Kiela, D.: Hyperbolic graph neural networks. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Mallo, D., De Oliveira Martins, L., Posada, D.: SimPhy: phylogenomic simulation of gene, locus, and species trees. Syst. Biol. 65(2), 334\u2013344 (2016). https:\/\/doi.org\/10.1093\/sysbio\/syv082. http:\/\/sysbio.oxfordjournals.org\/content\/early\/2015\/12\/04\/sysbio.syv082.short?rss=1. https:\/\/academic.oup.com\/sysbio\/article-lookup\/doi\/10.1093\/sysbio\/syv082. http:\/\/www.ncbi.nlm.nih.gov\/pubmed\/265","DOI":"10.1093\/sysbio\/syv082"},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"bpab006","DOI":"10.1093\/biomethods\/bpab006","volume":"6","author":"H Matsumoto","year":"2021","unstructured":"Matsumoto, H., Mimori, T., Fukunaga, T.: Novel metric for hyperbolic phylogenetic tree embeddings. Biol. Methods Protoc. 6(1), bpab006 (2021)","journal-title":"Biol. Methods Protoc."},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Mirarab, S., Warnow, T.: ASTRAL-II: coalescent-based species tree estimation with many hundreds of taxa and thousands of genes. Bioinformatics 31(12), i44\u2013i52 (2015). https:\/\/doi.org\/10.1093\/bioinformatics\/btv234. http:\/\/bioinformatics.oxfordjournals.org\/cgi\/content\/long\/31\/12\/i44. http:\/\/bioinformatics.oxfordjournals.org\/lookup\/doi\/10.1093\/bioinformatics\/btv234","DOI":"10.1093\/bioinformatics\/btv234"},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Nguyen, N.P.D., Mirarab, S., Kumar, K., Warnow, T.: Ultra-large alignments using phylogeny-aware profiles. Genome Biol. 16(1), 124 (2015). https:\/\/doi.org\/10.1186\/s13059-015-0688-z. http:\/\/genomebiology.com\/2015\/16\/1\/124. https:\/\/genomebiology.biomedcentral.com\/articles\/10.1186\/s13059-015-0688-z","DOI":"10.1186\/s13059-015-0688-z"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Parks, D.H., et al.: A standardized bacterial taxonomy based on genome phylogeny substantially revises the tree of life. Nat. Biotechnol. 36(10), 996\u20131004 (2018). https:\/\/doi.org\/10.1038\/nbt.4229. http:\/\/www.nature.com\/articles\/nbt.4229","DOI":"10.1038\/nbt.4229"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Robinson, D., Foulds, L.: Comparison of phylogenetic trees. Math. Biosci. 53(1\u20132), 131\u2013147 (1981). http:\/\/www.sciencedirect.com\/science\/article\/pii\/0025556481900432","DOI":"10.1016\/0025-5564(81)90043-2"},{"key":"5_CR24","unstructured":"Sala, F., De Sa, C., Gu, A., R\u00e9, C.: Representation tradeoffs for hyperbolic embeddings. In: International Conference on Machine Learning, pp. 4460\u20134469. PMLR (2018)"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-25878-7_34","volume-title":"Graph Drawing","author":"R Sarkar","year":"2012","unstructured":"Sarkar, R.: Low distortion delaunay embedding of trees in hyperbolic plane. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 355\u2013366. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-25878-7_34"},{"key":"5_CR26","unstructured":"Shimizu, R., Mukuta, Y., Harada, T.: Hyperbolic neural networks++. arXiv preprint arXiv:2006.08210 (2020)"},{"key":"5_CR27","unstructured":"Skopek, O., Ganea, O.E., B\u00e9cigneul, G.: Mixed-curvature variational autoencoders (2020)"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Tabaghi, P., Dokmani\u0107, I.: Hyperbolic distance matrices. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1728\u20131738 (2020)","DOI":"10.1145\/3394486.3403224"},{"key":"5_CR29","unstructured":"Tabaghi, P., Peng, J., Milenkovic, O., Dokmani\u0107, I.: Geometry of similarity comparisons. arXiv preprint arXiv:2006.09858 (2020)"},{"key":"5_CR30","doi-asserted-by":"publisher","unstructured":"de Vienne, D.M., Ollier, S., Aguileta, G.: Phylo-MCOA: a fast and efficient method to detect outlier genes and species in phylogenomics using multiple co-inertia analysis. Mol. Biol. Evol. 29(6), 1587\u20131598 (2012). https:\/\/doi.org\/10.1093\/molbev\/msr317. https:\/\/academic.oup.com\/mbe\/article-lookup\/doi\/10.1093\/molbev\/msr317","DOI":"10.1093\/molbev\/msr317"},{"key":"5_CR31","doi-asserted-by":"publisher","unstructured":"Zhu, Q., et al.: Phylogenomics of 10,575 genomes reveals evolutionary proximity between domains Bacteria and Archaea. Nat. Commun. 10(1), 5477 (2019). https:\/\/doi.org\/10.1038\/s41467-019-13443-4. http:\/\/www.nature.com\/articles\/s41467-019-13443-4","DOI":"10.1038\/s41467-019-13443-4"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06220-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T12:11:42Z","timestamp":1652530302000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06220-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031062193","9783031062209"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06220-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RECOMB-CG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"RECOMB International Workshop on Comparative Genomics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"La Jolla, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rcg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/recombcg2022.usask.ca\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}