-
1
-
-
44649160163
-
An improved fixed-parameter algorithm for minimum-ip consensus trees
-
Proc. of International Workshop on Parameterized and Exact Computation (IWPEC 2008), Springer
-
S. Böcker, Q. B. A. Bui, and A. Truss. An improved fixed-parameter algorithm for minimum-ip consensus trees. In Proc. of International Workshop on Parameterized and Exact Computation (IWPEC 2008), volume 5018 of Lect. Notes Comput. Sc., pages 43-54. Springer, 2008.
-
(2008)
Lect. Notes Comput. Sc.
, vol.5018
, pp. 43-54
-
-
Böcker, S.1
Bui, Q.B.A.2
Truss, A.3
-
2
-
-
0041599373
-
Flipping: A supertree construction method
-
of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society
-
D. Chen, L. Diao, O. Eulenstein, D. Fernandez-Baca, and M. J. Sanderson. Flipping: A supertree construction method. In Bioconsensus, volume 61 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 135-160. American Mathematical Society, 2003.
-
(2003)
Bioconsensus
, vol.61
, pp. 135-160
-
-
Chen, D.1
Diao, L.2
Eulenstein, O.3
Fernandez-Baca, D.4
Sanderson, M.J.5
-
3
-
-
55249097586
-
Improved heuristics for minimum-ip supertree construction
-
D. Chen, O. Eulenstein, D. Fernandez-Baca, and J. G. Burleigh. Improved heuristics for minimum-ip supertree construction. Evol. Bioinform. Online, 2:391-400, 2006.
-
(2006)
Evol. Bioinform. Online
, vol.2
, pp. 391-400
-
-
Chen, D.1
Eulenstein, O.2
Fernandez-Baca, D.3
Burleigh, J.G.4
-
4
-
-
84949802237
-
Supertrees by ipping
-
Proc. of Conference on Computing and Combinatorics (COCOON 2002), Springer
-
D. Chen, O. Eulenstein, D. Fernández-Baca, and M. Sanderson. Supertrees by ipping. In Proc. of Conference on Computing and Combinatorics (COCOON 2002), volume 2387 of Lect. Notes Comput. Sc., pages 391-400. Springer, 2002.
-
(2002)
Lect. Notes Comput. Sc.
, vol.2387
, pp. 391-400
-
-
Chen, D.1
Eulenstein, O.2
Fernández-Baca, D.3
Sanderson, M.4
-
5
-
-
33646718005
-
Minimum-ip supertrees: Complexity and algorithms
-
D. Chen, O. Eulenstein, D. Fernández-Baca, and M. Sanderson. Minimum-ip supertrees: complexity and algorithms. IEEE/ACM Trans. Comput. Biol. Bioinform., 3(2):165-173, 2006.
-
(2006)
IEEE/ACM Trans. Comput. Biol. Bioinform.
, vol.3
, Issue.2
, pp. 165-173
-
-
Chen, D.1
Eulenstein, O.2
Fernández-Baca, D.3
Sanderson, M.4
-
6
-
-
0003088855
-
The computational complexity of inferring rooted phylogenies by parsimony
-
W. Day, D. Johnson, and D. Sankoff. The computational complexity of inferring rooted phylogenies by parsimony. Math. Biosci., 81:33-42, 1986.
-
(1986)
Math. Biosci.
, vol.81
, pp. 33-42
-
-
Day, W.1
Johnson, D.2
Sankoff, D.3
-
7
-
-
0016742280
-
An idealized concept of the true cladistic character
-
G. Estabrook, C. Johnson, and F. McMorris. An idealized concept of the true cladistic character. Math. Bioscience, 23:263-272, 1975.
-
(1975)
Math. Bioscience
, vol.23
, pp. 263-272
-
-
Estabrook, G.1
Johnson, C.2
McMorris, F.3
-
8
-
-
2442598026
-
Performance of ip supertree construction with a heuristic algorithm
-
Apr
-
O. Eulenstein, D. Chen, J. G. Burleigh, D. Fernández-Baca, and M. J. Sanderson. Performance of ip supertree construction with a heuristic algorithm. Syst. Biol., 53(2):299-308, Apr 2004.
-
(2004)
Syst. Biol.
, vol.53
, Issue.2
, pp. 299-308
-
-
Eulenstein, O.1
Chen, D.2
Burleigh, J.G.3
Fernández-Baca, D.4
Sanderson, M.J.5
-
9
-
-
84987049379
-
Efficient algorithms for inferring evolutionary trees
-
D. Gusfield. Efficient algorithms for inferring evolutionary trees. Networks, 21:19-28, 1991.
-
(1991)
Networks
, vol.21
, pp. 19-28
-
-
Gusfield, D.1
-
10
-
-
0032315457
-
Computing the local consensus of trees
-
S. Kannan, T. Warnow, and S. Yooseph. Computing the local consensus of trees. SIAM J. Comput., 27(6):1695-1724, 1998.
-
(1998)
SIAM J. Comput.
, vol.27
, Issue.6
, pp. 1695-1724
-
-
Kannan, S.1
Warnow, T.2
Yooseph, S.3
-
13
-
-
0012337921
-
Reconstruction of rooted trees from subtrees
-
M. P. Ng and N. C. Wormald. Reconstruction of rooted trees from subtrees. Discrete Appl. Math., 69(1-2):19-31, 1996.
-
(1996)
Discrete Appl. Math.
, vol.69
, Issue.1-2
, pp. 19-31
-
-
Ng, M.P.1
Wormald, N.C.2
-
14
-
-
0026822436
-
Phylogenetic inference based on matrix representation of trees
-
Mar
-
M. A. Ragan. Phylogenetic inference based on matrix representation of trees. Mol. Phylogenet. Evol., 1(1):53-58, Mar 1992.
-
(1992)
Mol. Phylogenet. Evol.
, vol.1
, Issue.1
, pp. 53-58
-
-
Ragan, M.A.1
-
15
-
-
0001541744
-
A supertree method for rooted trees
-
C. Semple and M. Steel. A supertree method for rooted trees. Discrete Appl. Math., 105(1-3):147-158, 2000.
-
(2000)
Discrete Appl. Math.
, vol.105
, Issue.1-3
, pp. 147-158
-
-
Semple, C.1
Steel, M.2
|