Jagota, A., Lyngsø, R. B.
, Pedersen, C. N. S., Gascuel, O. (red.) & Moret, B. M. E. (red.) (2001).
Comparing Hidden Markov Model and a Stochastic Context-Free Grammer. I
Proceedings of the First International Workshop on Algorithms in Bioinformatics (2149 of Lecture Notes in Computer Science udg., Bind Volume 2149/2001, s. 69-94). Springer.
Brodal, G. S., Fagerberg, R.
, Pedersen, C. N. S., Eades, P. (red.) & Takaoka, T. (red.) (2001).
Computing the Quartet Distance Between Evolutionary Trees in Time O(n log² n). I
Proceedings of Algorithms and Computation : 12th International Symposium, ISAAC 2001 (2223 of Lecture Notes in Computer Science udg., Bind 2223/2001, s. 731-742). Springer.
Brodal, G. S., Fagerberg, R.
, Pedersen, C. N. S., Östlin, A., Orejas, F. (red.), Spirakis, P. G. (red.) & Leeuwen, J. V. (red.) (2001).
The Complexity of Constructing Evolutionary Trees Using Experiments. I
Lecture Notes In Computer Science; Vol. 2076: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (2076 of Lecture Notes in Computer Science udg., Bind 2076/2001, s. 140-151). Springer.
