-
1
-
-
0347512294
-
Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees
-
B.L. Allen and M. Steel, "Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees," Annals of Combinatorics, vol. 5, pp. 1-13, 2001.
-
(2001)
Annals of Combinatorics
, vol.5
, pp. 1-13
-
-
Allen, B.L.1
Steel, M.2
-
2
-
-
22844448185
-
Bounding the Number of Hybridization Events for a Consistent Evolutionary History
-
M. Baroni, S. Grünewald, V. Moulton, and C Semple, "Bounding the Number of Hybridization Events for a Consistent Evolutionary History," Math. Biology, vol. 51, pp. 171-182, 2005.
-
(2005)
Math. Biology
, vol.51
, pp. 171-182
-
-
Baroni, M.1
Grünewald, S.2
Moulton, V.3
Semple, C.4
-
3
-
-
33644600474
-
Hybrids in Real Time
-
M. Baroni, C. Semple, and M. Steel, "Hybrids in Real Time," Systematic Biology, vol. 55, pp. 46-56, 2006.
-
(2006)
Systematic Biology
, vol.55
, pp. 46-56
-
-
Baroni, M.1
Semple, C.2
Steel, M.3
-
4
-
-
34547963170
-
Approximating Subtree Distances between Phylogenies
-
M.K. Bonet, K. St. John, R. Mahindru, and N. Amenta, "Approximating Subtree Distances between Phylogenies," J. Computational Biology, vol. 13, pp. 1419-1434, 2006.
-
(2006)
J. Computational Biology
, vol.13
, pp. 1419-1434
-
-
Bonet, M.K.1
St. John, K.2
Mahindru, R.3
Amenta, N.4
-
5
-
-
13844266486
-
On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance
-
M. Bordewich and C. Semple, "On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance," Annals of Combinatorics, vol. 8, pp. 409-423, 2004.
-
(2004)
Annals of Combinatorics
, vol.8
, pp. 409-423
-
-
Bordewich, M.1
Semple, C.2
-
6
-
-
33947231094
-
Computing the Minimum Number of Hybridisation Events for a Consistent Evolutionary History
-
M. Bordewich and C. Semple, "Computing the Minimum Number of Hybridisation Events for a Consistent Evolutionary History," Discrete Applied Math., vol. 155, pp. 914-928, 2007.
-
(2007)
Discrete Applied Math
, vol.155
, pp. 914-928
-
-
Bordewich, M.1
Semple, C.2
-
9
-
-
3242876395
-
Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination
-
D. Gusfield, S. Eddhu, and C. Langley, "Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination," J. Bioinformatics and Computational Biology, vol. 2, pp. 173-213, 2004.
-
(2004)
J. Bioinformatics and Computational Biology
, vol.2
, pp. 173-213
-
-
Gusfield, D.1
Eddhu, S.2
Langley, C.3
-
11
-
-
0025299784
-
Reconstructing Evolution of Sequences Subject to Recombination Using Parsimony
-
J. Hein, "Reconstructing Evolution of Sequences Subject to Recombination Using Parsimony," Math. Biosciences, vol. 98, pp. 185-200, 1990.
-
(1990)
Math. Biosciences
, vol.98
, pp. 185-200
-
-
Hein, J.1
-
12
-
-
0027471670
-
A Heuristic Method to Reconstruct the History of Sequences Subject to Recombination
-
J. Hein, "A Heuristic Method to Reconstruct the History of Sequences Subject to Recombination," J. Molecular Evolution, vol. 36, pp. 396-405, 1993.
-
(1993)
J. Molecular Evolution
, vol.36
, pp. 396-405
-
-
Hein, J.1
-
13
-
-
0002291589
-
On the Complexity of Comparing Evolutionary Trees
-
J. Hein, T. Jing, L. Wang, and K. Zhang, "On the Complexity of Comparing Evolutionary Trees," Discrete Applied Math., vol. 71, pp. 153-169, 1996.
-
(1996)
Discrete Applied Math
, vol.71
, pp. 153-169
-
-
Hein, J.1
Jing, T.2
Wang, L.3
Zhang, K.4
-
14
-
-
0031504952
-
Gene Trees in Species Trees
-
W. Maddison, "Gene Trees in Species Trees," Systematic Biology, vol. 46, pp. 523-536, 1997.
-
(1997)
Systematic Biology
, vol.46
, pp. 523-536
-
-
Maddison, W.1
-
15
-
-
23844438866
-
Reconstructing Reticulate Evolution in Species-Theory and Practice
-
L. Nakhleh, T. Warnow, C.R. Linder, and K. St. John, "Reconstructing Reticulate Evolution in Species-Theory and Practice," J. Computational Biology, vol. 12, pp. 796-811, 2005.
-
(2005)
J. Computational Biology
, vol.12
, pp. 796-811
-
-
Nakhleh, L.1
Warnow, T.2
Linder, C.R.3
St. John, K.4
-
16
-
-
23044530218
-
Some Approximation Results for the Maximum Agreement Forest Problem
-
M. Goemans et al, eds, pp, Springer
-
E.M. Rodrigues, M.-F. Sagot, and Y. Wakabayashi, "Some Approximation Results for the Maximum Agreement Forest Problem," Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, M. Goemans et al., eds., pp. 159-169, Springer, 2001.
-
(2001)
Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
, pp. 159-169
-
-
Rodrigues, E.M.1
Sagot, M.-F.2
Wakabayashi, Y.3
-
18
-
-
35248892541
-
-
Y.S. Song and J. Hein, Parsimonious Reconstruction of Sequence Evolution and Haplotyde Blocks: Finding the Minimum Number of Recombination Events, Algorithms in Bioinformatics, Proc. WABI '03, G. Benson and R. Page, eds., pp. 287-302, 2003.
-
Y.S. Song and J. Hein, "Parsimonious Reconstruction of Sequence Evolution and Haplotyde Blocks: Finding the Minimum Number of Recombination Events," Algorithms in Bioinformatics, Proc. WABI '03, G. Benson and R. Page, eds., pp. 287-302, 2003.
-
-
-
-
19
-
-
0034913468
-
Perfect Phylogenetic Networks with Recombination
-
L. Wang, K. Zhang, and L. Zhang, "Perfect Phylogenetic Networks with Recombination," J. Computational Biology, vol. 8, pp. 69-78, 2001.
-
(2001)
J. Computational Biology
, vol.8
, pp. 69-78
-
-
Wang, L.1
Zhang, K.2
Zhang, L.3
|