{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T04:15:50Z","timestamp":1743221750063,"version":"3.40.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,7]],"date-time":"2024-12-07T00:00:00Z","timestamp":1733529600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,7]],"date-time":"2024-12-07T00:00:00Z","timestamp":1733529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Wellcome Trust\/DBT India Alliance Intermediate Fellowship","award":["IA\/I\/17\/2\/503323"],"award-info":[{"award-number":["IA\/I\/17\/2\/503323"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s00236-024-00474-8","type":"journal-article","created":{"date-parts":[[2024,12,7]],"date-time":"2024-12-07T19:12:20Z","timestamp":1733598740000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized algorithms for the Steiner arborescence problem on a hypercube"],"prefix":"10.1007","volume":"62","author":[{"given":"Sugyani","family":"Mahapatra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manikandan","family":"Narayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. S.","family":"Narayanaswamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,7]]},"reference":[{"key":"474_CR1","doi-asserted-by":"crossref","unstructured":"Awasthi, P., Blum, A., Morgenstern, J., et\u00a0al.: Additive approximation for near-perfect phylogeny construction. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer, pp. 25\u201336 (2012)","DOI":"10.1007\/978-3-642-32512-0_3"},{"key":"474_CR2","doi-asserted-by":"crossref","unstructured":"Blelloch, G.E., Dhamdhere, K., Halperin, E., et\u00a0al.: Fixed parameter tractability of binary near-perfect phylogenetic tree reconstruction. In: International Colloquium on Automata, Languages, and Programming. Springer, pp. 667\u2013678 (2006)","DOI":"10.1007\/11786986_58"},{"key":"474_CR3","doi-asserted-by":"crossref","unstructured":"Book, R.V.: Michael R. Garey and David S. Johnson, Computers and intractability: a guide to the theory of $$ NP $$-completeness. American Mathematical Society (1980)","DOI":"10.1090\/S0273-0979-1980-14848-X"},{"issue":"3","key":"474_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.2307\/2406441","volume":"19","author":"JH Camin","year":"1965","unstructured":"Camin, J.H., Sokal, R.R.: A method for deducing branching sequences in phylogeny. Evolution 19(3), 311\u2013326 (1965)","journal-title":"Evolution"},{"key":"474_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141, et al.: Parameterized Algorithms, vol. 4. Springer, Berlin (2015)"},{"issue":"1","key":"474_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0025-5564(86)90161-6","volume":"81","author":"WH Day","year":"1986","unstructured":"Day, W.H., Johnson, D.S., Sankoff, D.: The computational complexity of inferring rooted phylogenies by parsimony. Math. Biosci. 81(1), 33\u201342 (1986)","journal-title":"Math. Biosci."},{"key":"474_CR7","doi-asserted-by":"crossref","unstructured":"Ding, Z., Filkov, V., Gusfield, D.: A linear-time algorithm for the perfect phylogeny haplotyping (pph) problem. In: Annual International Conference on Research in Computational Molecular Biology. Springer, pp. 585\u2013600 (2005)","DOI":"10.1007\/11415770_44"},{"issue":"2","key":"474_CR8","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1089\/cmb.2006.13.522","volume":"13","author":"Z Ding","year":"2006","unstructured":"Ding, Z., Filkov, V., Gusfield, D.: A linear-time algorithm for the perfect phylogeny haplotyping (pph) problem. J. Comput. Biol. 13(2), 522\u2013553 (2006)","journal-title":"J. Comput. Biol."},{"issue":"3","key":"474_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"SE Dreyfus","year":"1971","unstructured":"Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1(3), 195\u2013207 (1971)","journal-title":"Networks"},{"issue":"1","key":"474_CR10","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1137\/18M1209489","volume":"35","author":"P Dvor\u00e1k","year":"2021","unstructured":"Dvor\u00e1k, P., Feldmann, A.E., Knop, D., et al.: Parameterized approximation schemes for Steiner trees with small number of Steiner vertices. SIAM J. Discrete Math. 35(1), 546\u2013574 (2021)","journal-title":"SIAM J. Discrete Math."},{"key":"474_CR11","volume-title":"Inferring Phylogenies","author":"J Felsenstein","year":"2004","unstructured":"Felsenstein, J.: Inferring Phylogenies, vol. 2. Sinauer Associates, Sunderland (2004)"},{"issue":"1\u20133","key":"474_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0166-218X(98)00069-9","volume":"88","author":"D Fern\u00e1ndez-Baca","year":"1998","unstructured":"Fern\u00e1ndez-Baca, D., Lagergren, J.: On the approximability of the Steiner tree problem in phylogeny. Discrete Appl. Math. 88(1\u20133), 129\u2013145 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"474_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0196-8858(82)80004-3","volume":"3","author":"LR Foulds","year":"1982","unstructured":"Foulds, L.R., Graham, R.L.: The Steiner problem in phylogeny is NP-complete. Adv. Appl. Math. 3(1), 43\u201349 (1982)","journal-title":"Adv. Appl. Math."},{"key":"474_CR14","doi-asserted-by":"crossref","unstructured":"Goranci, G., R\u00e4cke, H., Saranurak, T., et\u00a0al.: The expander hierarchy and its applications to dynamic graph algorithms. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, pp. 2212\u20132228 (2021)","DOI":"10.1137\/1.9781611976465.132"},{"key":"474_CR15","doi-asserted-by":"crossref","unstructured":"Gusfield, D., Bansal, V.: A fundamental decomposition theory for phylogenetic networks and incompatible characters. In: Annual International Conference on Research in Computational Molecular Biology. Springer, pp. 217\u2013232 (2005)","DOI":"10.1007\/11415770_17"},{"key":"474_CR16","doi-asserted-by":"crossref","unstructured":"Halperin, E., Krauthgamer, R.: Polylogarithmic inapproximability. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of computing, pp. 585\u2013594 (2003)","DOI":"10.1145\/780542.780628"},{"key":"474_CR17","unstructured":"Harris, D.G., Narayanaswamy, N.: A faster algorithm for vertex cover parameterized by solution size. In: 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"issue":"1","key":"474_CR18","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10878-005-5487-0","volume":"9","author":"TS Hsu","year":"2005","unstructured":"Hsu, T.S., Tsai, K.H., Wang, D.W., et al.: Two variations of the minimum Steiner problem. J. Combin. Optim. 9(1), 101\u2013120 (2005)","journal-title":"J. Combin. Optim."},{"key":"474_CR19","doi-asserted-by":"crossref","unstructured":"Jansson, J.: Directed perfect phylogeny (binary characters). Encyclopedia of Algorithms pp. 1\u20135 (2014)","DOI":"10.1007\/978-3-642-27848-8_112-2"},{"issue":"6","key":"474_CR20","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1089\/cmb.2009.0249","volume":"17","author":"F Lam","year":"2010","unstructured":"Lam, F., Tarpine, R., Istrail, S.: The imperfect ancestral recombination graph reconstruction problem: upper bounds for recombination and homoplasy. J. Comput. Biol. 17(6), 767\u2013781 (2010)","journal-title":"J. Comput. Biol."},{"issue":"4","key":"474_CR21","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/s00453-012-9630-x","volume":"65","author":"J Nederlof","year":"2013","unstructured":"Nederlof, J.: Fast polynomial-space algorithms using inclusion\u2013exclusion: improving on Steiner tree and related problems. Algorithmica 65(4), 868\u2013884 (2013)","journal-title":"Algorithmica"},{"key":"474_CR22","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms, vol. 31. OUP, Oxford (2006)"},{"issue":"4","key":"474_CR23","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1109\/TCBB.2007.1070","volume":"4","author":"S Sridhar","year":"2007","unstructured":"Sridhar, S., Dhamdhere, K., Blelloch, G., et al.: Algorithms for efficient near-perfect phylogenetic tree reconstruction in theory and practice. IEEE\/ACM Trans. Comput. Biol. Bioinform. 4(4), 561\u2013571 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"474_CR24","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2013","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2013)"},{"issue":"1","key":"474_CR25","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF02523690","volume":"18","author":"A Zelikovsky","year":"1997","unstructured":"Zelikovsky, A.: A series of approximation algorithms for the acyclic directed Steiner tree problem. Algorithmica 18(1), 99\u2013110 (1997)","journal-title":"Algorithmica"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-024-00474-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-024-00474-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-024-00474-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T22:24:17Z","timestamp":1743200657000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-024-00474-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,7]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["474"],"URL":"https:\/\/doi.org\/10.1007\/s00236-024-00474-8","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2024,12,7]]},"assertion":[{"value":"28 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"All authors consent to the publication of this manuscript.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Materials availability"}}],"article-number":"6"}}