-
1
-
-
0038203926
-
Faster exact solutions for hard problems: A parameterized point of view
-
J. Alber, J. Gramm, and R. Niedermeier. Faster exact solutions for hard problems: a parameterized point of view. Discrete Mathematics, 229(1-3):3-27, 2001.
-
(2001)
Discrete Mathematics
, vol.229
, Issue.1-3
, pp. 3-27
-
-
Alber, J.1
Gramm, J.2
Niedermeier, R.3
-
2
-
-
0000673494
-
Reconstructing the shape of a tree from observed dissimilarity data
-
H.-J. Bandelt and A. Dress. Reconstructing the shape of a tree from observed dissimilarity data. Advances in Applied Mathematics, 7:309-343, 1986.
-
(1986)
Advances in Applied Mathematics
, vol.7
, pp. 309-343
-
-
Bandelt, H.-J.1
Dress, A.2
-
3
-
-
0031721805
-
Constructing phylogenies from quartets: Elucidation of eutherian superordinal relationships
-
A. Ben-Dor, B. Chor, D. Graur, R. Ophir, and D. Pelleg. Constructing phylogenies from quartets: elucidation of eutherian superordinal relationships. Journal of Computational Biology, 5:377-390, 1998.
-
(1998)
Journal of Computational Biology
, vol.5
, pp. 377-390
-
-
Ben-Dor, A.1
Chor, B.2
Graur, D.3
Ophir, R.4
Pelleg, D.5
-
4
-
-
0001117764
-
Inferring evolutionary trees with strong combinatorial evidence
-
Software available through
-
V. Berry and O. Gascuel. Inferring evolutionary trees with strong combinatorial evidence. Theoretical Computer Science, 240:271-298, 2000. Software available through http://www.lirmm.fr/~vberry/PHYLOQUART/phyloquart.html.
-
(2000)
Theoretical Computer Science
, vol.240
, pp. 271-298
-
-
Berry, V.1
Gascuel, O.2
-
6
-
-
84864490502
-
From quartets to phylogenetic trees
-
LNCS, Springer
-
B. Chor. From quartets to phylogenetic trees. In Proceedings of the 25th SOFSEM, number 1521 in LNCS, pages 36-53, 1998. Springer.
-
(1998)
Proceedings of the 25Th SOFSEM
, vol.1521
, pp. 36-53
-
-
Chor, B.1
-
8
-
-
0006573005
-
Parameterized complexity: New developments and research frontiers
-
Downey and Hirschfeldt, eds, to appear, De Gruyter
-
M. R. Fellows. Parameterized complexity: new developments and research frontiers. In Downey and Hirschfeldt, eds, Aspects of Complexity, to appear, 2001. De Gruyter.
-
(2001)
Aspects of Complexity
-
-
Fellows, M.R.1
-
9
-
-
84956972527
-
-
Distributed by the author. Department of Genetics, University of Washington, Seattle, Available through
-
J. Felsenstein. PHYLIP (Phylogeny Inference Package) version 3.5c. Distributed by the author. Department of Genetics, University of Washington, Seattle. 1993. Available through http://evolution.genetics.washington.edu/phylip.
-
(1993)
PHYLIP (Phylogeny Inference Package) Version 3
, vol.5
-
-
Felsenstein, J.1
-
10
-
-
26144440738
-
-
Technical Report WSI-2001-3, WSI für Informatik, Universit ät Tübingen, Fed. Rep. of Germany, January, Report available through
-
J. Gramm and R. Niedermeier. Minimum Quartet Inconsistency is fixed parameter tractable. Technical Report WSI-2001-3, WSI für Informatik, Universit ät Tübingen, Fed. Rep. of Germany, January 2001. Report available through http://www-fs.informatik.uni-tuebingen.de/~gramm/publications.
-
(2001)
Minimum Quartet Inconsistency is Fixed Parameter Tractable
-
-
Gramm, J.1
Niedermeier, R.2
-
11
-
-
0013272768
-
Some open problems in computational molecular biology
-
T. Jiang, P. Kearney, and M. Li. Some open problems in computational molecular biology. Journal of Algorithms, 34:194-201, 2000.
-
(2000)
Journal of Algorithms
, vol.34
, pp. 194-201
-
-
Jiang, T.1
Kearney, P.2
Li, M.3
-
12
-
-
0035706064
-
A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
-
To appear in
-
T. Jiang, P. Kearney, and M. Li. A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application. To appear in SIAM Journal on Computing, 2001.
-
(2001)
SIAM Journal on Computing
-
-
Jiang, T.1
Kearney, P.2
Li, M.3
-
13
-
-
0343129886
-
-
Technical Report WSI-99-18, WSI für Informatik, Universität Tübingen, October, To appear in Journal of Discrete Algorithms
-
R. Niedermeier and P. Rossmanith. An efficient fixed parameter algorithm for 3-Hitting Set. Technical Report WSI-99-18, WSI für Informatik, Universität Tübingen, October 1999. To appear in Journal of Discrete Algorithms.
-
(1999)
An Efficient Fixed Parameter Algorithm for 3-Hitting Set
-
-
Niedermeier, R.1
Rossmanith, P.2
-
15
-
-
64049083135
-
Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining
-
SIAM Press
-
K. St. John, T. Warnow, B.M.E. Moret, and L. Vawter. Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, pages 196-205, 2001. SIAM Press.
-
(2001)
Proceedings of the 12Th ACM-SIAM Symposium on Discrete Algorithms
, pp. 196-205
-
-
St. John, K.1
Warnow, T.2
Moret, B.3
Vawter, L.4
-
16
-
-
52449147252
-
The complexity of reconstructing trees from qualitative characters and subtrees
-
M. Steel. The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification, 9:91-116, 1992.
-
(1992)
Journal of Classification
, vol.9
, pp. 91-116
-
-
Steel, M.1
-
17
-
-
0029836454
-
Quartet puzzling: A quartet maximum-likelihood method for reconstructing tree topologies
-
K. Strimmer and A. von Haeseler. Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies. Molecular Biology and Evolution,13(7):964-969, 1996.
-
(1996)
Molecular Biology and Evolution
, vol.13
, Issue.7
, pp. 964-969
-
-
Strimmer, K.1
Von Haeseler, A.2
|