Publications related to 'minimum number'
 
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.
       

3
photophotophotophotophoto
Julia Matsieva, Steven Kelk, Celine Scornavacca, Chris Whidden and Dan Gusfield. A Resolution of the Static Formulation Question for the Problem of Computing the History Bound. In TCBB, 2016.  
Keywords: ARG, explicit network, from sequences, minimum number, phylogenetic network, phylogeny.
Note: to appear.
       

2014
4
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
5
photophoto
Leo van Iersel and Steven Kelk. Kernelizations for the hybridization number problem on multiple nonbinary trees. In WG14, Vol. 8747:299-311 of LNCS, springer, 2014.  
Keywords: explicit network, from rooted trees, kernelization, minimum number, phylogenetic network, phylogeny, Program Treeduce, reconstruction.
Note: http://arxiv.org/abs/1311.4045.
       

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

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

8
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
9
photophoto
Leo van Iersel and Simone Linz. A quadratic kernel for computing the hybridization number of multiple trees. In IPL, Vol. 113:318-323, 2013.  
Keywords: explicit network, FPT, from rooted trees, kernelization, minimum number, phylogenetic network, phylogeny, Program Clustistic, Program MaafB, Program PIRN, reconstruction.
Note: http://arxiv.org/abs/1203.4067, poster.
       
Toggle abstract
10
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
11
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
12
photophoto
Zhi-Zhong Chen and Lusheng Wang. Algorithms for Reticulate Networks of Multiple Phylogenetic Trees. In TCBB, Vol. 9(2):372-384, 2012.  
Keywords: explicit network, from rooted trees, minimum number, phylogenetic network, phylogeny, Program CMPT, Program MaafB, reconstruction, software.
Note: http://rnc.r.dendai.ac.jp/~chen/papers/rMaaf.pdf.
       
Toggle abstract
13
photophotophotophoto
Benjamin Albrecht, Celine Scornavacca, Alberto Cenci and Daniel H. Huson. Fast computation of minimum hybridization networks. In BIO, Vol. 28(2):191-197, 2012.  
Keywords: explicit network, from rooted trees, minimum number, phylogenetic network, phylogeny, Program Dendroscope, Program Hybroscale, reconstruction.
Note: http://dx.doi.org/10.1093/bioinformatics/btr618.
       
Toggle abstract
14
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
2011
15
photophotophoto
Josh Voorkamp né Collins, Simone Linz and Charles Semple. Quantifying hybridization in realistic time. In JCB, Vol. 18(10):1305-1318, 2011.  
Keywords: explicit network, FPT, from rooted trees, hybridization, minimum number, phylogenetic network, phylogeny, Program HybridInterleave, reconstruction, software.
Note: http://wwwcsif.cs.ucdavis.edu/~linzs/CLS10_interleave.pdf, software available at http://www.math.canterbury.ac.nz/~c.semple/software.shtml.
       
Toggle abstract
16
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
17
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
18
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
19
photo
Benjamin Albrecht. Fast Computation of Hybridization Networks. Master's thesis, University of Tübingen, Germany, 2011.  
Keywords: explicit network, from rooted trees, minimum number, phylogenetic network, phylogeny, reconstruction.
       

2010
20
photo
Yufeng Wu. Close Lower and Upper Bounds for the Minimum Reticulate Network of Multiple Phylogenetic Trees. In ISMB10, Vol. 26(12):i140-i148 of BIO, 2010.  
Keywords: explicit network, from rooted trees, hybridization, minimum number, phylogenetic network, phylogeny, Program PIRN, software.
Note: http://dx.doi.org/10.1093/bioinformatics/btq198.
       
Toggle abstract
21
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
22
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
2009
23
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
24
photophoto
Peter J. Humphries and Charles Semple. Note on the hybridization number and subtree distance in phylogenetics. In Applied Mathematics Letters, Vol. 22(4):611-615, 2009.  
Keywords: explicit network, minimum number, phylogenetic network, phylogeny, SPR distance.
Note: http://www.math.canterbury.ac.nz/~c.semple/papers/HS08.pdf.
       

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

26
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
27
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.
       

2005
28
photophoto
Vineet Bafna and Vikas Bansal. Improved recombination lower bounds for haplotype data. In RECOMB05, Vol. 3500:569-584 of LNCS, springer, 2005.  
Keywords: bound, minimum number, phylogeny, recombination.
Note: http://www.cse.ucsd.edu/users/vbafna/pub/recomblb05.pdf.
       

29
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
30
photophotophoto
Rune Lyngsø, Yun S. Song and Jotun Hein. Minimum Recombination Histories by Branch and Bound. In WABI05, Vol. 3692:239-250 of LNCS, springer, 2005.  
Keywords: ARG, branch and bound, from sequences, minimum number, Program Beagle, recombination, reconstruction, software.
Note: http://www.cs.ucdavis.edu/~yssong/Pub/WABI05-239.pdf.
       

31
photophoto
Yun S. Song and Jotun Hein. Constructing Minimal Ancestral Recombination Graphs. In JCB, Vol. 12(2):147-169, 2005.  
Keywords: ARG, minimum number, recombination.
Note: http://www.eecs.berkeley.edu/~yss/Pub/SH-JCB05.pdf.
       

32
photophotophoto
Yun S. Song, Yufeng Wu and Dan Gusfield. Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution. In ISMB05, Vol. 21:i413-i422 of BIO, 2005.  
Keywords: minimum number, Program HapBound, Program SHRUB, recombination.
Note: http://dx.doi.org/10.1093/bioinformatics/bti1033.
       
Toggle abstract
2004
33
photophoto
Vineet Bafna and Vikas Bansal. The Number of Recombination Events in a Sample History: Conflict Graph and Lower Bounds. In TCBB, Vol. 1(2):78-90, 2004.  
Keywords: ARG, bound, minimum number, phylogeny, recombination.
Note: http://www-cse.ucsd.edu/users/vbafna/pub/tcbb04.pdf.
       
Toggle abstract
34
photophotophoto
Mihaela Baroni, Charles Semple and Mike Steel. A framework for representing reticulate evolution. In ACOM, Vol. 8:398-401, 2004.  
Keywords: explicit network, from clusters, hybridization, minimum number, phylogenetic network, phylogeny, reconstruction, regular network, SPR distance.
Note: http://www.math.canterbury.ac.nz/~c.semple/papers/BSS04.pdf.
       
Toggle abstract
35
photophoto
Yun S. Song and Jotun Hein. On the Minimum Number of Recombination Events in the Evolutionary History of DNA Sequences. In JOMB, Vol. 48(2):160-186, 2004.  
Keywords: minimum number, recombination.
Note: http://dx.doi.org/10.1007/s00285-003-0227-5.
       
Toggle abstract
36
photo
Mihaela Baroni. Hybrid phylogenies : a graph-based approach to represent reticulate evolution. PhD thesis, University of Canterbury, New Zealand, 2004.  
Keywords: explicit network, from rooted trees, galled tree, hybridization, minimum number, phylogenetic network, phylogeny, reconstruction, regular network.
Note: http://ir.canterbury.ac.nz/bitstream/10092/4803/1/baroni_thesis.pdf.
       

2003
37
photophoto
Yun S. Song and Jotun Hein. Parsimonious reconstruction of sequence evolution and haplotype blocks: Finding the minimum number of recombination events. In WABI03, Vol. 2812:287-302 of LNCS, springer, 2003.  
Keywords: minimum number, recombination.
Note: http://www.cs.ucdavis.edu/~yssong/Pub/SH-WABI03.pdf.