{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:16:28Z","timestamp":1725455788323},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642331213"},{"type":"electronic","value":"9783642331220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33122-0_34","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T10:43:09Z","timestamp":1346150589000},"page":"430-440","source":"Crossref","is-referenced-by-count":1,"title":["A Practical Approximation Algorithm for Solving Massive Instances of Hybridization Number"],"prefix":"10.1007","author":[{"given":"Leo","family":"van Iersel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Kelk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nela","family":"Leki\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Celine","family":"Scornavacca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"34_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1093\/bioinformatics\/btr618","volume":"28","author":"B. Albrecht","year":"2012","unstructured":"Albrecht, B., Scornavacca, C., Cenci, A., Huson, D.H.: Fast computation of minimum hybridization networks. Bioinformatics\u00a028(2), 191\u2013197 (2012)","journal-title":"Bioinformatics"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00285-005-0315-9","volume":"51","author":"M. Baroni","year":"2005","unstructured":"Baroni, M., Gr\u00fcnewald, S., Moulton, V., Semple, C.: Bounding the number of hybridisation events for a consistent evolutionary history. Mathematical Biology\u00a051, 171\u2013182 (2005)","journal-title":"Mathematical Biology"},{"key":"34_CR3","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1177\/117693430700300017","volume":"3","author":"M. Bordewich","year":"2007","unstructured":"Bordewich, M., Linz, S., St. John, K., Semple, C.: A reduction algorithm for computing the hybridization number of two trees. Evolutionary Bioinformatics\u00a03, 86\u201398 (2007)","journal-title":"Evolutionary Bioinformatics"},{"issue":"8","key":"34_CR4","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1016\/j.dam.2006.08.008","volume":"155","author":"M. Bordewich","year":"2007","unstructured":"Bordewich, M., Semple, C.: Computing the minimum number of hybridization events for a consistent evolutionary history. Discrete Applied Mathematics\u00a0155(8), 914\u2013928 (2007)","journal-title":"Discrete Applied Mathematics"},{"issue":"22","key":"34_CR5","doi-asserted-by":"publisher","first-page":"2912","DOI":"10.1093\/bioinformatics\/btq548","volume":"26","author":"Z.-Z. Chen","year":"2010","unstructured":"Chen, Z.-Z., Wang, L.: Hybridnet: a tool for constructing hybridization networks. Bioinformatics\u00a026(22), 2912\u20132913 (2010)","journal-title":"Bioinformatics"},{"issue":"2","key":"34_CR6","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/TCBB.2011.137","volume":"9","author":"Z.-Z. Chen","year":"2012","unstructured":"Chen, Z.-Z., Wang, L.: Algorithms for reticulate networks of multiple phylogenetic trees. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a09(2), 372\u2013384 (2012)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1089\/cmb.2009.0166","volume":"18","author":"J. Collins","year":"2011","unstructured":"Collins, J., Linz, S., Semple, C.: Quantifying hybridization in realistic time. Journal of Computational Biology\u00a018, 1305\u20131318 (2011)","journal-title":"Journal of Computational Biology"},{"key":"34_CR8","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Gascuel, O. (ed.): Mathematics of Evolution and Phylogeny. Oxford University Press, Inc. (2005)","DOI":"10.1093\/oso\/9780198566106.001.0001"},{"volume-title":"Reconstructing Evolution: New Mathematical and Computational Advances","year":"2007","key":"34_CR10","unstructured":"Gascuel, O., Steel, M. (eds.): Reconstructing Evolution: New Mathematical and Computational Advances. Oxford University Press, USA (2007)"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Huson, D.H., Rupp, R., Scornavacca, C.: Phylogenetic Networks: Concepts, Algorithms and Applications. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511974076"},{"key":"34_CR12","unstructured":"Huson, D.H., Scornavacca, C.: Dendroscope 3 - a program for computing and drawing rooted phylogenetic trees and networks (2011) (in preparation), Software, http:\/\/www.dendroscope.org"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1093\/gbe\/evq077","volume":"3","author":"D.H. Huson","year":"2011","unstructured":"Huson, D.H., Scornavacca, C.: A survey of combinatorial methods for phylogenetic networks. Genome Biology and Evolution\u00a03, 23\u201335 (2011)","journal-title":"Genome Biology and Evolution"},{"key":"34_CR14","unstructured":"Kelk, S.M., van Iersel, L.J.J., Leki\u0107, N., Linz, S., Scornavacca, C., Stougie, L.: Cycle killer.. qu\u2019est ce que c\u2019est? on the comparative approximability of hybridization number and directed feedback vertex set. Submitted, preliminary version arXiv:1112.5359v1 (math.CO)"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Nakhleh, L.: Evolutionary phylogenetic networks: models and issues. In: The Problem Solving Handbook for Computational Biology and Bioinformatics. Springer (2009)","DOI":"10.1007\/978-0-387-09760-2_7"},{"issue":"1-3","key":"34_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2006.12.011","volume":"374","author":"E.M. Rodrigues","year":"2007","unstructured":"Rodrigues, E.M., Sagot, M.F., Wakabayashi, Y.: The maximum agreement forest problem: Approximation algorithms and computational experiments. Theoretical Computer Science\u00a0374(1-3), 91\u2013110 (2007)","journal-title":"Theoretical Computer Science"},{"key":"34_CR17","unstructured":"Whidden, C.: http:\/\/kiwi.cs.dal.ca\/Software\/RSPR"},{"key":"34_CR18","unstructured":"Whidden, C., Beiko, R.G., Zeh, N.: Fixed-parameter and approximation algorithms for maximum agreement forests. Submitted, preliminary version arXiv:1108.2664v1 (q-bio.PE)"},{"key":"34_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-13193-6_13","volume-title":"Experimental Algorithms","author":"C. Whidden","year":"2010","unstructured":"Whidden, C., Beiko, R.G., Zeh, N.: Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments. In: Festa, P. (ed.) SEA 2010. LNCS, vol.\u00a06049, pp. 141\u2013153. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33122-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T19:26:38Z","timestamp":1714332398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33122-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331213","9783642331220"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33122-0_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}