Publications related to 'polynomial'
 
Order by:   Type | Year
           related to:
Associated keywords
abstract-network agreement-forest approximation APX-hard bound branch-length cactus-graph characterization circular-split-system cluster-containment distance-between-networks diversity duplication dynamic-programming evaluation explicit-network exponential-algorithm FPT from-binary-characters from-binets from-clusters from-distances from-multilabeled-tree from-multistate-characters from-network from-quartets from-rooted-trees from-sequences from-species-tree from-splits from-trees from-trinets from-triplets from-unrooted-trees galled-network galled-tree genetically-stable-network heuristic integer-linear-programming isomorphism k-reticulated labeling lateral-gene-transfer level-k-phylogenetic-network loss MASN minimum-number mu-distance nearly-stable-network NeighborNet nested-network normal-network NP-complete outerplanar parsimony partly-reduced-networks perfect phylogenetic-network phylogeny planar polynomial Program-ARTNET Program-CMPT Program-Dendroscope Program-Fylogenetica Program-GraphDTL Program-Hybroscale Program-Level2 Program-Marlon Program-McKiTscH Program-Mowgli Program-MPNet Program-QuasiDec Program-RANGER-DTL Program-SAGE Program-Simplistic Program-SplitsTree Program-SPNet Program-T-REX Program-Xscape quasi-median-network recombination reconstruction reduced-networks regular-network reticulation-visible-network site-consistency software split split-network SPR-distance spread survey time-consistent-network tree-child-network tree-containment tree-containment. tree-sibling-network tree-based-network tripartition-distance triplet-distance uniqueness visualization weakly-compatible
2017
1
photophotophotophotophoto
Katharina Huber, Leo van Iersel, Vincent Moulton, Celine Scornavacca and Taoyang Wu. Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets. In ALG, Vol. 77(1):173-200, 2017.  
Keywords: explicit network, FPT, from binets, from trinets, NP complete, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://arxiv.org/abs/1411.6804.
       

2
photophotophoto
Andreas Gunawan, Bhaskar DasGupta and Louxin Zhang. A decomposition theorem and two algorithms for reticulation-visible networks. In Information and Computation, Vol. 252:161-175, 2017.  
Keywords: cluster containment, explicit network, from clusters, from network, from rooted trees, phylogenetic network, phylogeny, polynomial, reticulation-visible network, tree containment..
Note: https://www.cs.uic.edu/~dasgupta/resume/publ/papers/Infor_Comput_IC4848_final.pdf.
       

3
photo
Mathias Weller. Linear-Time Tree Containment in Phylogenetic Networks. 2017.  
Keywords: explicit network, from network, from rooted trees, nearly-stable network, phylogenetic network, phylogeny, polynomial, reconstruction, reticulation-visible network, tree containment.
Note: https://arxiv.org/abs/1702.06364.
       

2016
4
photophotophoto
Andreas Gunawan, Bhaskar DasGupta and Louxin Zhang. Locating a Tree in a Reticulation-Visible Network in Cubic Time. In RECOMB2016, Vol. 9649:266 of LNBI, Springer, 2016.  
Keywords: cluster containment, explicit network, from clusters, from network, from rooted trees, phylogenetic network, phylogeny, polynomial, reticulation-visible network, tree containment.
Note: http://arxiv.org/abs/1507.02119.
       

5
photophotophotophotophoto
Philippe Gambette, Andreas Gunawan, Anthony Labarre, Stéphane Vialette and Louxin Zhang. Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time. In IWOCA15, Vol. 9538:197-208 of LNCS, springer, 2016.  
Keywords: explicit network, from network, from rooted trees, genetically stable network, phylogenetic network, phylogeny, polynomial, tree containment.
Note: https://hal-upec-upem.archives-ouvertes.fr/hal-01226035 .
       

