Publications related to 'agreement forest'
 
Order by:   Type | Year
           related to:
Associated keywords
2016
1
photophotophotophotophoto
Leo van Iersel, Steven Kelk, Nela Lekic, Chris Whidden and Norbert Zeh. Hybridization Number on Three Rooted Binary Trees is EPT. In SIDMA, Vol. 30(3):1607-1631, 2016.  
Keywords: agreement forest, explicit network, FPT, from rooted trees, hybridization, minimum number, phylogenetic network, phylogeny, reconstruction.
Note: http://arxiv.org/abs/1402.2136.
       

2
photophotophotophoto
Steven Kelk, Leo van Iersel, Celine Scornavacca and Mathias Weller. Phylogenetic incongruence through the lens of Monadic Second Order logic. In JGAA, Vol. 20(2):189-215, 2016.  
Keywords: agreement forest, explicit network, FPT, from rooted trees, hybridization, minimum number, MSOL, phylogenetic network, phylogeny, reconstruction.
Note: http://jgaa.info/accepted/2016/KelkIerselScornavaccaWeller2016.20.2.pdf.
       

2015
3
photo
Benjamin Albrecht. Computing all hybridization networks for multiple binary phylogenetic input trees. In BMCB, Vol. 16(236):1-15, 2015.  
Keywords: agreement forest, explicit network, exponential algorithm, FPT, from rooted trees, phylogenetic network, phylogeny, Program Hybroscale, Program PIRN, reconstruction.
Note: http://dx.doi.org/10.1186/s12859-015-0660-7.
       

4
photo
Benjamin Albrecht. Computing a Relevant Set of Nonbinary Maximum Acyclic Agreement Forests. 2015.  
Keywords: agreement forest, explicit network, exponential algorithm, from rooted trees, phylogenetic network, phylogeny, Program Hybroscale, reconstruction, software.
Note: http://arxiv.org/abs/1512.05703.
       

5
photo
Benjamin Albrecht. Fast computation of all maximum acyclic agreement forests for two rooted binary phylogenetic trees. 2015.  
Keywords: agreement forest, explicit network, from rooted trees, phylogenetic network, phylogeny, Program Hybroscale, reconstruction, software.
Note: http://arxiv.org/abs/1512.05656.
       

2014
6
photophotophotophoto
Leo van Iersel, Steven Kelk, Nela Lekic and Leen Stougie. Approximation algorithms for nonbinary agreement forests. In SIDMA, Vol. 28(1):49-66, 2014.  
Keywords: agreement forest, approximation, from rooted trees, hybridization, minimum number, phylogenetic network, phylogeny, reconstruction.
Note: http://arxiv.org/abs/1210.3211.
       
Toggle abstract
7
photo
Josh Voorkamp né Collins. Untangling Evolution. PhD thesis, University of Otago, New Zealand, 2014.  
Keywords: agreement forest, explicit network, from rooted trees, generation, phylogenetic network, phylogeny, reconstruction.
Note: http://otago.ourarchive.ac.nz/handle/10523/4802.
       

8
photophotophotophoto
Leo van Iersel, Steven Kelk, Nela Lekic and Celine Scornavacca. A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees. In BMCB, Vol. 15(127):1-12, 2014.  
Keywords: agreement forest, approximation, explicit network, from rooted trees, phylogenetic network, phylogeny, Program CycleKiller, Program TerminusEst, reconstruction.
Note: http://dx.doi.org/10.1186/1471-2105-15-127.
       

9
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.
       

10
photophoto
Puspal Bhabak and Asish Mukhopadhyay. A 3-factor approximation algorithm for a Minimum Acyclic Agreement Forest on k rooted, binary phylogenetic trees. 2014.  
Keywords: agreement forest, approximation, explicit network, from rooted trees, phylogenetic network, phylogeny, reconstruction.
Note: http://arxiv.org/abs/1407.7125.
       

11
photo
Zhijiang Li. Fixed-Parameter Algorithm for Hybridization Number of Two Multifurcating Trees. Master's thesis, Dalhousie University, Canada, 2014.  
Keywords: agreement forest, explicit network, FPT, from rooted trees, minimum number, phylogenetic network, phylogeny, reconstruction.
Note: http://hdl.handle.net/10222/53976.
       

12
photo
Josh Voorkamp né Collins. Maximal Acyclic Agreement Forests. In JCB, Vol. 21(10):723-731, 2014.  
Keywords: agreement forest, explicit network, from rooted trees, hybridization, minimum number, phylogenetic network, phylogeny, reconstruction.
       

