Publications related to 'level k phylogenetic network' : N is called a level-k phylogenetic network if its subgraph induced on the vertices of any biconnected component of its underlying undirected graph U(N) contains at most k nodes with indegree 2 (i.e. any non-tree-like part of the network has at most k hybrid nodes). A level-1 phylogenetic network is also called a galled tree. A short overview of results and open problems on this topic was compiled here by Leo van Iersel.
 
Order by:   Type | Year
           related to:
Associated keywords
2020
1
photo
Marefatollah Mansouri. Combinatorial properties of phylogenetic networks. PhD thesis, Vienna University of Technology (Austria), Institute of Discrete Mathematics and Geometry, 2020.
Keywords: counting, explicit network, galled tree, level k phylogenetic network, normal network, phylogenetic network, phylogeny.
Note: https://dmg.tuwien.ac.at/bgitten/Theses/mansouri.pdf.
       

2
photophoto
Mathilde Bouvel, Philippe Gambette and Marefatollah Mansouri. Counting Phylogenetic Networks of Level 1 and 2. In JOMB, 2020.
Keywords: counting, explicit network, level k phylogenetic network, phylogenetic network, phylogeny.
Note: https://arxiv.org/abs/1909.10460, to appear.
       

3
photophotophoto
Leo van Iersel, Vincent Moulton and Yukihiro Murakami. Reconstructibility of unrooted level-k phylogenetic networks from distances. In AAM, Vol. 120(102075):1-30, 2020.
Keywords: from distances, galled tree, level k phylogenetic network, phylogenetic network, phylogeny, reconstruction, uniqueness.
Note: https://doi.org/10.1016/j.aam.2020.102075.
       

4
photophotophotophoto
Momoko Hayamizu, Katharina Huber, Vincent Moulton and Yukihiro Murakami. Recognizing and realizing cactus metrics. In IPL, Vol. 157(105916):1-5, 2020.
Keywords: cactus graph, from distances, level k phylogenetic network, optimal realization, polynomial.
Note: https://doi.org/10.1016/j.ipl.2020.105916.
       

5

Stefan Forcey and Drew Scalzo. Phylogenetic networks as circuits with resistance distance. 2020.
Keywords: circular split system, from distances, level k phylogenetic network, NeighborNet, nested network, phylogenetic network, phylogeny, split network.
Note: https://arxiv.org/abs/2007.13574.
       

6
photophotophoto
Joan Carles Pons, Celine Scornavacca and Gabriel Cardona. Generation of Level-k LGT Networks. In TCBB, Vol. 17(1):158-164, 2020.
Keywords: explicit network, level k phylogenetic network, LGT network, phylogenetic network, phylogeny.
       

2019
7
photophotophotophotophoto
Yukihiro Murakami, Leo van Iersel, Remie Janssen, Mark Jones and Vincent Moulton. Reconstructing Tree-Child Networks from Reticulate-Edge-Deleted Subnetworks. In BMB, Vol. 81:3823-3863, 2019.
Keywords: from subnetworks, level k phylogenetic network, phylogenetic network, phylogeny, reconstruction, tree-child network, uniqueness, valid network.
Note: https://doi.org/10.1007/s11538-019-00641-w.
       

8
photophotophotophotophotophotophoto
Katharina Huber, Leo van Iersel, Remie Janssen, Mark Jones, Vincent Moulton, Yukihiro Murakami and Charles Semple. Rooting for phylogenetic networks. 2019.
Keywords: explicit network, from network, level k phylogenetic network, orchard network, orientation, phylogenetic network, phylogeny, reconstruction, stack-free network, tree-based network, tree-child network, valid network.
Note: https://arxiv.org/abs/1906.07430.
       

2018
9
photophotophotophoto
Katharina Huber, Vincent Moulton, Charles Semple and Taoyang Wu. Quarnet inference rules for level-1 networks. In BMB, Vol. 80:2137-2153, 2018.
Keywords: explicit network, from quarnets, from subnetworks, galled tree, level k phylogenetic network, phylogenetic network, phylogeny, reconstruction.
Note: https://arxiv.org/abs/1711.06720.
       

10
photophoto
Leo van Iersel and Vincent Moulton. Leaf-reconstructibility of phylogenetic networks. In SIAM Journal on Discrete Mathematics, Vol. 32(3):2047-2066, 2018.
Keywords: explicit network, from network, level k phylogenetic network, phylogenetic network, phylogeny, reconstruction, uniqueness.
Note: https://arxiv.org/abs/1701.08982.
       