6
photophoto
Magnus Bordewich and Charles Semple. Reticulation-visible networks. In Advances in Applied Mathematics, Vol. 78:114-141, 2016.  
Keywords: explicit network, from network, from rooted trees, phylogenetic network, phylogeny, polynomial, tree containment.
Note: http://www.math.canterbury.ac.nz/~c.semple/papers/BS16.pdf.
       

7
photo
Juan Wang. A Metric on the Space of Partly Reduced Phylogenetic Networks. In BMRI, Vol. 2016(7534258):1-9, 2016.  
Keywords: distance between networks, partly reduced networks, phylogenetic network, phylogeny, polynomial, reduced networks.
Note: http://downloads.hindawi.com/journals/bmri/aip/7534258.pdf.
       

2015
8
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.
       

9
photophoto
Andrew R. Francis and Mike Steel. Which phylogenetic networks are merely trees with additional arcs? In Systematic Biology, Vol. 64(5):768-777, 2015.  
Keywords: explicit network, phylogenetic network, phylogeny, polynomial, tree-based network.
Note: http://arxiv.org/abs/1502.07045.
       

10
photophotophotophotophoto
Philippe Gambette, Andreas Gunawan, Anthony Labarre, Stéphane Vialette and Louxin Zhang. Locating a Tree in A Phylogenetic Network in Quadratic Time. In RECOMB15, Vol. 9029:96-107 of LNCS, Springer, 2015.  
Keywords: evaluation, explicit network, from network, from rooted trees, genetically stable network, nearly-stable network, phylogenetic network, phylogeny, polynomial, tree containment.
Note: https://hal.archives-ouvertes.fr/hal-01116231/en.
       

