-
1
-
-
22844448185
-
Bounding the number of hybridisation events for a consistent evolutionary history
-
Baroni M., Grünewald S., Moulton V., and Semple C. Bounding the number of hybridisation events for a consistent evolutionary history. J. Math. Biol. 51 (2005) 171-182
-
(2005)
J. Math. Biol.
, vol.51
, pp. 171-182
-
-
Baroni, M.1
Grünewald, S.2
Moulton, V.3
Semple, C.4
-
3
-
-
17844367344
-
Hybridization as an invasion of the genome
-
Mallet J. Hybridization as an invasion of the genome. Trends Ecol. Evolut. 20 (2005) 229-237
-
(2005)
Trends Ecol. Evolut.
, vol.20
, pp. 229-237
-
-
Mallet, J.1
-
4
-
-
33746278627
-
Reconstructing reticulate evolutionary histories of plants
-
McBreen K., and Lockhart P.J. Reconstructing reticulate evolutionary histories of plants. Trends Plant Sci. 11 (2007) 398-404
-
(2007)
Trends Plant Sci.
, vol.11
, pp. 398-404
-
-
McBreen, K.1
Lockhart, P.J.2
-
5
-
-
0025299784
-
Reconstructing evolution of sequences subject to recombination using parsimony
-
Hein J. Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci. 98 (1990) 185-200
-
(1990)
Math. Biosci.
, vol.98
, pp. 185-200
-
-
Hein, J.1
-
6
-
-
0037279717
-
Bounds on the minimum number of recombination events in a sample history
-
Myers S., and Griffiths R. Bounds on the minimum number of recombination events in a sample history. Genetics 163 (2003) 375-394
-
(2003)
Genetics
, vol.163
, pp. 375-394
-
-
Myers, S.1
Griffiths, R.2
-
7
-
-
33947231094
-
Computing the minimum number of hybridization events for a consistent evolutionary history
-
Bordewich M., and Semple C. Computing the minimum number of hybridization events for a consistent evolutionary history. Discrete Appl. Math. 155 (2007) 914-928
-
(2007)
Discrete Appl. Math.
, vol.155
, pp. 914-928
-
-
Bordewich, M.1
Semple, C.2
-
8
-
-
0031504952
-
Gene trees in species trees
-
Maddison W. Gene trees in species trees. Syst. Biol. 46 (1997) 523-536
-
(1997)
Syst. Biol.
, vol.46
, pp. 523-536
-
-
Maddison, W.1
-
9
-
-
35248892541
-
Parsimonious reconstruction of sequence evolution and haplotyde blocks: Finding the minimum number of recombination events
-
Algorithms in Bioinformatics. Benson G., and Page R. (Eds), Springer, Berlin
-
Song Y.S., and Hein J. Parsimonious reconstruction of sequence evolution and haplotyde blocks: Finding the minimum number of recombination events. In: Benson G., and Page R. (Eds). Algorithms in Bioinformatics. Lecture Notes in Bioinformatics vol. 2812 (2003), Springer, Berlin 287-302
-
(2003)
Lecture Notes in Bioinformatics
, vol.2812
, pp. 287-302
-
-
Song, Y.S.1
Hein, J.2
-
10
-
-
15944363058
-
Constructing minimal ancestral recombination graphs
-
Song Y.S., and Hein J. Constructing minimal ancestral recombination graphs. J. Comput. Biol. 12 (2005) 147-169
-
(2005)
J. Comput. Biol.
, vol.12
, pp. 147-169
-
-
Song, Y.S.1
Hein, J.2
-
11
-
-
13844266486
-
On the computational complexity of the rooted subtree prune and regraft distance
-
Bordewich M., and Semple C. On the computational complexity of the rooted subtree prune and regraft distance. Ann. Comb. 8 (2004) 409-423
-
(2004)
Ann. Comb.
, vol.8
, pp. 409-423
-
-
Bordewich, M.1
Semple, C.2
|