2017
11
photophotophoto
Leo van Iersel, Vincent Moulton, Eveline De Swart and Taoyang Wu. Binets: fundamental building blocks for phylogenetic networks. In BMB, Vol. 79(5):1135-1154, 2017.
Keywords: approximation, explicit network, from binets, from subnetworks, galled tree, level k phylogenetic network, NP complete, phylogenetic network, phylogeny, reconstruction.
Note: http://dx.doi.org/10.1007/s11538-017-0275-4.
       

2016
12
photophotophoto
Katharina Huber, Vincent Moulton and Taoyang Wu. Transforming phylogenetic networks: Moving beyond tree space. In JTB, Vol. 404:30-39, 2016.
Keywords: distance between networks, level k phylogenetic network, NNI moves, phylogenetic network, phylogeny.
Note: http://arxiv.org/abs/1601.01788.
       

2015
13
photophotophotophoto
Mareike Fischer, Leo van Iersel, Steven Kelk and Celine Scornavacca. On Computing The Maximum Parsimony Score Of A Phylogenetic Network. In SIDMA, Vol. 29(1):559-585, 2015.
Keywords: APX hard, cluster containment, explicit network, FPT, from network, from sequences, integer linear programming, level k phylogenetic network, NP complete, parsimony, phylogenetic network, phylogeny, polynomial, Program MPNet, reconstruction, software.
Note: http://arxiv.org/abs/1302.2430.
       

14
photo
Maxime Morgado. Propriétés structurelles et relations des classes de réseaux phylogénétiques. Master's thesis, ENS Cachan, 2015.
Keywords: compressed network, distinct-cluster network, explicit network, galled network, galled tree, level k phylogenetic network, nested network, normal network, phylogenetic network, phylogeny, regular network, spread, tree containment, tree sibling network, tree-based network, tree-child network, unicyclic network.
       

2014
15
photophoto
Steven Kelk and Celine Scornavacca. Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable. In ALG, Vol. 68(4):886-915, 2014.
Keywords: explicit network, FPT, from clusters, level k phylogenetic network, phylogenetic network, phylogeny, reconstruction.
Note: http://arxiv.org/abs/1108.3653.
       
Toggle abstract
16
photophotophoto
Hadi Poormohammadi, Changiz Eslahchi and Ruzbeh Tusserkani. TripNet: A Method for Constructing Rooted Phylogenetic Networks from Rooted Triplets. In PLoS ONE, Vol. 9(9):e106531, 2014.
Keywords: explicit network, from triplets, heuristic, level k phylogenetic network, phylogenetic network, phylogeny, Program TripNet, reconstruction, software.
Note: http://arxiv.org/abs/1201.3722.
       
Toggle abstract
17
photophoto
Leo van Iersel and Vincent Moulton. Trinets encode tree-child and level-2 phylogenetic networks. In JOMB, Vol. 68(7):1707-1729, 2014.
Keywords: explicit network, from subnetworks, from trinets, level k phylogenetic network, phylogenetic network, phylogeny, reconstruction.
Note: http://arxiv.org/abs/1210.0362.
       
Toggle abstract
2012
18
photophoto
Philippe Gambette and Katharina Huber. On Encodings of Phylogenetic Networks of Bounded Level. In JOMB, Vol. 65(1):157-180, 2012.
Keywords: characterization, explicit network, from clusters, from rooted trees, from triplets, galled tree, identifiability, level k phylogenetic network, phylogenetic network, uniqueness, weak hierarchy.
Note: http://hal.archives-ouvertes.fr/hal-00609130/en/.
       
Toggle abstract
19
photophotophoto
Steven Kelk, Celine Scornavacca and Leo van Iersel. On the elusiveness of clusters. In TCBB, Vol. 9(2):517-534, 2012.
Keywords: explicit network, from clusters, from rooted trees, from triplets, level k phylogenetic network, phylogenetic network, phylogeny, Program Clustistic, reconstruction, software.
Note: http://arxiv.org/abs/1103.1834.
       

20
photophotophoto
Philippe Gambette, Vincent Berry and Christophe Paul. Quartets and Unrooted Phylogenetic Networks. In JBCB, Vol. 10(4):1250004, 2012.
Keywords: abstract network, circular split system, explicit network, from quartets, level k phylogenetic network, orientation, phylogenetic network, phylogeny, polynomial, reconstruction, split, split network.
Note: http://hal.archives-ouvertes.fr/hal-00678046/en/.
       
Toggle abstract
21
photophotophotophotophoto
An-Chiang Chu, Jesper Jansson, Richard Lemence, Alban Mancheron and Kun-Mao Chao. Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics. In TAMC12, Vol. 7287:177-188 of LNCS, springer, 2012.
Keywords: from triplets, galled network, level k phylogenetic network, phylogenetic network.
Note: preliminary version.
       