2013
13
photophotophoto
Chris Whidden, Robert G. Beiko and Norbert Zeh. Fixed-Parameter Algorithms for Maximum Agreement Forests. In SICOMP, Vol. 42(4):1431-1466, 2013.  
Keywords: agreement forest, explicit network, FPT, from rooted trees, hybridization, minimum number, phylogenetic network, phylogeny, Program HybridInterleave, reconstruction, SPR distance.
Note: http://arxiv.org/abs/1108.2664, slides.
       
Toggle abstract
14
photophotophoto
Peter J. Humphries, Simone Linz and Charles Semple. On the complexity of computing the temporal hybridization number for two phylogenies. In DAM, Vol. 161:871-880, 2013.  
Keywords: agreement forest, APX hard, characterization, from rooted trees, hybridization, NP complete, phylogenetic network, phylogeny, reconstruction, time consistent network.
Note: http://ab.inf.uni-tuebingen.de/people/linz/publications/TAFapx.pdf.
       
Toggle abstract
15
photophoto
Zhi-Zhong Chen and Lusheng Wang. An Ultrafast Tool for Minimum Reticulate Networks. In JCB, Vol. 20(1):38-41, 2013.  
Keywords: agreement forest, explicit network, from rooted trees, phylogenetic network, phylogeny, Program ultra-Net, reconstruction.
Note: http://www.cs.cityu.edu.hk/~lwang/research/jcb2013.pdf.
       
Toggle abstract
16
photo
Chris Whidden. Efficient Computation and Application of Maximum Agreement Forests. PhD thesis, Dalhousie University, Canada, 2013.  
Keywords: agreement forest, explicit network, FPT, from rooted trees, minimum number, phylogenetic network, phylogeny, reconstruction.
Note: http://hdl.handle.net/10222/35349.
       

2012
17
photophotophoto
Celine Scornavacca, Simone Linz and Benjamin Albrecht. A fi rst step towards computing all hybridization networks for two rooted binary phylogenetic trees. In JCB, Vol. 19:1227-1242, 2012.  
Keywords: agreement forest, explicit network, FPT, from rooted trees, phylogenetic network, phylogeny, Program Dendroscope, Program Hybroscale, reconstruction.
Note: http://arxiv.org/abs/1109.3268.
       
Toggle abstract
18
photophotophotophotophotophoto
Steven Kelk, Leo van Iersel, Nela Lekic, Simone Linz, Celine Scornavacca and Leen Stougie. Cycle killer... qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set. In SIDMA, Vol. 26(4):1635-1656, 2012.  
Keywords: agreement forest, approximation, explicit network, from rooted trees, minimum number, phylogenetic network, phylogeny, Program CycleKiller, reconstruction.
Note: http://arxiv.org/abs/1112.5359, about the title.
       
Toggle abstract
19
photophotophotophoto
Leo van Iersel, Steven Kelk, Nela Lekic and Celine Scornavacca. A practical approximation algorithm for solving massive instances of hybridization number. In WABI12, Vol. 7534(430-440) of LNCS, springer, 2012.  
Keywords: agreement forest, approximation, explicit network, from rooted trees, hybridization, phylogenetic network, phylogeny, Program CycleKiller, Program Dendroscope, Program HybridNET, reconstruction, software.
Note: http://arxiv.org/abs/1205.3417.
       
Toggle abstract
20
photophoto
Zhi-Zhong Chen, Lusheng Wang and Satoshi Yamanaka. A fast tool for minimum hybridization networks. In BMCB, Vol. 13:155, 2012.  
Keywords: agreement forest, explicit network, from rooted trees, phylogenetic network, phylogeny, Program FastHN, reconstruction, software.
Note: http://dx.doi.org/10.1186/1471-2105-13-155.
       
Toggle abstract
2011
21
photo
Puspal Bhabak. Improving the approximation ratio of the maximum agreement forest (MAF) on k trees and estimating the approximation ratio of the acyclic-MAF on k trees. Master's thesis, University of Windsor, Canada, 2011.  
Keywords: agreement forest, approximation, explicit network, from rooted trees, phylogenetic network, phylogeny, reconstruction.
Note: http://scholar.uwindsor.ca/cgi/viewcontent.cgi?article=1315&context=etd.
       

2010
22
photo
Yufeng Wu and Jiayin Wang. Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees. In ISBRA10, Vol. 6053:203-214 of LNCS, springer, 2010.  
Keywords: agreement forest, explicit network, from rooted trees, hybridization, integer linear programming, minimum number, phylogenetic network, phylogeny, Program HybridNumber, Program SPRDist, SPR distance.
Note: http://www.engr.uconn.edu/~ywu/Papers/ISBRA10WuWang.pdf.
       
