{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:01:38Z","timestamp":1725678098330},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_21","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"177-188","source":"Crossref","is-referenced-by-count":2,"title":["Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics"],"prefix":"10.1007","author":[{"given":"Kun-Mao","family":"Chao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"An-Chiang","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper","family":"Jansson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard S.","family":"Lemence","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alban","family":"Mancheron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"21_CR1","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tree.2004.03.015","volume":"19","author":"O.R.P. Bininda-Emonds","year":"2004","unstructured":"Bininda-Emonds, O.R.P.: The evolution of supertrees. Trends in Ecology and Evolution\u00a019(6), 315\u2013322 (2004)","journal-title":"Trends in Ecology and Evolution"},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.jda.2009.01.004","volume":"8","author":"J. Byrka","year":"2010","unstructured":"Byrka, J., Gawrychowski, P., Huber, K.T., Kelk, S.: Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks. Journal of Discrete Algorithms\u00a08(1), 65\u201375 (2010)","journal-title":"Journal of Discrete Algorithms"},{"key":"21_CR3","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2009","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Massachusetts (2009)","edition":"3"},{"key":"21_CR4","volume-title":"Inferring Phylogenies","author":"J. Felsenstein","year":"2004","unstructured":"Felsenstein, J.: Inferring Phylogenies. Sinauer Associates, Inc., Sunderland (2004)"},{"issue":"2","key":"21_CR5","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1016\/0022-247X(74)90176-0","volume":"48","author":"M.L. Fredman","year":"1974","unstructured":"Fredman, M.L., Knuth, D.E.: Recurrence relations based on minimization. Journal of Mathematical Analysis and Applications\u00a048(2), 534\u2013559 (1974)","journal-title":"Journal of Mathematical Analysis and Applications"},{"issue":"2-3","key":"21_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1009833626004","volume":"3","author":"L. G\\kasieniec","year":"1999","unstructured":"G\u0105sieniec, L., Jansson, J., Lingas, A., \u00d6stlin, A.: On the complexity of constructing evolutionary trees. Journal of Combinatorial Optimization\u00a03(2-3), 183\u2013197 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Gusfield, D., Eddhu, S., Langley, C.: Efficient reconstruction of phylogenetic networks with constrained recombination. In: Proceedings of the Computational Systems Bioinformatics Conference (CSB2 2003), pp. 363\u2013374 (2003)","DOI":"10.1109\/CSB.2003.1227337"},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00009268","volume":"24","author":"M.R. Henzinger","year":"1999","unstructured":"Henzinger, M.R., King, V., Warnow, T.: Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica\u00a024(1), 1\u201313 (1999)","journal-title":"Algorithmica"},{"issue":"3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1016\/S0304-3975(02)00066-X","volume":"290","author":"H.-K. Hwang","year":"2003","unstructured":"Hwang, H.-K., Tsai, T.-H.: An asymptotic theory for recurrence relations based on minimization and maximization. Theoretical Computer Science\u00a0290(3), 1475\u20131501 (2003)","journal-title":"Theoretical Computer Science"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Huson, D.H., Rupp, R., Scornavacca, C.: Phylogenetic Networks: Concepts, Algorithms and Applications. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511974076"},{"issue":"5","key":"21_CR11","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1137\/S0097539704446529","volume":"35","author":"J. Jansson","year":"2006","unstructured":"Jansson, J., Nguyen, N., Sung, W.: Algorithms for combining rooted triplets into a galled phylogenetic network. SIAM Journal on Computing\u00a035(5), 1098\u20131121 (2006)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"21_CR12","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/0022-247X(85)90170-2","volume":"109","author":"S. Kapoor","year":"1985","unstructured":"Kapoor, S., Reingold, E.M.: Recurrence relations based on minimization and maximization. Journal of Mathematical Analysis and Applications\u00a0109(2), 591\u2013604 (1985)","journal-title":"Journal of Mathematical Analysis and Applications"},{"issue":"6","key":"21_CR13","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1137\/0218079","volume":"18","author":"Z. Li","year":"1989","unstructured":"Li, Z., Reingold, E.M.: Solution of a divide-and-conquer maximin recurrence. SIAM Journal on Computing\u00a018(6), 1188\u20131200 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR14","unstructured":"Morrison, D.: Introduction to Phylogenetic Networks. RJR Productions (2011)"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Saha, A., Wagh, M.D.: Minmax recurrences in analysis of algorithms. In: Proceedings of Southeastcon 1993. IEEE (1993)","DOI":"10.1109\/SECON.1993.465784"},{"issue":"1-3","key":"21_CR16","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0166-218X(00)00196-7","volume":"104","author":"L. Wang","year":"2000","unstructured":"Wang, L., Ma, B., Li, M.: Fixed topology alignment with recombination. Discrete Applied Mathematics\u00a0104(1-3), 281\u2013300 (2000)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:22:47Z","timestamp":1620127367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}