Toggle abstract
22
photophotophotophotophoto
Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara and Gabriel Valiente. Faster computation of the Robinson–Foulds distance between phylogenetic networks. In Information Sciences, Vol. 197:77-90, 2012.
Keywords: distance between networks, explicit network, level k phylogenetic network, phylogenetic network, polynomial, spread.
       
Toggle abstract
23
photophoto
Michel Habib and Thu-Hien To. Constructing a Minimum Phylogenetic Network from a Dense Triplet Set. In JBCB, Vol. 10(5):1250013, 2012.
Keywords: explicit network, from triplets, level k phylogenetic network, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://arxiv.org/abs/1103.2266.
       
Toggle abstract
2011
24
photophoto
Leo van Iersel and Steven Kelk. Constructing the Simplest Possible Phylogenetic Network from Triplets. In ALG, Vol. 60(2):207-235, 2011.
Keywords: explicit network, from triplets, galled tree, level k phylogenetic network, minimum number, phylogenetic network, phylogeny, polynomial, Program Marlon, Program Simplistic.
Note: http://dx.doi.org/10.1007/s00453-009-9333-0.
       
Toggle abstract
25
photophoto
Leo van Iersel and Steven Kelk. When two trees go to war. In JTB, Vol. 269(1):245-255, 2011.
Keywords: APX hard, explicit network, from clusters, from rooted trees, from sequences, from triplets, level k phylogenetic network, minimum number, NP complete, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://arxiv.org/abs/1004.5332.
       
Toggle abstract
26
photophotophotophoto
Ruzbeh Tusserkani, Changiz Eslahchi, Hadi Poormohammadi and Azin Azadi. TripNet: A Method for Constructing Phylogenetic Networks from Triplets. 2011.
Keywords: explicit network, heuristic, level k phylogenetic network, phylogenetic network, phylogeny, Program TripNet, reconstruction, software.
Note: http://arxiv.org/abs/1104.4720.
       

27
photo
Thu-Hien To. On some graph problems in phylogenetics. PhD thesis, Université Paris Diderot - Paris 7, France, 2011.
Keywords: explicit network, from triplets, level k phylogenetic network, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://www.liafa.jussieu.fr/~toth/thesis.pdf.
       

2010
28
photophotophotophoto
Jaroslaw Byrka, Pawel Gawrychowski, Katharina Huber and Steven Kelk. Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks. In Journal of Discrete Algorithms, Vol. 8(1):65-75, 2010.
Keywords: approximation, explicit network, from triplets, galled tree, level k phylogenetic network, phylogenetic network, phylogeny, reconstruction.
Note: http://arxiv.org/abs/0710.3258.
       
Toggle abstract
29
photophotophotophoto
Leo van Iersel, Steven Kelk, Regula Rupp and Daniel H. Huson. Phylogenetic Networks Do not Need to Be Complex: Using Fewer Reticulations to Represent Conflicting Clusters. In ISMB10, Vol. 26(12):i124-i131 of BIO, 2010.
Keywords: from clusters, level k phylogenetic network, Program Dendroscope, Program HybridInterleave, Program HybridNumber, reconstruction.
Note: http://dx.doi.org/10.1093/bioinformatics/btq202, with proofs: http://arxiv.org/abs/0910.3082.
       
Toggle abstract
30
photophotophotophotophoto
Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara and Gabriel Valiente. Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. In CPM10, Vol. 6129:190-201 of LNCS, springer, 2010.
Keywords: distance between networks, explicit network, level k phylogenetic network, phylogenetic network, polynomial, spread.
Note: http://hdl.handle.net/10119/9859, slides available at http://cs.nyu.edu/parida/CPM2010/MainPage_files/18.pdf.
       
Toggle abstract
31
photophotophoto
Leo van Iersel, Charles Semple and Mike Steel. Locating a tree in a phylogenetic network. In IPL, Vol. 110(23), 2010.
Keywords: cluster containment, explicit network, from network, level k phylogenetic network, normal network, NP complete, phylogenetic network, polynomial, regular network, time consistent network, tree containment, tree sibling network, tree-child network.
Note: http://arxiv.org/abs/1006.3122.
       
Toggle abstract
32
photo
Philippe Gambette. Méthodes combinatoires de reconstruction de réseaux phylogénétiques. PhD thesis, Université Montpellier 2, France, 2010.
Keywords: abstract network, characterization, circular split system, explicit network, FPT, from clusters, from triplets, integer linear programming, level k phylogenetic network, NP complete, phylogenetic network, phylogeny, Program Dendroscope, pyramid, reconstruction, split network, weak hierarchy.
Note: http://tel.archives-ouvertes.fr/tel-00608342/en/.
       

