{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:40:25Z","timestamp":1743082825066,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030181734"},{"type":"electronic","value":"9783030181741"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-18174-1_12","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:15:30Z","timestamp":1558347330000},"page":"167-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Using INC Within Divide-and-Conquer Phylogeny Estimation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5476-8451","authenticated-orcid":false,"given":"Thien","family":"Le","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron","family":"Sy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5553-3312","authenticated-orcid":false,"given":"Erin K.","family":"Molloy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiuyi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satish","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7717-3514","authenticated-orcid":false,"given":"Tandy","family":"Warnow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,13]]},"reference":[{"issue":"Suppl 6","key":"12_CR1","doi-asserted-by":"publisher","first-page":"S7","DOI":"10.1186\/1471-2164-15-S6-S7","volume":"15","author":"MS Bayzid","year":"2014","unstructured":"Bayzid, M.S., Hunt, T., Warnow, T.: Disk covering methods improve phylogenomic analyses. BMC Genomics 15(Suppl 6), S7 (2014)","journal-title":"BMC Genomics"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"W573","DOI":"10.1093\/nar\/gks485","volume":"40","author":"A Boc","year":"2012","unstructured":"Boc, A., Diallo, A., Makarenkov, V.: T-REX: a web server for inferring, validating and visualizing phylogenetic trees and networks. Nucleic Acids Res. 40, W573\u2013W579 (2012)","journal-title":"Nucleic Acids Res."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0095-8956(74)90047-1","volume":"17","author":"P Buneman","year":"1974","unstructured":"Buneman, P.: A note on the metric properties of trees. J. Comb. Theory (B) 17, 48\u201350 (1974)","journal-title":"J. Comb. Theory (B)"},{"issue":"2","key":"12_CR4","first-page":"217","volume":"16","author":"P Erd\u00f6s","year":"1997","unstructured":"Erd\u00f6s, P., Steel, M., Sz\u00e9kely, L., Warnow, T.: Local quartet splits of a binary tree infer all quartet splits via one dyadic inference rule. Comput. Artif. Intell. 16(2), 217\u2013227 (1997)","journal-title":"Comput. Artif. Intell."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1002\/(SICI)1098-2418(199903)14:2<153::AID-RSA3>3.0.CO;2-R","volume":"14","author":"P Erd\u00f6s","year":"1999","unstructured":"Erd\u00f6s, P., Steel, M., Sz\u00e9kely, L., Warnow, T.: A few logs suffice to build (almost) all trees (I). Random Struct. Algorithms 14, 153\u2013184 (1999)","journal-title":"Random Struct. Algorithms"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0304-3975(99)00028-6","volume":"221","author":"P Erd\u00f6s","year":"1999","unstructured":"Erd\u00f6s, P., Steel, M., Sz\u00e9kely, L., Warnow, T.: A few logs suffice to build (almost) all trees (II). Theor. Comput. Sci. 221, 77\u2013118 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1879","DOI":"10.1093\/molbev\/msp098","volume":"26","author":"W Fletcher","year":"2009","unstructured":"Fletcher, W., Yang, Z.: INDELible: a flexible simulator of biological sequence evolution. Mol. Biol. Evol. 26(8), 1879\u20131888 (2009)","journal-title":"Mol. Biol. Evol."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/B978-1-4832-3211-9.50009-7","volume-title":"Mammalian Protein Metabolism","author":"TH Jukes","year":"1969","unstructured":"Jukes, T.H., Cantor, C.R.: Evolution of protein molecules. In: Munro, H. (ed.) Mammalian Protein Metabolism, vol. 3, pp. 21\u2013132. Academic Press, New York (1969)"},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.mbs.2005.11.003","volume":"199","author":"MR Lacey","year":"2006","unstructured":"Lacey, M.R., Chang, J.T.: A signal-to-noise analysis of phylogeny estimation by neighbor-joining: insufficiency of polynomial length sequences. Math. Biosci. 199(2), 188\u2013215 (2006)","journal-title":"Math. Biosci."},{"key":"12_CR10","unstructured":"Le, T.: GitHub site for the INC and constrained - INC software (2019). \n                      https:\/\/github.com\/steven-le-thien\/INC"},{"key":"12_CR11","unstructured":"Le, T., Sy, A., Molloy, E., Zhang, Q., Rao, S., Warnow, T.: Using INC within divide-and-conquer phylogeny estimation - datasets (2019). \n                      https:\/\/databank.illinois.edu\/datasets\/IDB-8518809"},{"issue":"10","key":"12_CR12","doi-asserted-by":"publisher","first-page":"2798","DOI":"10.1093\/molbev\/msv150","volume":"32","author":"V Lefort","year":"2015","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). \n                      https:\/\/doi.org\/10.1093\/molbev\/msv150","journal-title":"Mol. Biol. Evol."},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1093\/sysbio\/syr095","volume":"61","author":"K Liu","year":"2012","unstructured":"Liu, K., et al.: SAT\u00e9-II: very fast and accurate simultaneous estimation of multiple sequence alignments and phylogenetic trees. Syst. Biol. 61(1), 90\u2013106 (2012). \n                      https:\/\/doi.org\/10.1093\/sysbio\/syr095","journal-title":"Syst. Biol."},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1093\/sysbio\/46.3.523","volume":"46","author":"W Maddison","year":"1997","unstructured":"Maddison, W.: Gene trees in species trees. Syst. Biol. 46(3), 523\u2013536 (1997)","journal-title":"Syst. Biol."},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1093\/sysbio\/syv082","volume":"65","author":"D Mallo","year":"2016","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). \n                      https:\/\/doi.org\/10.1093\/sysbio\/syv082","journal-title":"Syst. Biol."},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1089\/cmb.2014.0156","volume":"22","author":"S Mirarab","year":"2015","unstructured":"Mirarab, S., Nguyen, N., Wang, L.S., Guo, S., Kim, J., Warnow, T.: PASTA: ultra-large multiple sequence alignment of nucleotide and amino acid sequences. J. Comput. Biol. 22, 377\u2013386 (2015)","journal-title":"J. Comput. Biol."},{"issue":"17","key":"12_CR17","doi-asserted-by":"publisher","first-page":"i541","DOI":"10.1093\/bioinformatics\/btu462","volume":"30","author":"S Mirarab","year":"2014","unstructured":"Mirarab, S., Reaz, R., Bayzid, M.S., Zimmermann, T., Swenson, M.S., Warnow, T.: ASTRAL: genome-scale coalescent-based species tree estimation. Bioinformatics 30(17), i541\u2013i548 (2014)","journal-title":"Bioinformatics"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-030-00834-5_15","volume-title":"Comparative Genomics","author":"EK Molloy","year":"2018","unstructured":"Molloy, E.K., Warnow, T.: NJMerge: a generic technique for scaling phylogeny estimation methods and its application to species trees. In: Blanchette, M., Ouangraoua, A. (eds.) RECOMB-CG 2018. LNCS, vol. 11183, pp. 260\u2013276. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-030-00834-5_15"},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Molloy, E.K., Warnow, T.: Statistically consistent divide-and-conquer pipelines for phylogeny estimation using NJMerge. bioRxiv (2018). \n                      https:\/\/doi.org\/10.1101\/469130","DOI":"10.1101\/469130"},{"issue":"12","key":"12_CR20","doi-asserted-by":"publisher","first-page":"i274","DOI":"10.1093\/bioinformatics\/bts218","volume":"28","author":"S Nelesen","year":"2012","unstructured":"Nelesen, S., Liu, K., Wang, L.S., Linder, C.R., Warnow, T.: DACTAL: divide-and-conquer trees (almost) without alignments. Bioinformatics 28(12), i274\u2013i282 (2012)","journal-title":"Bioinformatics"},{"issue":"3","key":"12_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0009490","volume":"5","author":"MN Price","year":"2010","unstructured":"Price, M.N., Dehal, P.S., Arkin, A.P.: FastTree 2 - approximately maximum-likelihood trees for large alignments. PloS One 5(3), 1\u201310 (2010)","journal-title":"PloS One"},{"issue":"1","key":"12_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00440-017-0793-x","volume":"169","author":"S Roch","year":"2017","unstructured":"Roch, S., Sly, A.: Phase transition in the sample complexity of likelihood-based phylogeny inference. Probab. Theory Relat. Fields 169(1), 3\u201362 (2017)","journal-title":"Probab. Theory Relat. Fields"},{"issue":"12","key":"12_CR23","doi-asserted-by":"publisher","first-page":"3279","DOI":"10.1093\/molbev\/msx261","volume":"34","author":"E Sayyari","year":"2017","unstructured":"Sayyari, E., Whitfield, J.B., Mirarab, S.: Fragmentary gene sequences negatively impact gene tree and species tree reconstruction. Mol. Biol. Evol. 34(12), 3279\u20133291 (2017)","journal-title":"Mol. Biol. Evol."},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1093\/bioinformatics\/btu033","volume":"30","author":"A Stamatakis","year":"2014","unstructured":"Stamatakis, A.: RAxML version 8: a tool for phylogenetic analysis and post-analysis of large phylogenies. Bioinformatics 30, 1312\u20131313 (2014)","journal-title":"Bioinformatics"},{"key":"12_CR25","unstructured":"Swofford, D.L.: PAUP* (*Phylogenetic Analysis Using PAUP), Version 4a161 (2018). \n                      http:\/\/phylosolutions.com\/paup-test\/"},{"key":"12_CR26","unstructured":"Tavar\u00e9, S.: Some probabilistic and statistical problems in the analysis of DNA sequences. In: Lectures on Mathematics in the Life Sciences, vol. 17, pp. 57\u201386. American Mathematical Society (1986)"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Warnow, T.: Divide-and-conquer tree estimation: opportunities and challenges. In: Warnow, T. (ed.) Bioinformatics and Phylogenetics. Springer (2019)","DOI":"10.1007\/978-3-030-10837-3_6"},{"key":"12_CR28","unstructured":"Warnow, T., Moret, B.M., St. John, K.: Absolute convergence: true trees from short sequences. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 186\u2013195. Society for Industrial and Applied Mathematics (2001)"},{"issue":"2","key":"12_CR29","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/s13015-019-0136-9","volume":"14","author":"Q Zhang","year":"2019","unstructured":"Zhang, Q., Rao, S., Warnow, T.: Constrained incremental tree building: new absolute fast converging phylogeny estimation methods with improved scalability and accuracy. Algorithms Mol. Biol. 14(2), 2 (2019). \n                      https:\/\/rdcu.be\/blBXm","journal-title":"Algorithms Mol. Biol."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18174-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T16:11:46Z","timestamp":1558541506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-18174-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030181734","9783030181741"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18174-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AlCoB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms for Computational Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Berkeley, 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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"alcob2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/alcob2019.irdta.eu\/","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50% - 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"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"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"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"One paper of an invited talk is included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}