{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T15:49:02Z","timestamp":1779896942087,"version":"3.53.1"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642024405","type":"print"},{"value":"9783642024412","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02441-2_26","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T13:19:32Z","timestamp":1245244772000},"page":"289-300","source":"Crossref","is-referenced-by-count":16,"title":["The Structure of Level-k Phylogenetic Networks"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Gambette","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vincent","family":"Berry","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1186\/1471-2105-8-458","volume":"8","author":"M. Arenas","year":"2007","unstructured":"Arenas, M., Posada, D.: Recodon: Coalescent Simulation of Coding DNA Sequences with Recombination, Migration and Demography. BMC Bioinformatics\u00a08, 458 (2007)","journal-title":"BMC Bioinformatics"},{"issue":"12","key":"26_CR2","doi-asserted-by":"publisher","first-page":"2517","DOI":"10.1093\/molbev\/msn219","volume":"25","author":"M. Arenas","year":"2008","unstructured":"Arenas, M., Valiente, G., Posada, D.: Characterization of Reticulate Networks based on the Coalescent with Recombination. Molecular Biology and Evolution\u00a025(12), 2517\u20132520 (2008)","journal-title":"Molecular Biology and Evolution"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Byrka, J., Gawrychowski, P., Huber, K.T., Kelk, S.: Worst-case Optimal Approximation Algorithms for Maximizing Triplet Consistency within Phylogenetic Networks. To appear in Journal of Discrete Algorithms (2009)","DOI":"10.1016\/j.jda.2009.01.004"},{"issue":"4","key":"26_CR4","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1142\/S0219720006002211","volume":"4","author":"H.-L. Chan","year":"2006","unstructured":"Chan, H.-L., Jansson, J., Lam, T.-W., Yiu, S.-M.: Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. Journal of Bioinformatics and Computational Biology\u00a04(4), 807\u2013832 (2006)","journal-title":"Journal of Bioinformatics and Computational Biology"},{"issue":"1","key":"26_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.tcs.2004.12.012","volume":"335","author":"C. Choy","year":"2005","unstructured":"Choy, C., Jansson, J., Sadakane, K., Sung, W.-K.: Computing the Maximum Agreement of Phylogenetic Networks. Theor. Comput. Sci.\u00a0335(1), 93\u2013107 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Cardona, G., Rossell\u00f3, F., Valiente, G.: Comparison of Tree-Child phylogenetic networks. To appear in IEEE\/ACM Trans. on Comp. Biol. and Bioinf. (2009)","DOI":"10.1109\/TCBB.2007.70270"},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1006\/jcss.1997.1510","volume":"55","author":"J. Engelfriet","year":"1997","unstructured":"Engelfriet, J., van Oostrom, V.: Logical Description of Contex-Free Graph Languages. J. Comput. Syst. Sci.\u00a055(3), 489\u2013503 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1080\/10635150701546231","volume":"56","author":"N. Galtier","year":"2007","unstructured":"Galtier, N.: A Model of Horizontal Gene Transfer and the Bacterial Phylogeny Problem. Systematic Biology\u00a056, 633\u2013642 (2007)","journal-title":"Systematic Biology"},{"key":"26_CR9","unstructured":"Gambette, P.: Who is Who in Phylogenetic Networks: Articles, Authors and Programs, http:\/\/www.lirmm.fr\/~gambette\/PhylogeneticNetworks"},{"key":"26_CR10","unstructured":"Gioan, E., Paul, C.: Split Decomposition and Graph-Labelled Trees: Characterizations and Fully-Dynamic Algorithms for Totally Decomposable Graphs (submitted, 2009)"},{"key":"26_CR11","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11415770_17","volume-title":"Research in Computational Molecular Biology","author":"D. Gusfield","year":"2005","unstructured":"Gusfield, D., Bansal, V.: A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a03500, pp. 217\u2013232. Springer, Heidelberg (2005)"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Gusfield, D., Eddhu, S., Langley, C.: Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination. In: IEEE Computational Systems Bioinformatics Conference (CSB 2003), pp. 363\u2013374 (2003)","DOI":"10.1109\/CSB.2003.1227337"},{"key":"26_CR13","unstructured":"Grant, V.: Plant Speciation, pp. 300\u2013320. Columbia University Press (1971)"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Hallett, M., Lagergren, J.: Efficient Algorithms for Lateral Gene Transfers Problems. In: International Conference on Research in Computational Molecular Biology (RECOMB 2001), pp. 141\u2013148 (2001)","DOI":"10.1145\/369133.369188"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0040-5809(83)90013-8","volume":"23","author":"R.R. Hudson","year":"1983","unstructured":"Hudson, R.R.: Properties of the Neutral Allele Model with Intragenic Recombination. Theoretical Population Biology\u00a023, 183\u2013201 (1983)","journal-title":"Theoretical Population Biology"},{"key":"26_CR16","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1093\/oso\/9780199208227.003.0009","volume-title":"Reconstructing Evolution","author":"D.H. Huson","year":"2007","unstructured":"Huson, D.H.: Split Networks and Reticulate Networks. In: Gascuel, O., Steel, M. (eds.) Reconstructing Evolution, pp. 247\u2013276. Oxford University Press, Oxford (2007)"},{"key":"26_CR17","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-540-78839-3_40","volume-title":"Research in Computational Molecular Biology","author":"L. Iersel van","year":"2008","unstructured":"van Iersel, L., Keijsper, J., Kelk, S., Stougie, L., Hagen, F., Boekhout, T.: Constructing Level-2 Phylogenetic Networks from Triplets. In: Vingron, M., Wong, L. (eds.) RECOMB 2008. LNCS (LNBI), vol.\u00a04955, pp. 450\u2013462. Springer, Heidelberg (2008)"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1007\/978-3-540-92182-0_43","volume-title":"ISAAC 2008","author":"L. Iersel van","year":"2008","unstructured":"van Iersel, L., Kelk, S.: Constructing the Simplest Possible Phylogenetic Network from Triplets. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 472\u2013483. Springer, Heidelberg (2008)"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"van Iersel, L., Kelk, S., Mnich, M.: Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Network. To appear in Journal of Bioinformatics and Computational Biology (2009)","DOI":"10.1142\/S0219720009004308"},{"issue":"1","key":"26_CR20","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2006.06.022","volume":"363","author":"J. Jansson","year":"2006","unstructured":"Jansson, J., Sung, W.-K.: Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets. Theor. Comput. Sci.\u00a0363(1), 60\u201368 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR21","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.tcs.2008.04.019","volume":"401","author":"I.A. Kanj","year":"2008","unstructured":"Kanj, I.A., Nakhleh, L., Than, C., Xia, G.: Seeing the Trees and Their Branches in the Network is Hard. Theor. Comput. Sci.\u00a0401, 153\u2013164 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR22","unstructured":"Kelk, S., http:\/\/homepages.cwi.nl\/~kelk\/lev3gen\/"},{"issue":"2","key":"26_CR23","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s00373-002-0503-y","volume":"19","author":"V. Kaibel","year":"2003","unstructured":"Kaibel, V., Schwartz, A.: On the Complexity of Polytope Isomorphism Problems. Graphs and Combinatorics\u00a019(2), 215\u2013230 (2003)","journal-title":"Graphs and Combinatorics"},{"issue":"10","key":"26_CR24","doi-asserted-by":"publisher","first-page":"1700","DOI":"10.3732\/ajb.91.10.1700","volume":"91","author":"C.R. Linder","year":"2004","unstructured":"Linder, C.R., Rieseberg, L.H.: Reconstructing Patterns of Reticulate Evolution in Plants. American Journal of Botany\u00a091(10), 1700\u20131708 (2004)","journal-title":"American Journal of Botany"},{"issue":"1","key":"26_CR25","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"E.M. Luks","year":"1982","unstructured":"Luks, E.M.: Isomorphism of Graphs of Bounded Valence Can be Tested in Polynomial Time. Journal of Computer and System Sciences\u00a025(1), 42\u201365 (1982)","journal-title":"Journal of Computer and System Sciences"},{"key":"26_CR26","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1186\/1471-2148-5-27","volume":"5","author":"D. MacLeod","year":"2005","unstructured":"MacLeod, D., Charlebois, R.L., Doolittle, W.F., Bapteste, E.: Deduction of Probable Events of Lateral Gene Transfer through Comparison of Phylogenetic Trees by Recursive Consolidation and Rearrangement. BMC Evol. Biol.\u00a05, 27 (2005)","journal-title":"BMC Evol. Biol."},{"key":"26_CR27","doi-asserted-by":"crossref","unstructured":"Miller, G.L.: Graph Isomorphism, General Remarks. In: ACM Symposium on Theory of Computing (STOC 1977), pp. 143\u2013150 (1977)","DOI":"10.1145\/800105.803404"},{"issue":"15","key":"26_CR28","doi-asserted-by":"publisher","first-page":"1921","DOI":"10.1093\/bioinformatics\/btl191","volume":"22","author":"M.M. Morin","year":"2006","unstructured":"Morin, M.M., Moret, B.M.E.: NetGen: Generating Phylogenetic Networks with Diploid Hybrids. Bioinformatics\u00a022(15), 1921\u20131923 (2006)","journal-title":"Bioinformatics"},{"key":"26_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/BFb0030789","volume-title":"Combinatorial Pattern Matching","author":"B. Ma","year":"1998","unstructured":"Ma, B., Wang, L., Li, M.: Fixed Topology Alignment with Recombination. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol.\u00a01448, pp. 174\u2013188. Springer, Heidelberg (1998)"},{"issue":"6","key":"26_CR30","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1089\/cmb.2005.12.796","volume":"12","author":"L. Nakhleh","year":"2005","unstructured":"Nakhleh, L., Warnow, T., Linder, C.R., St. John, K.: Reconstructing Reticulate Evolution in Species - Theory and Practice. Journal of Computational Biology\u00a012(6), 796\u2013811 (2005)","journal-title":"Journal of Computational Biology"},{"key":"26_CR31","unstructured":"Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences. Published electronically, http:\/\/www.research.att.com\/~njas\/sequences\/"},{"key":"26_CR32","first-page":"398","volume":"3","author":"C. Semple","year":"2004","unstructured":"Semple, C., Steel, M.: Unicyclic Networks: Compatibility and Enumeration. IEEE\/ACM Trans. on Comp. Biol. and Bioinf.\u00a03, 398\u2013401 (2004)","journal-title":"IEEE\/ACM Trans. on Comp. Biol. and Bioinf."},{"key":"26_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/978-3-642-02441-2_25","volume-title":"CPM 2009","author":"T.-H. To","year":"2009","unstructured":"To, T.-H., Habib, M.: Level-k Phylogenetic Network Are Constructable from a Dense Triplet Set in Polynomial Time. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol.\u00a05577, pp. 275\u2013288. Springer, Heidelberg (2009)"},{"key":"26_CR34","doi-asserted-by":"crossref","unstructured":"Wang, L., Zhang, K., Zhang, L.: Perfect phylogenetic networks with recombination. In: ACM Symposium on Applied Computing (SAC 2001), pp. 46\u201350 (2001)","DOI":"10.1145\/372202.372271"},{"issue":"4","key":"26_CR35","doi-asserted-by":"crossref","first-page":"1426","DOI":"10.1007\/BF02104746","volume":"29","author":"V.N. Zemlyachenko","year":"1985","unstructured":"Zemlyachenko, V.N., Korneenko, N.M., Tyshkevich, R.I.: Graph Isomorphism Problem. Journal of Mathematical Sciences\u00a029(4), 1426\u20131481 (1985)","journal-title":"Journal of Mathematical Sciences"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02441-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T05:37:30Z","timestamp":1739165850000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02441-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024405","9783642024412"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02441-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}