2009
33
photophotophoto
Leo van Iersel, Steven Kelk and Matthias Mnich. Uniqueness, intractability and exact algorithms: reflections on level-k phylogenetic networks. In JBCB, Vol. 7(4):597-623, 2009.
Keywords: explicit network, from triplets, galled tree, level k phylogenetic network, NP complete, phylogenetic network, phylogeny, reconstruction, uniqueness.
Note: http://arxiv.org/pdf/0712.2932v2.
       

34
photo
Leo van Iersel. Algorithms, Haplotypes and Phylogenetic Networks. PhD thesis, Eindhoven University of Technology, The Netherlands, 2009.
Keywords: evaluation, explicit network, exponential algorithm, FPT, from triplets, galled tree, level k phylogenetic network, mu distance, phylogenetic network, phylogeny, polynomial, Program Level2, Program Marlon, Program Simplistic, Program T REX, reconstruction.
Note: http://www.win.tue.nl/~liersel/thesis_vaniersel_viewing.pdf.
       

35
photophoto
Thu-Hien To and Michel Habib. Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time. In CPM09, (5577):275-288, springer, 2009.
Keywords: explicit network, from triplets, level k phylogenetic network, minimum number, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://arxiv.org/abs/0901.1657.
       
Toggle abstract
36
photophotophoto
Philippe Gambette, Vincent Berry and Christophe Paul. The structure of level-k phylogenetic networks. In CPM09, Vol. 5577:289-300 of LNCS, springer, 2009.
Keywords: coalescent, explicit network, galled tree, level k phylogenetic network, phylogenetic network, Program Recodon.
Note: http://hal-lirmm.ccsd.cnrs.fr/lirmm-00371485/en/.
       
Toggle abstract
37
photophoto
Leo van Iersel and Steven Kelk. A short note on the tractability of constructing phylogenetic networks from clusters. 2009.
Keywords: from clusters, from triplets, level k phylogenetic network, phylogenetic network, polynomial, reconstruction.
Note: http://arxiv.org/abs/0912.4502.
       

2008
38
photophotophotophotophotophoto
Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, Ferry Hagen and Teun Boekhout. Constructing level-2 phylogenetic networks from triplets. In RECOMB08, Vol. 4955:450-462 of LNCS, springer, 2008.
Keywords: explicit network, from triplets, level k phylogenetic network, NP complete, phylogenetic network, phylogeny, polynomial, Program Level2, reconstruction.
Note: http://homepages.cwi.nl/~iersel/level2full.pdf. An appendix with proofs can be found here http://arxiv.org/abs/0707.2890.
       
Toggle abstract
39
photophoto
Leo van Iersel and Steven Kelk. Constructing the Simplest Possible Phylogenetic Network from Triplets. In ISAAC08, Vol. 5369:472-483 of LNCS, springer, 2008.
Keywords: explicit network, from triplets, galled tree, level k phylogenetic network, minimum number, phylogenetic network, phylogeny, polynomial, Program Marlon, Program Simplistic.
Note: http://arxiv.org/abs/0805.1859.
       

2006
40
photophoto
Jesper Jansson and Wing-Kin Sung. Inferring a level-1 phylogenetic network from a dense set of rooted triplets. In TCS, Vol. 363(1):60-68, 2006.
Keywords: explicit network, from triplets, galled tree, level k phylogenetic network, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://www.df.lth.se/~jj/Publications/ipnrt8_TCS2006.pdf.
       
Toggle abstract
2005
41
photophotophotophoto
Charles Choy, Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung. Computing the maximum agreement of phylogenetic networks. In TCS, Vol. 335(1):93-107, 2005.
Keywords: dynamic programming, FPT, level k phylogenetic network, MASN, NP complete, phylogenetic network, phylogeny.
Note: http://www.df.lth.se/~jj/Publications/masn8_TCS2005.pdf.
       
Toggle abstract
2004
42
photophotophotophoto
Charles Choy, Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung. Computing the maximum agreement of phylogenetic networks. In Proceedings of Computing: the Tenth Australasian Theory Symposium (CATS'04), Vol. 91:134-147 of Electronic Notes in Theoretical Computer Science, 2004.
Keywords: dynamic programming, FPT, level k phylogenetic network, MASN, NP complete, phylogenetic network, phylogeny.
Note: http://www.df.lth.se/~jj/Publications/masn6_CATS2004.pdf.
       
Toggle abstract
43
photophoto
Jesper Jansson and Wing-Kin Sung. Inferring a level-1 phylogenetic network from a dense set of rooted triplets. In COCOON04, Vol. 3106:462-471 of LNCS, springer, 2004.
Keywords: explicit network, from triplets, galled tree, level k phylogenetic network, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://www.df.lth.se/~jj/Publications/ipnrt6_COCOON2004.pdf.