Toggle abstract
23
photophotophoto
Chris Whidden, Robert G. Beiko and Norbert Zeh. Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments. In Proceedings of the ninth International Symposium on Experimental Algorithms (SEA'10), Vol. 6049:141-153 of LNCS, springer, 2010.  
Keywords: agreement forest, explicit network, FPT, from rooted trees, hybridization, minimum number, phylogenetic network, phylogeny, Program HybridInterleave, reconstruction, SPR distance.
Note: https://www.cs.dal.ca/sites/default/files/technical_reports/CS-2010-03.pdf.
       
Toggle abstract
24
photophoto
Zhi-Zhong Chen and Lusheng Wang. HybridNET: a tool for constructing hybridization networks. In BIO, Vol. 26(22):2912-2913, 2010.  
Keywords: agreement forest, FPT, from rooted trees, hybridization, phylogenetic network, phylogeny, Program HybridNET, software.
Note: http://rnc.r.dendai.ac.jp/~chen/papers/note2.pdf.
       
Toggle abstract
2009
25
photophoto
Simone Linz and Charles Semple. Hybridization in non-binary trees. In TCBB, Vol. 6(1):30-45, 2009.  
Keywords: agreement forest, FPT, from rooted trees, hybridization, phylogenetic network, phylogeny, reconstruction.
Note: http://www.math.canterbury.ac.nz/~c.semple/papers/LS08.pdf, slides available at http://www.newton.cam.ac.uk/webseminars/pg+ws/2007/plg/plgw03/1220/linz/.
       

26
photo
Josh Voorkamp né Collins. Rekernelisation Algorithms in Hybrid Phylogenies. Master's thesis, University of Canterbury, New Zealand, 2009.  
Keywords: agreement forest, explicit network, FPT, from rooted trees, from unrooted trees, hybridization, minimum number, phylogenetic network, phylogeny, Program HybridInterleave, reconstruction, software.
Note: http://hdl.handle.net/10092/2852.
       

27
photo
Chris Whidden. A Unifying View on Approximation and FPT of Agreement Forests. Master's thesis, Dalhousie University, Canada, 2009.  
Keywords: agreement forest, approximation, explicit network, FPT, from rooted trees, hybridization, phylogenetic network, phylogeny, reconstruction, SPR distance.
Note: http://web.cs.dal.ca/~whidden/MCSThesis09.pdf.
       

28
photophoto
Chris Whidden and Norbert Zeh. A Unifying View on Approximation and FPT of Agreement Forests. In WABI09, Vol. 5724:390-402 of LNCS, Springer, 2009.  
Keywords: agreement forest, approximation, explicit network, FPT, minimum number, phylogenetic network, phylogeny, reconstruction.
Note: https://www.cs.dal.ca/sites/default/files/technical_reports/CS-2009-02.pdf.
       
Toggle abstract
2008
29
photo
Simone Linz. Reticulation in evolution. PhD thesis, Heinrich-Heine-University, Düsseldorf, Germany, 2008.  
Keywords: agreement forest, FPT, from rooted trees, lateral gene transfer, phylogenetic network, phylogeny, SPR distance, statistical model.
Note: http://docserv.uni-duesseldorf.de/servlets/DocumentServlet?id=8505.
       

2007
30
photophotophotophoto
Magnus Bordewich, Simone Linz, Katherine St. John and Charles Semple. A reduction algorithm for computing the hybridization number of two trees. In EBIO, Vol. 3:86-98, 2007.  
Keywords: agreement forest, FPT, from rooted trees, hybridization, phylogenetic network, phylogeny, Program HybridNumber.
Note: http://www.math.canterbury.ac.nz/~c.semple/papers/BLSS07.pdf.
       

31
photophoto
Magnus Bordewich and Charles Semple. Computing the minimum number of hybridization events for a consistent evolutionary history. In DAM, Vol. 155:914-918, 2007.  
Keywords: agreement forest, approximation, APX hard, explicit network, from rooted trees, hybridization, inapproximability, NP complete, phylogenetic network, phylogeny, SPR distance.
Note: http://www.math.canterbury.ac.nz/~c.semple/papers/BS06a.pdf.
       

2006
32
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
2005
33
photophotophotophoto
Mihaela Baroni, Stefan Grünewald, Vincent Moulton and Charles Semple. Bounding the number of hybridization events for a consistent evolutionary history. In JOMB, Vol. 51(2):171-182, 2005.  
Keywords: agreement forest, bound, explicit network, from rooted trees, hybridization, minimum number, phylogenetic network, phylogeny, reconstruction, SPR distance.
Note: http://www.math.canterbury.ac.nz/~c.semple/papers/BGMS05.pdf.
       
Toggle abstract
34
photophoto
Magnus Bordewich and Charles Semple. On the computational complexity of the rooted subtree prune and regraft distance. In ACOM, Vol. 8:409-423, 2005.  
Keywords: agreement forest, from rooted trees, NP complete, SPR distance.
Note: http://www.math.canterbury.ac.nz/~c.semple/papers/BS04.pdf.
       
Toggle abstract