11
photophotophoto
Jittat Fakcharoenphol, Tanee Kumpijit and Attakorn Putwattana. A Faster Algorithm for the Tree Containment Problem for Binary Nearly Stable Phylogenetic Networks. In Proceedings of the The 12th International Joint Conference on Computer Science and Software Engineering (JCSSE'15), Pages 337-342, IEEE, 2015.  
Keywords: dynamic programming, explicit network, from network, from rooted trees, nearly-stable network, phylogenetic network, phylogeny, polynomial, tree containment.
       

12
photophoto
Thu-Hien To and Celine Scornavacca. Efficient algorithms for reconciling gene trees and species networks via duplication and loss events. In RECOMB-CG15, Vol. 16(Suppl 10)(S6):1-14 of BMC Genomics, BioMed Central, 2015.  
Keywords: explicit network, from network, from rooted trees, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://dx.doi.org/10.1186/1471-2164-16-S10-S6.
       

13
photophoto
Marc Thuillard and Didier Fraix-Burnet. Phylogenetic Trees and Networks Reduce to Phylogenies on Binary States: Does It Furnish an Explanation to the Robustness of Phylogenetic Trees against Lateral Transfers? In Evolutionary Bioinformatics, Vol. 11:213-221, 2015. [Abstract]  
Keywords: circular split system, explicit network, from multistate characters, outerplanar, perfect, phylogenetic network, phylogeny, planar, polynomial, reconstruction, split.
Note: http://dx.doi.org/10.4137%2FEBO.S28158.
       

14
photophotophoto
Philippe Gambette, Katharina Huber and Guillaume Scholz. Bridging the gap between rooted and unrooted phylogenetic networks. 2015.  
Keywords: circular split system, explicit network, from splits, galled tree, phylogenetic network, phylogeny, polynomial, reconstruction, split network, uniqueness.
Note: http://arxiv.org/abs/1511.08387.
       

2014
15
photophoto
Sven Herrmann and Vincent Moulton. Computing the blocks of a quasi-median graph. In DAM, Vol. 179:129-138, 2014.  
Keywords: abstract network, from sequences, phylogenetic network, phylogeny, polynomial, Program QuasiDec, quasi-median network, reconstruction.
Note: http://arxiv.org/abs/1206.6135.
       

16
photophoto
Judith Keijsper and Rudi Pendavingh. Reconstructing a phylogenetic level-1 network from quartets. In BMB, Vol. 76(10):2517-2541, 2014.  
Keywords: explicit network, from quartets, galled tree, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://arxiv.org/abs/1308.5206.
       

17
photophoto
Jesper Jansson and Andrzej Lingas. Computing the rooted triplet distance between galled trees by counting triangles. In Journal of Discrete Algorithms, Vol. 25:66-78, 2014.  
Keywords: distance between networks, explicit network, from network, galled network, phylogenetic network, phylogeny, polynomial, triplet distance.
       
Toggle abstract
18
photophotophoto
Sarah Bastkowski, Andreas Spillner and Vincent Moulton. Fishing for minimum evolution trees with Neighbor-Nets. In IPL, Vol. 114(1-2):3-18, 2014.  
Keywords: circular split system, from distances, NeighborNet, phylogeny, polynomial.
       
Toggle abstract
19
photophotophotophoto
Ran Libeskind-Hadas, Yi-Chieh Wu, Mukul S. Bansal and Manolis Kellis. Pareto-optimal phylogenetic tree reconciliation. In ISMB14, Vol. 30:i87-i95 of BIO, 2014.  
Keywords: duplication, lateral gene transfer, loss, phylogenetic network, phylogeny, polynomial, Program Xscape, reconstruction.
Note: http://dx.doi.org/10.1093/bioinformatics/btu289.
       
Toggle abstract
20
photo
Benjamin Albrecht. Computing Hybridization Networks for Multiple Rooted Binary Phylogenetic Trees by Maximum Acyclic Agreement Forests. 2014.  
Keywords: agreement forest, from rooted trees, minimum number, phylogenetic network, phylogeny, polynomial, Program Hybroscale, reconstruction.
Note: http://arxiv.org/abs/1408.3044.
       

21
photo
Julia Matsieva. A Static Formulation of the History Bound Problem. Master's thesis, UC Davis, 2014.  
Keywords: bound, dynamic programming, explicit network, from binary characters, from clusters, phylogenetic network, phylogeny, polynomial.
Note: https://escholarship.org/uc/item/3741t064.
       

2013
22
photophotophoto
Mukul S. Bansal, Eric J. Alm and Manolis Kellis. Reconciliation Revisited: Handling Multiple Optima when Reconciling with Duplication, Transfer, and Loss. In RECOMB13, Vol. 7821:1-13 of LNCS, springer, 2013.  
Keywords: duplication, from rooted trees, from species tree, loss, phylogenetic network, phylogeny, polynomial, Program RANGER-DTL, reconstruction.
Note: http://people.csail.mit.edu/mukul/Bansal_RECOMB2013.pdf.
       
Toggle abstract
23
photophotophotophotophotophoto
Hoa Vu, Francis Chin, Wing-Kai Hon, Henry Leung, Kunihiko Sadakane, Wing-Kin Sung and Siu-Ming Yiu. Reconstructing k-Reticulated Phylogenetic Network from a Set of Gene Trees. In ISBRA13, Vol. 7875:112-124 of LNCS, springer, 2013.  
Keywords: from rooted trees, k-reticulated, phylogenetic network, phylogeny, polynomial, Program ARTNET, Program CMPT, reconstruction.
Note: http://grid.cs.gsu.edu/~xguo9/publications/2013_Cloud%20computing%20for%20de%20novo%20metagenomic%20sequence%20assembly.pdf#page=123.
       
Toggle abstract
24
photo
Willem Sonke. Reconstructing a level-1-network from quartets. 2013.  
Keywords: abstract network, from quartets, phylogenetic network, phylogeny, polynomial, Program Fylogenetica, reconstruction, software, visualization.
Note: http://alexandria.tue.nl/extra1/afstversl/wsk-i/sonke2013.pdf.
       

25
photophotophotophoto
Thi-Hau Nguyen, Vincent Ranwez, Vincent Berry and Celine Scornavacca. Support Measures to Estimate the Reliability of Evolutionary Events Predicted by Reconciliation Methods. In PLoS ONE, Vol. 8(10):e73667, 2013.  
Keywords: duplication, from rooted trees, from species tree, phylogenetic network, phylogeny, polynomial, Program GraphDTL, reconstruction.
Note: http://dx.doi.org/10.1371/journal.pone.0073667.
       
Toggle abstract
2012
26
photophoto
Magnus Bordewich and Charles Semple. Budgeted Nature Reserve Selection with diversity feature loss and arbitrary split systems. In JOMB, Vol. 64(1):69-85, 2012.  
Keywords: abstract network, approximation, diversity, phylogenetic network, polynomial, split network.
Note: http://www.math.canterbury.ac.nz/~c.semple/papers/BS11.pdf.
       
Toggle abstract
27
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, phylogenetic network, phylogeny, polynomial, reconstruction, split, split network.
Note: http://hal.archives-ouvertes.fr/hal-00678046/en/.
       
Toggle abstract
28
photophoto
Jesper Jansson and Andrzej Lingas. Computing the rooted triplet distance between galled trees by counting triangles. In CPM12, Vol. 7354:385-398 of LNCS, springer, 2012.  
Keywords: distance between networks, explicit network, from network, galled tree, phylogenetic network, phylogeny, polynomial, triplet distance.
Note: http://www.df.lth.se/~jj/Publications/d_rt_for_Galled_Trees5_CPM_2012.pdf.
       
Toggle abstract
29
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
30
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
31
photo
Devin Robert Bickner. On normal networks. PhD thesis, Iowa State University, U.S.A., 2012.  
Keywords: distance between networks, explicit network, from network, from trees, normal network, phylogenetic network, phylogeny, polynomial, reconstruction, SPR distance.
Note: http://gradworks.umi.com/3511361.pdf.
       

32
photophoto
Adrià Alcalà Mena and Francesc Rosselló. Ternary graph isomorphism in polynomial time, after Luks. 2012.  
Keywords: distance between networks, explicit network, from network, isomorphism, phylogenetic network, phylogeny, polynomial, Program SAGE.
Note: http://arxiv.org/abs/1209.0871.
       

33
photo
Adrià Alcalà Mena. Trivalent Graph isomorphism in polynomial time. Master's thesis, Universidad de Cantabria, Spain, 2012.  
Keywords: distance between networks, explicit network, from network, isomorphism, phylogenetic network, phylogeny, polynomial, Program SAGE.
Note: http://arxiv.org/abs/1209.1040.
       

2011
34
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
35
photophotophotophotophoto
Jean-Philippe Doyon, Celine Scornavacca, Konstantin Yu Gorbunov, Gergely J. Szöllösi, Vincent Ranwez and Vincent Berry. An efficient algorithm for gene/species trees parsimonious reconciliation with losses, duplications, and transfers. In Proceedings of the Eighth RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG'10), Vol. 6398:93-108 of LNCS, springer, 2011.  
Keywords: branch length, duplication, dynamic programming, explicit network, from multilabeled tree, from species tree, from unrooted trees, lateral gene transfer, loss, phylogenetic network, phylogeny, polynomial, Program Mowgli, reconstruction.
Note: http://www.lirmm.fr/~vberry/Publis/MPR-DoyonEtAl.pdf, software available at http://www.atgc-montpellier.fr/MPR/.
       
Toggle abstract
36
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
37
photophotophoto
Mukul S. Bansal, J. Peter Gogarten and Ron Shamir. Detecting Highways of Horizontal Gene Transfer. In Proceedings of the Eighth RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG'10), Vol. 6398:109-120 of LNCS, springer, 2011.  
Keywords: explicit network, from rooted trees, from species tree, lateral gene transfer, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://www.cs.iastate.edu/~bansal/Highways_RCG10.pdf.
       
Toggle abstract
38
photophoto
Lavanya Kannan, Hua Li and Arcady Mushegian. A Polynomial-Time Algorithm Computing Lower and Upper Bounds of the Rooted Subtree Prune and Regraft Distance. In JCB, Vol. 18(5):743-757, 2011.  
Keywords: bound, minimum number, polynomial, SPR distance.
Note: http://dx.doi.org/10.1089/cmb.2010.0045.
       
Toggle abstract
39
photophotophotophoto
Mukul S. Bansal, Guy Banay, J. Peter Gogarten and Ron Shamir. Detecting Highways of Horizontal Gene Transfer. In JCB, Vol. 18(9):1087-1114, 2011.  
Keywords: explicit network, from rooted trees, from species tree, lateral gene transfer, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://people.csail.mit.edu/mukul/HighwayFull_preprint.pdf.
       
Toggle abstract
40
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.
       

41
photophotophotophoto
Louxin Zhang, Yen Kaow Ng, Taoyang Wu and Yu Zheng. Network model and efficient method for detecting relative duplications or horizontal gene transfers. In ICCABS11, Pages 214-219, 2011.  
Keywords: dynamic programming, explicit network, from network, from rooted trees, from species tree, phylogenetic network, phylogeny, polynomial, reconstruction.
       
Toggle abstract
2010
42
photophoto
Johannes Fischer and Daniel H. Huson. New Common Ancestor Problems in Trees and Directed Acyclic Graphs. In IPL, Vol. 110(8-9):331-335, 2010.  
Keywords: explicit network, phylogenetic network, polynomial.
Note: http://www-ab.informatik.uni-tuebingen.de/people/fischer/lsa.pdf.
       
Toggle abstract
43
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
44
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 child network, tree containment, tree sibling network.
Note: http://arxiv.org/abs/1006.3122.
       
Toggle abstract
2009
45
photophoto
Ulrik Brandes and Sabine Cornelsen. Phylogenetic Graph Models Beyond Trees. In DAM, Vol. 157(10):2361-2369, 2009.  
Keywords: abstract network, cactus graph, from splits, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://www.inf.uni-konstanz.de/~cornelse/Papers/bc-pgmbt-07.pdf.
       
Toggle abstract
46
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.
       

47
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
48
photophotophotophotophoto
Daniel H. Huson, Regula Rupp, Vincent Berry, Philippe Gambette and Christophe Paul. Computing Galled Networks from Real Data. In ISMBECCB09, Vol. 25(12):i85-i93 of BIO, 2009.  
Keywords: abstract network, cluster containment, explicit network, FPT, from clusters, from rooted trees, galled network, NP complete, phylogenetic network, phylogeny, polynomial, Program Dendroscope, reconstruction.
Note: http://hal-lirmm.ccsd.cnrs.fr/lirmm-00368545/en/.
       
Toggle abstract
49
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.
       

50
photophotophotophoto
Bui Quang Minh, Fabio Pardi, Steffen Klaere and Arndt von Haeseler. Budgeted Phylogenetic Diversity on Circular Split Systems. In TCBB, Vol. 6(1):22-29, 2009.  
Keywords: abstract network, circular split system, dynamic programming, from network, phylogenetic network, polynomial, split, split network.
Note: http://dx.doi.org/10.1109/TCBB.2008.54.
       
Toggle abstract
2008
51
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
52
photo
Stephen J. Willson. Reconstruction of certain phylogenetic networks from the genomes at their leaves. In JTB, Vol. 252(2):185-376, 2008.  
Keywords: labeling, polynomial.
Note: http://www.public.iastate.edu/~swillson/ReconstructNormalHomopap6.pdf.
       
Toggle abstract
53
photophotophotophoto
Gabriel Cardona, Mercè Llabrés, Francesc Rosselló and Gabriel Valiente. A Distance Metric for a Class of Tree-Sibling Phylogenetic Networks. In BIO, Vol. 24(13):1481-1488, 2008.  
Keywords: distance between networks, phylogenetic network, phylogeny, polynomial, tree sibling network.
Note: http://dx.doi.org/10.1093/bioinformatics/btn231.
       
Toggle abstract
54
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.
       

55
photophoto
Jesper Jansson and Wing-Kin Sung. The Maximum Agreement of Two Nested Phylogenetic Networks. In Oleg N. Terikhovsky and William N. Burton editors, New Topics in Theoretical Computer Science, Pages 119-141, Nova Publishers, 2008.  
Keywords: dynamic programming, MASN, nested network, phylogenetic network, phylogeny, polynomial.
Note: http://www.df.lth.se/~jj/Publications/nested12_NTTCS2008_corrected.pdf.
       

56
photophoto
Daniel H. Huson and Regula Rupp. Summarizing Multiple Gene Trees Using Cluster Networks. In WABI08, Vol. 5251:296-305 of LNCS, springer, 2008.  
Keywords: abstract network, from clusters, from rooted trees, phylogenetic network, phylogeny, polynomial, Program Dendroscope.
Note: http://dx.doi.org/10.1007/978-3-540-87361-7_25, slides from the MIEP Conference available at http://www.lirmm.fr/MIEP08/slides/11_13_rupp.pdf.
       
Toggle abstract
57
photophotophotophoto
Gabriel Cardona, Mercè Llabrés, Francesc Rosselló and Gabriel Valiente. Phylogenetic Networks: Justification, Models, Distances and Algorithms. In VI Jornadas de Matemática Discreta y Algorítmica (JMDA'08), 2008.  
Keywords: distance between networks, mu distance, phylogenetic network, phylogeny, polynomial, survey, time consistent network, tree child network, tripartition distance, triplet distance.
Note: http://bioinfo.uib.es/media/uploaded/jmda2008_submission_61-1.pdf.
       

2006
58
photophotophoto
Mihaela Baroni, Charles Semple and Mike Steel. Hybrids in Real Time. In Systematic Biology, Vol. 55(1):46-56, 2006.  
Keywords: agreement forest, from rooted trees, phylogenetic network, phylogeny, polynomial, reconstruction, time consistent network.
Note: http://www.math.canterbury.ac.nz/~m.steel/Non_UC/files/research/hybrids.pdf.
       
Toggle abstract
59
photophotophotophoto
Ho-Leung Chan, Jesper Jansson, Tak-Wah Lam and Siu-Ming Yiu. Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. In JBCB, Vol. 4(4):807-832, 2006.  
Keywords: explicit network, from distances, galled tree, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://www.df.lth.se/~jj/Publications/dist_ugn7_JBCB2006.pdf.
       
Toggle abstract
60
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. 1 comment  
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
61
photophotophoto
Jesper Jansson, Nguyen Bao Nguyen and Wing-Kin Sung. Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network. In SICOMP, Vol. 35(5):1098-1121, 2006. 1 comment  
Keywords: approximation, explicit network, from triplets, galled tree, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://www.df.lth.se/~jj/Publications/triplets_to_gn7_SICOMP2006.pdf.
       
Toggle abstract
62
photo
Yun S. Song. A Concise Necessary and Sufficient Condition for the Existence of a Galled-Tree. In TCBB, Vol. 3(2):186-191, 2006.  
Keywords: characterization, from sequences, galled tree, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://www.eecs.berkeley.edu/~yss/Pub/nasc4gall.pdf.
       

63
photo
Pawel Górecki. Detection of horizontal gene transfer. PhD thesis, Warsaw University, Poland, 2006.  
Keywords: explicit network, from rooted trees, from species tree, lateral gene transfer, NP complete, parsimony, phylogenetic network, phylogeny, polynomial, reconstruction.
       

64
photophoto
Mihaela Baroni and Mike Steel. Accumulation Phylogenies. In ACOM, Vol. 10(1):19-30, 2006.  
Keywords: abstract network, from clusters, from distances, phylogenetic network, phylogeny, polynomial, reconstruction, regular network.
Note: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.1960.
       
Toggle abstract
2005
65
photo
Elena Dubrova. Phylogenetic networks with edge-disjoint recombination cycles. In Proceedings of SPIE Bioengineered and Bioinspired Systems II (SPIE-BBS II), Vol. 5839:381-388, 2005.  
Keywords: galled tree, phylogenetic network, polynomial, site consistency.
Note: http://dx.doi.org/10.1117/12.607910.
       
Toggle abstract
66
photophoto
Dan Gusfield and Vikas Bansal. A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters. In RECOMB05, Vol. 3500:217-232 of LNCS, springer, 2005.  
Keywords: explicit network, from sequences, phylogenetic network, phylogeny, polynomial, recombination, reconstruction.
Note: http://wwwcsif.cs.ucdavis.edu/~gusfield/gusfieldrecomb.pdf.
       

67
photophotophotophoto
Trinh N. D. Huynh, Jesper Jansson, Nguyen Bao Nguyen and Wing-Kin Sung. Constructing a Smallest Refining Galled Phylogenetic Network. In RECOMB05, Vol. 3500:265-280 of LNCS, springer, 2005.  
Keywords: from rooted trees, galled tree, NP complete, phylogenetic network, phylogeny, polynomial, Program SPNet, reconstruction.
Note: http://www.df.lth.se/~jj/Publications/refining_gn3_RECOMB2005.pdf.
       

68
photophoto
Jesper Jansson and Wing-Kin Sung. The Maximum Agreement of Two Nested Phylogenetic Networks. In ISAAC04, Vol. 3341:581-593 of LNCS, springer, 2005.  
Keywords: dynamic programming, MASN, nested network, NP complete, phylogenetic network, phylogeny, polynomial.
Note: http://www.df.lth.se/~jj/Publications/nested7_ISAAC2004.pdf.
       

69
photophotophoto
Jesper Jansson, Nguyen Bao Nguyen and Wing-Kin Sung. Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network. In SODA05, Pages 349-358, 2005. 1 comment  
Keywords: approximation, explicit network, from triplets, galled tree, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://portal.acm.org/citation.cfm?id=1070481.
       

70
photophoto
Luay Nakhleh and Li-San Wang. Phylogenetic Networks, Trees, and Clusters. In IWBRA05, Vol. 3515:919-926 of LNCS, springer, 2005.  
Keywords: cluster containment, evaluation, from clusters, from network, from rooted trees, phylogenetic network, phylogeny, polynomial, tree child network, tree containment.
Note: http://www.cs.rice.edu/~nakhleh/Papers/NakhlehWang.pdf.
       

71
photophoto
Luay Nakhleh and Li-San Wang. Phylogenetic Networks: Properties and Relationship to Trees and Clusters. In TCSB2, Vol. 3680:82-99 of LNCS, springer, 2005.  
Keywords: cluster containment, evaluation, from clusters, from network, from rooted trees, phylogenetic network, phylogeny, polynomial, tree child network, tree containment.
Note: http://www.cs.rice.edu/~nakhleh/Papers/LNCS_TCSB05.pdf.
       

72
photophotophotophoto
Luay Nakhleh, Tandy Warnow, C. Randal Linder and Katherine St. John. Reconstructing reticulate evolution in species - theory and practice. In JCB, Vol. 12(6):796-811, 2005.  
Keywords: from rooted trees, galled tree, phylogenetic network, phylogeny, polynomial, Program SPNet, reconstruction, software.
Note: http://www.cs.rice.edu/~nakhleh/Papers/NWLSjcb.pdf.
       

73
photo
Derek Ruths. Applications of phylogenetic incongruence to detecting and reconstructing interspecific recombination and horizontal gene transfer. Master's thesis, Rice University, U.S.A., 2005.  
Keywords: explicit network, from rooted trees, from species tree, heuristic, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://hdl.handle.net/1911/17912.
       

2004
74
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. 1 comment  
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.
       

75
photophotophoto
Luay Nakhleh, Tandy Warnow and C. Randal Linder. Reconstructing reticulate evolution in species - theory and practice. In RECOMB04, Pages 337-346, 2004.  
Keywords: from rooted trees, galled tree, phylogenetic network, phylogeny, polynomial, Program SPNet, reconstruction, software.
Note: http://www.cs.rice.edu/~nakhleh/Papers/144-nakhleh.pdf.
       

76
photophotophoto
Mike Hallett, Jens Lagergren and Ali Tofigh. Simultaneous Identification of Duplications and Lateral Transfers. In RECOMB04, Pages 347-356, 2004.  
Keywords: duplication, explicit network, FPT, from rooted trees, from species tree, lateral gene transfer, loss, NP complete, parsimony, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://www.nada.kth.se/~jensl/p164-hallett.pdf.
       

77
photophoto
Mike Hallett and Jens Lagergren. Efficient algorithms for lateral gene transfers problems. 2004.  
Keywords: from rooted trees, lateral gene transfer, NP complete, phylogeny, polynomial, reconstruction.
Note: submitted to SIAM Journal on Computing, http://www.mcb.mcgill.ca/~hallett/Lateral.pdf.
       

78
photo
Pawel Górecki. Reconciliation problems for duplication, loss and horizontal gene transfer. In RECOMB04, Pages 316-325, 2004.  
Keywords: duplication, explicit network, from rooted trees, from species tree, lateral gene transfer, loss, NP complete, parsimony, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://ai.stanford.edu/~serafim/CS374_2004/Papers/Gorecki_Reconciliation.pdf.
       

2003
79
photophotophotophotophotophoto
Luay Nakhleh, Jerry Sun, Tandy Warnow, C. Randal Linder, Bernard M. E. Moret and Anna Tholse. Towards the Development of Computational Tools for Evaluating Phylogenetic Network Reconstruction Methods. In PSB03, 2003.  
Keywords: distance between networks, evaluation, phylogenetic network, phylogeny, polynomial, tripartition distance.
Note: http://www.cs.rice.edu/~nakhleh/Papers/psb03.pdf.
       

80
photo
Pawel Górecki. Single step reconciliation algorithm for duplication, loss and horizontal gene transfer model. In ECCB03, 2003.  
Keywords: duplication, explicit network, from rooted trees, from species tree, lateral gene transfer, NP complete, parsimony, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://www.inra.fr/eccb2003/posters/pdf/short/S_gorecki.ps.
       

2001
81
photophoto
Mike Hallett and Jens Lagergren. Efficient algorithms for lateral gene transfers problems. In RECOMB01, Pages 141-148, 2001.  
Keywords: from rooted trees, lateral gene transfer, NP complete, phylogeny, polynomial, Program McKiTscH, reconstruction.
Note: http://dx.doi.org/10.1145/369133.369188.
       

82
photophotophoto
Lusheng Wang, Kaizhong Zhang and Louxin Zhang. Perfect phylogenetic networks with recombination. In SAC01, Pages 46-50, 2001.  
Keywords: from sequences, galled tree, NP complete, perfect, phylogenetic network, phylogeny, polynomial, recombination, reconstruction.
Note: http://dx.doi.org/10.1145/372202.372271.
       

1999
83
photophoto
Vincent Berry and David Bryant. Faster reliable phylogenetic analysis. In RECOMB99, Pages 59-68, 1999.  
Keywords: abstract network, from quartets, phylogenetic network, phylogeny, polynomial, Program SplitsTree, reconstruction, split network, weakly compatible.
Note: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.9151.
       

1998
84
photophoto
John Kececioglu and Dan Gusfield. Reconstructing a history of recombinations from a set of sequences. In DAM, Pages 239-260, 1998.  
Keywords: from sequences, NP complete, polynomial, recombination, reconstruction.
Note: http://citeseer.ist.psu.edu/76600.html.
       

1994
85
photophoto
John Kececioglu and Dan Gusfield. Reconstructing a history of recombinations from a set of sequences. In SODA94, Pages 471-480, 1994.  
Keywords: from sequences, NP complete, polynomial, recombination, reconstruction.
Note: http://portal.acm.org/citation.cfm?id=314626#.