{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T21:13:35Z","timestamp":1718745215399},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,12,29]],"date-time":"2015-12-29T00:00:00Z","timestamp":1451347200000},"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":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s11432-015-5355-1","type":"journal-article","created":{"date-parts":[[2015,12,29]],"date-time":"2015-12-29T10:13:42Z","timestamp":1451384022000},"page":"1-14","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees"],"prefix":"10.1007","volume":"59","author":[{"given":"Feng","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yufei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qilong","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weilong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,29]]},"reference":[{"key":"5355_CR1","doi-asserted-by":"crossref","first-page":"1866","DOI":"10.1126\/science.286.5446.1866","volume":"286","author":"D M Hillis","year":"1999","unstructured":"Hillis D M. Predictive evolution. Science, 1999, 286: 1866\u20131867","journal-title":"Science"},{"key":"5355_CR2","first-page":"585","volume-title":"Proceedings of 9th Annual International Conference of Research in Computational Molecular Biology (RECOMB 2005), Cambridge","author":"Z Ding","year":"2005","unstructured":"Ding Z, Filkov V, Gusfield D. A linear-time algorithm for the perfect phylogeny haplotyping (PPH) problem. In: Proceedings of 9th Annual International Conference of Research in Computational Molecular Biology (RECOMB 2005), Cambridge, 2005. 585\u2013600"},{"key":"5355_CR3","first-page":"314","volume-title":"Proceedings of 7th ACM-SIAM Symposium on Discrete Algorithms (SODA 1996), Atlanta","author":"T Warnow","year":"1996","unstructured":"Warnow T, Ringe D, Taylor A. Reconstructing the evolutionary history of natural languages. In: Proceedings of 7th ACM-SIAM Symposium on Discrete Algorithms (SODA 1996), Atlanta, 1996. 314\u2013322"},{"key":"5355_CR4","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"D F Robinson","year":"1981","unstructured":"Robinson D F, Foulds L R. Comparison of phylogenetic trees. Math Biosci, 1981, 53: 131\u2013147","journal-title":"Math Biosci"},{"key":"5355_CR5","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1006\/jtbi.1996.0188","volume":"182","author":"M Li","year":"1996","unstructured":"Li M, Tromp J, Zhang L. On the nearest neighbour interchange distance between evolutionary trees. J Theor Biol, 1996, 182: 463\u2013467","journal-title":"J Theor Biol"},{"key":"5355_CR6","first-page":"427","volume-title":"Proceedings of 8th ACM-SIAM Symposium of Discrete Algorithms (SODA 1997), New Orleans","author":"B Gupta Das","year":"1997","unstructured":"Das Gupta B, He X, Jiang T, et al. On distances between phylogenetic trees. In: Proceedings of 8th ACM-SIAM Symposium of Discrete Algorithms (SODA 1997), New Orleans, 1997. 427\u2013436"},{"key":"5355_CR7","first-page":"407","volume-title":"Molecular Systematics","author":"D Swofford","year":"1996","unstructured":"Swofford D, Olsen G, Waddell P, et al Phylogenetic inference. In: Hillis D, Moritz C, Mable B, eds. Molecular Systematics. 2nd ed. Sunderland: Sinauer Associates, 1996. 407\u2013513"},{"key":"5355_CR8","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0166-218X(96)00062-5","volume":"71","author":"J Hein","year":"1996","unstructured":"Hein J, Jiang T, Wang L, et al. On the complexity of comparing evolutionary trees. Discrete Appl Math, 1996, 71: 153\u2013169","journal-title":"Discrete Appl Math"},{"key":"5355_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00026-001-8006-8","volume":"5","author":"B L Allen","year":"2001","unstructured":"Allen B L, Steel M. Subtree transfer operations and their induced metrics on evolutionary trees. Ann Comb, 2001, 5: 1\u201315","journal-title":"Ann Comb"},{"key":"5355_CR10","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s00026-004-0229-z","volume":"8","author":"M Bordewich","year":"2005","unstructured":"Bordewich M, Semple C. On the computational complexity of the rooted subtree prune and regraft distance. Ann Comb, 2005, 8: 409\u2013423","journal-title":"Ann Comb"},{"key":"5355_CR11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.4137\/EBO.S419","volume":"4","author":"G Hickey","year":"2008","unstructured":"Hickey G, Dehne F, Rau-Chaplin A, et al. SPR distance computation for unrooted trees. Evol Bioinform Online, 2008, 4: 17","journal-title":"Evol Bioinform Online"},{"key":"5355_CR12","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s00285-005-0315-9","volume":"51","author":"M Baroni","year":"2005","unstructured":"Baroni M, Grnewald S, Moulton V, et al. Bounding the number of hybridisation events for a consistent evolutionary history. J Math Biol, 2005, 51: 171\u2013182","journal-title":"J Math Biol"},{"key":"5355_CR13","doi-asserted-by":"crossref","first-page":"870","DOI":"10.1007\/s11390-014-1474-1","volume":"29","author":"J E Chen","year":"2014","unstructured":"Chen J E, Feng Q L. On unknown small subsets and implicit measures: new techniques for parameterized algorithms. J Comput Sci Technol, 2014, 29: 870\u2013878","journal-title":"J Comput Sci Technol"},{"key":"5355_CR14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10878-013-9691-z","volume":"29","author":"Q L Feng","year":"2015","unstructured":"Feng Q L, Wang J X, Li S H, et al. Randomized parameterized algorithms for P2-Packing and Co-Path Packing problems. J Comb Optim, 2015, 29: 125\u2013140","journal-title":"J Comb Optim"},{"key":"5355_CR15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.tcs.2013.12.011","volume":"522","author":"Q L Feng","year":"2014","unstructured":"Feng Q L, Wang J X, Chen J E. Matching and weighted P2-Packing: algorithms and kernels. Theor Comput Sci, 2014, 522: 85\u201394","journal-title":"Theor Comput Sci"},{"key":"5355_CR16","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/j.tcs.2014.07.021","volume":"560","author":"Q L Feng","year":"2014","unstructured":"Feng Q L, Wang J X, Xu C, et al. Improved parameterized algorithms for minimum link-length rectilinear spanning path problem. Theor Comput Sci, 2014, 560: 158\u2013171","journal-title":"Theor Comput Sci"},{"key":"5355_CR17","doi-asserted-by":"crossref","first-page":"3092","DOI":"10.1109\/TC.2013.163","volume":"63","author":"J X Wang","year":"2014","unstructured":"Wang J X, Tan P Q, Yao J Y, et al. On the minimum link-length rectilinear spanning path problem: complexity and algorithms. IEEE Trans Comput, 2014, 63: 3092\u20133100","journal-title":"IEEE Trans Comput"},{"key":"5355_CR18","first-page":"072107","volume":"57","author":"J X Wang","year":"2014","unstructured":"Wang J X, Li W J, Li S H, et al. On the parameterized vertex cover problem for graphs with perfect matching. Sci China Inf Sci, 2014, 57: 072107","journal-title":"Sci China Inf Sci"},{"key":"5355_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R Downy","year":"1999","unstructured":"Downy R, Fellows M. Parameterized Complexity. New York: Springer-Verlag, 1999"},{"key":"5355_CR20","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s00224-007-1329-z","volume":"41","author":"M Hallett","year":"2007","unstructured":"Hallett M, Mccartin C. A faster FPT algorithm for the maximum agreement forest problem. Theory Comput Syst, 2007, 41: 539\u2013550","journal-title":"Theory Comput Syst"},{"key":"5355_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04241-6_32","volume-title":"A Unifying View on Approximation and FPT of Agreement Forests","author":"C Whidden","year":"2009","unstructured":"Whidden C, Zeh N. A Unifying View on Approximation and FPT of Agreement Forests. Berlin\/Heidelberg: Springer, 2009"},{"key":"5355_CR22","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/TCBB.2008.86","volume":"6","author":"S Linz","year":"2009","unstructured":"Linz S, Semple C. Hybridization in nonbinary trees. IEEE\/ACM Trans Comput Biol Bioinform, 2009, 6: 30\u201345","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"5355_CR23","volume-title":"Fixed-parameter and approximation algorithms for maximum agreement forests","author":"C Whidden","year":"2011","unstructured":"Whidden C, Beiko R G, Zeh N. Fixed-parameter and approximation algorithms for maximum agreement forests. arXiv preprint, arXiv:1108.2664, 2011"},{"key":"5355_CR24","doi-asserted-by":"crossref","first-page":"911","DOI":"10.2307\/25065478","volume":"54","author":"O Paun","year":"2005","unstructured":"Paun O, Lehnebach C, Johansson J T, et al. Phylogenetic relationships and biogeography of Ranunculus and allied genera (Ranunculaceae) in the Mediterranean region and in the European alpine system. Taxon, 2005, 54: 911\u2013932","journal-title":"Taxon"},{"key":"5355_CR25","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.ympev.2011.04.001","volume":"60","author":"A Willyard","year":"2011","unstructured":"Willyard A, Wallace L E, Wagner W L, et al. Estimating the species tree for Hawaiian Schiedea (Caryophyllaceae) from multiple loci in the presence of reticulate evolution. Mol Phylogenet Evol, 2011, 60: 29\u201348","journal-title":"Mol Phylogenet Evol"},{"key":"5355_CR26","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1111\/j.1096-0031.1989.tb00569.x","volume":"5","author":"W Maddison","year":"1989","unstructured":"Maddison W. Reconstructing character evolution on polytomous cladograms. Cladistics, 1989, 5: 365\u2013377","journal-title":"Cladistics"},{"key":"5355_CR27","doi-asserted-by":"crossref","first-page":"2674","DOI":"10.1093\/molbev\/msq163","volume":"27","author":"S Whelan","year":"2010","unstructured":"Whelan S, Money D. The prevalence of multifurcations in tree-space and their implications for tree-search. Mol Biol Evol, 2010, 27: 2674\u20132677","journal-title":"Mol Biol Evol"},{"key":"5355_CR28","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1186\/1471-2148-6-15","volume":"6","author":"R G Beiko","year":"2006","unstructured":"Beiko R G, Hamilton N. Phylogenetic identification of lateral genetic transfer events. BMC Evol Biol, 2006, 6: 15","journal-title":"BMC Evol Biol"},{"key":"5355_CR29","doi-asserted-by":"crossref","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. Theor Comput Sci, 2007, 374: 91\u2013110","journal-title":"Theor Comput Sci"},{"key":"5355_CR30","first-page":"387","volume-title":"Mathematics in the Archaeological and Historical Sciences. Edinburgh: Edinburgh University Press","author":"P Buneman","year":"1971","unstructured":"Buneman P. The recovery of trees from measures of issimilarity. In: Hodson F, Kendall D, Tauta P, eds. Mathematics in the Archaeological and Historical Sciences. Edinburgh: Edinburgh University Press, 1971. 387\u2013395"},{"key":"5355_CR31","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1016\/j.tcs.2014.10.031","volume":"562","author":"J E Chen","year":"2015","unstructured":"Chen J E, Fan J H, Sze S H. Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees. Theor Comput Sci, 2015, 562: 496\u2013512","journal-title":"Theor Comput Sci"},{"key":"5355_CR32","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.tcs.2013.12.025","volume":"554","author":"F Shi","year":"2014","unstructured":"Shi F, Wang J, Chen J E, et al. Algorithms for parameterized maximum agreement forest problem on multiple trees. Theor Comput Sci, 2014, 554: 207\u2013216","journal-title":"Theor Comput Sci"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-015-5355-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-015-5355-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-015-5355-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T01:10:31Z","timestamp":1567473031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-015-5355-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,29]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["5355"],"URL":"https:\/\/doi.org\/10.1007\/s11432-015-5355-1","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,29]]}}}